Related papers: Unlabeled Compression Schemes Exceeding the VC-dim…
We introduce a new type of $n$-dimensional generalization of symmetric $(v,k,\lambda)$ block designs. We prove upper bounds on the dimension $n$ in terms of $v$ and $k$. We also define the corresponding concept of $n$-dimensional difference…
We consider non-parametric estimation and inference of conditional moment models in high dimensions. We show that even when the dimension $D$ of the conditioning variable is larger than the sample size $n$, estimation and inference is…
We prove that, for any $d$ linearly independent functions from some set into a $d$-dimensional vector space over any field, the family of zero sets of all non-trivial linear combination of these functions has VC-dimension and Littlestone…
Universal source coding at short blocklengths is considered for an exponential family of distributions. The \emph{Type Size} code has previously been shown to be optimal up to the third-order rate for universal compression of all memoryless…
In this paper, we investigate the redundancy of universal coding schemes on smooth parametric sources in the finite-length regime. We derive an upper bound on the probability of the event that a sequence of length $n$, chosen using…
The VC-dimension of a family of sets is a measure of its combinatorial complexity used in machine learning theory, computational geometry, and even model theory. Computing the VC-dimension of the $k$-fold union of geometric set systems has…
We show that certain families of sets in $\mathbb{R}^2$ (or $\mathbb{R}^n$) which are neither definable nor have bounded VC-dimension are nonetheless uniformly approximately definable in the real field, an o-minimal structure.
In this paper we construct a model for the classifying space, BVCG, of a crystallographic group G of rank n relative to the family VC of virtually-cyclic subgroups of G. The model is used to show that there exists no other model for the…
We investigate the longstanding problem of determining the maximum size of a $(d+1)$-uniform set system with VC-dimension at most $d$. Since the seminal 1984 work of Frankl and Pach, which established the elegant upper bound $\binom{n}{d}$,…
We analyze the large scale structure and fluctuations of jammed packings of size disperse spheres, produced in a granular experiment as well as numerically. While the structure factor of the packings reveals no unusual behavior for small…
The largest possible average diameter of a bounded cell of a simple hyperplane arrangement is conjectured to be not greater than the dimension. We prove that this conjecture holds in dimension 2, and is asymptotically tight in fixed…
Using projection between Euclidian spaces of different dimensions, the signal compression and decompression become straightforward. This encoding/decoding technique requires no preassigned measuring matrix as in compressed sensing.…
The maximal dimension of commutative subspaces of $M_n(\mathbb{C})$ is known. So is the structure of such a subspace when the maximal dimension is achieved. We consider extensions of these results and ask the following natural questions: If…
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…
With $k$ an infinite field and $\tau_1,\tau_2$ endomorphisms of $k^m$, we provide a dimension bound on an open locus of a determinantal scheme, under which, for a general subspace $V \subseteq k^m$ of dimension $n \le m/2$, for $v_1,v_2 \in…
The Vapnik-Chervonenkis (VC) dimension of a collection of subsets of a set is an important combinatorial concept in settings such as discrete geometry and machine learning. In this paper we prove that the VC dimension of the family of…
An envelope is a targeted dimension reduction subspace for simultaneously achieving dimension reduction and improving parameter estimation efficiency. While many envelope methods have been proposed in recent years, all envelope methods…
We study a notion of VC-dimension for subsets of groups, defining this for a set $A$ to be the VC-dimension of the family $\{ (xA) \cap A : x \in A\cdot A^{-1} \}$. We show that if a finite subset $A$ of an abelian group has bounded…
The Charge Convexity Conjecture (CCC) states that in a unitary conformal field theory in $d\geq 3$ dimensions with a global symmetry, the minimal dimension of operators in certain representations of the symmetry, as a function of the charge…
We consider the problem of finding the maximum possible size of a family of k-dimensional subcubes of the n-cube {0,1}^{n}, none of which is contained in the union of the others. (We call such a family `irredundant'). Aharoni and Holzman…