cs.LGMar 25, 2026

Uniform Laws of Large Numbers in Product Spaces

Authors: Ron Holzman, Shay Moran, Alexander Shlimovich

Organizations: Department of Mathematics, Technion · Departments of Mathematics, Computer Science, and Data and Decision Sciences, Technion and Google Research

Abstract

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 Rd\mathbb{R}^d has linear VC dimension 22, while its VC dimension is infinite already for d≥2d\ge 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.

Figures & tables

Explore similar work

CardsList
  1. Uniform convergence at optimal rate and scale

    Oct 17, 2026Noga Alon, Steve Hanneke, Shay Moran +1Generalization Bounds

  2. Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale

    May 13, 2026Shashaank Aiyer, Yishay Mansour, Shay Moran +2Agnostic LearningStatistical Learning Theory

  3. A Fine-Grained Understanding of Uniform Convergence for Halfspaces

    May 7, 2026Aryeh Kontorovich, Kasper Green LarsenHalfspace LearningStatistical Learning Theory