Related papers: Uniform Approximation of Vapnik-Chervonenkis Class…
For any set system $H=(V,R), \ R \subseteq 2^V$, a subset $S \subseteq V$ is called \emph{shattered} if every $S' \subseteq S$ results from the intersection of $S$ with some set in $\R$. The \emph{VC-dimension} of $H$ is the size of a…
In this note we disprove a conjecture of Kuzmin and Warmuth claiming that every family whose VC-dimension is at most d admits an unlabeled compression scheme to a sample of size at most d. We also study the unlabeled compression schemes of…
We consider Bratteli diagrams of finite rank (not necessarily simple) and ergodic invariant measures with respect to the cofinal equivalence relation on their path spaces. It is shown that every ergodic invariant measure (finite or…
We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…
We prove a universal projection theorem, giving conditions on a parametrized family of maps $\Pi_\lambda : X \to \mathbb{R}^d$ and a collection M of measures on X under which for almost every $\lambda$ equality $\dim_H \Pi_\lambda \mu =…
The Natarajan dimension is a fundamental tool for characterizing multi-class PAC learnability, generalizing the Vapnik-Chervonenkis (VC) dimension from binary to multi-class classification problems. This work establishes upper bounds on…
Consider a Poisson point process within a convex set in a Euclidean space. The Vietoris-Rips complex is the clique complex over the graph connecting all pairs of points with distance at most $\delta$. Summing powers of the volume of all…
Given a rigid C*-tensor category C with simple unit and a probability measure $\mu$ on the set of isomorphism classes of its simple objects, we define the Poisson boundary of $(C,\mu)$. This is a new C*-tensor category P, generally with…
Let $G=(V,E)$ be a graph. A $k$-neighborhood in $G$ is a set of vertices consisting of all the vertices at distance at most $k$ from some vertex of $G$. The hypergraph on vertex set $V$ which edge set consists of all the $k$-neighborhoods…
The present paper establishes the correspondence between the properties of the solutions of a class of PDEs and the geometry of sets in Euclidean space. We settle the question of whether (quantitative) absolute continuity of the elliptic…
This article studies exponential families $\mathcal{E}$ on finite sets such that the information divergence $D(P\|\mathcal{E})$ of an arbitrary probability distribution from $\mathcal{E}$ is bounded by some constant $D>0$. A particular…
The Universal Coding of Integers~(UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. A UCI is a class of prefix codes for which the ratio of the average codeword…
The main result of this note, Theorem 2, is the following: a Borel measure on the space of infinite Hermitian matrices, that is invariant under the action of the infinite unitary group and that admits well-defined projections onto the…
We introduce the notion of $\epsilon$-irreducibility for arithmetic cycles meaning that the degree of its analytic part is small compared to the degree of its irreducible classical part. We will show that for every $\epsilon>0$ any…
Let X be a closed subset of a locally compact second countable group G whose family of translates has finite VC-dimension. We show that the topological border of X has Haar measure 0. Under an extra technical hypothesis, this also holds if…
In response to a 1997 problem of M. Vidyasagar, we state a criterion for PAC learnability of a concept class $\mathscr C$ under the family of all non-atomic (diffuse) measures on the domain $\Omega$. The uniform Glivenko--Cantelli property…
The Chirikov standard map family is a one-parameter family of volume-preserving maps exhibiting hyperbolicity on a `large' but noninvariant subset of phase space. Based on this predominant hyperbolicity and numerical experiments, it is…
We show that the VC-density of any partitioned formula in a pair of ordered vector spaces is bounded above by twice the number of parameter variables. We also show that this bound is optimal and, as a by-product, we prove that no dense pair…
Let $X$ be an absolutely continuous random variable from the integrated Pearson family and assume that $X$ has finite moments of any order. Using some properties of the associated orthonormal polynomial system, we provide a class of…
A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…