Uniform Laws of Large Numbers in Product Spaces
Not on the map. Why?
Abstract (arXiv)
Uniform laws of large numbers form a cornerstone of Vapnik--Chervonenkis theory, where they are characterized by the finiteness of the VC dimension. In this work, we study uniform convergence phenomena in cartesian product spaces, under assumptions on the underlying distribution that are compatible with the product structure. Specifically, we assume that the distribution is absolutely continuous with respect to the product of its marginals, a condition that captures many natural settings, including product distributions, sparse mixtures of product distributions, distributions with low mutual information, and more. We show that, under this assumption, a uniform law of large numbers holds for a family of events if and only if the linear VC dimension of the family is finite. The linear VC dimension is defined as the maximum size of a shattered set that lies on an axis-parallel line, namely, a set of vectors that agree on all but at most one coordinate. This dimension is always at most the classical VC dimension, yet it can be arbitrarily smaller. For instance, the family of convex sets in ℝd has linear VC dimension 2, while its VC dimension is infinite already for d≥ 2. Our proofs rely on estimator that departs substantially from the standard empirical mean estimator and exhibits more intricate structure. We show that such deviations from the standard empirical mean estimator are unavoidable in this setting. Throughout the paper, we propose several open questions, with a particular focus on quantitative sample complexity bounds.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 7 of its 23 references that are in the map. First posted on arXiv 25 Mar 2026.
Builds on
7 of 23 references.
References · 7
- 2019Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problemcited by 22
- 2017Learning Multi-item Auctions with (or without) Samplescited by 18
- 2020Boosting Simple Learnerscited by 16
- 2023Prediction, Learning, Uniform Convergence, and Scale-sensitive Dimensionscited by 12
- 2020Downsampling for Testing and Learning in Product Distributionscited by 4
- 2024High-arity PAC learning via exchangeabilitycited by 4
- 2019Graph-based Discriminators: Sample Complexity and Expressivenesscited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026High-arity Sample Compressioncited by 0
- 2026A Rate Separation for Agnostic Direct Sumscited by 0
- 2026A Rate Separation for Agnostic Direct Sums7 Aug 2026
- 2026High-arity Sample Compression12 May 2026