Related papers: On (not) learning the M\"obius function

We study the problem of learning general (i.e., not necessarily homogeneous) halfspaces with Random Classification Noise under the Gaussian distribution. We establish nearly-matching algorithmic and Statistical Query (SQ) lower bound…

We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…

In this paper, we study data-dependent generalization error bounds exhibiting a mild dependency on the number of classes, making them suitable for multi-class learning with a large number of label classes. The bounds generally hold for…

Using geometric methods, we improve on the function field version of the Burgess bound, and show that, when restricted to certain special subspaces, the M\"{o}bius function over $\mathbb F_q[T]$ can be mimicked by Dirichlet characters.…

We prove the tightest-known upper bounds on the sample complexity of multi-group learning. Our algorithm extends the one-inclusion graph prediction strategy using a generalization of bipartite $b$-matching. In the group-realizable setting,…

This note deals with the computation of the factorization number $F_2(G)$ of a finite group $G$. By using the M\"{o}bius inversion formula, explicit expressions of $F_2(G)$ are obtained for two classes of finite abelian groups, improving…

Given the high power density low discharge rate and decreasing cost rechargeable lithium-ion batteries LiBs have found a wide range of applications such as power grid level storage systems electric vehicles and mobile devices. Developing a…

We study upper bounds, approximations, and limits for functions of motivic exponential class, uniformly in non-Archimedean local fields whose characteristic is $0$ or sufficiently large. Our results together form a flexible framework for…

The M\"obius function for a group, $G$, was introduced in 1936 by Hall in order to count ordered generating sets of $G$. In this paper we determine the M\"obius function of the simple small Ree groups, $R(q)={}^2G_2(q)$ where $q=3^{2m+1}$…

Ensemble learning plays a crucial role in practical applications of online learning due to its enhanced classification performance and adaptable adjustment mechanisms. However, most weight allocation strategies in ensemble learning are…

Let $\mathcal{A}$ be an abelian variety over a number field, with a good reduction at a prime ideal containing a prime number $p$. Denote by ${\rm A}$ an abelian variety over a finite field of characteristic $p$, obtained by the reduction…

We consider the problem of learning functions within the $\mathcal{F}_{p,\pi}$ and Barron spaces, which play crucial roles in understanding random feature models (RFMs), two-layer neural networks, as well as kernel methods. Leveraging tools…

We consider the problem of learning convolution operators associated to compact Abelian groups. We study a regularization-based approach and provide corresponding learning guarantees under natural regularity conditions on the convolution…

We prove quantitative estimates for averages of the von Mangoldt and M\"obius functions along polynomial progressions $n+P_1(m),\ldots, n+P_k(m)$ for a large class of polynomials $P_i$. The error terms obtained save an arbitrary power of…

Let $P^-(n)$ denote the smallest prime factor of a natural integer $n>1$. Furthermore let $\mu$ and $\omega$ denote respectively the M\"obius function and the number of distinct prime factors function. We show that, given any set ${{\scr…

In this article we consider a large family of nonlinear nonlocal equations involving gradient nonlinearity and provide a unified approach, based on the Ishii-Lions type technique, to establish Liouville properties of the solutions. We also…

Meta-learning, or "learning to learn", refers to techniques that infer an inductive bias from data corresponding to multiple related tasks with the goal of improving the sample efficiency for new, previously unobserved, tasks. A key…

Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry…

We give a new proof of a result from well quasi-order theory on the computability of bases for upwards-closed sets of words. This new proof is based on Angluin's L* algorithm, that learns an automaton from a minimally adequate teacher. This…

In this paper we classify M\"{o}bius invariant differential operators of second order in two dimensional Euclidean space, and establish a Liouville type theorem for general M\"{o}bius invariant elliptic equations.