Spherical dimension
Not on the map. Why?
Abstract (arXiv)
We introduce and study the spherical dimension, a natural topological relaxation of the VC dimension that unifies several results in learning theory where topology plays a key role in the proofs. The spherical dimension is defined by extending the set of realizable datasets (used to define the VC dimension) to the continuous space of realizable distributions. In this space, a shattered set of size d (in the VC sense) is completed into a continuous object, specifically a d-dimensional sphere of realizable distributions. The spherical dimension is then defined as the dimension of the largest sphere in this space. Thus, the spherical dimension is at least the VC dimension. The spherical dimension serves as a common foundation for leveraging the Borsuk-Ulam theorem and related topological tools. We demonstrate the utility of the spherical dimension in diverse applications, including disambiguations of partial concept classes, reductions from classification to stochastic convex optimization, stability and replicability, and sample compression schemes. Perhaps surprisingly, we show that the open question posed by Alon, Hanneke, Holzman, and Moran (FOCS 2021) of whether there exist non-trivial disambiguations for halfspaces with margin is equivalent to the basic open question of whether the VC and spherical dimensions are finite together.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 20 of its 62 references that are in the map. First posted on arXiv 13 Mar 2025.
Builds on
20 of 62 references.
References · 20
- 2018Private PAC learning implies finite Littlestone dimensioncited by 74
- 2020An Equivalence Between Private Classification and Online Predictioncited by 64
- 2021A Theory of PAC Learnability of Partial Concept Classescited by 60
- 2020Proper Learning, Helly Number, and an Optimal SVM Boundcited by 53
- 2015Sample compression schemes for VC classescited by 47
- 2022Reproducibility in Learningcited by 44
- 2020Approximate is Good Enough: Probabilistic Variants of Dimensional and Margin Complexitycited by 25
- 2018Unlabeled sample compression schemes and corner peelings for ample and maximum classescited by 16
- 2023Local Borsuk-Ulam, Stability, and Replicabilitycited by 14
- 20152 Notes on Classes with Vapnik-Chervonenkis Dimension 1cited by 12
- 2015Labeled compression schemes for extremal classescited by 11
- 2022Sample compression schemes for balls in graphscited by 9
8 more
- 2023Replicability and stability in learningcited by 8
- 2021Labeled sample compression schemes for complexes of oriented matroidscited by 7
- 2024On the Computational Landscape of Replicable Learningcited by 7
- 2014Bounding Embeddings of VC Classes into Maximum Classescited by 5
- 2022Unlabelled Sample Compression Schemes for Intersection-Closed Classes and Extremal Classescited by 5
- 2024Dual VC Dimension Obstructs Sample Compression by Embeddingscited by 5
- 2025Stability and List-Replicability for Agnostic Learnerscited by 4
- 2024On Reductions and Representations of Learning Problems in Euclidean Spacescited by 1
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025Borsuk-Ulam and Replicable Learning of Large-Margin Halfspacescited by 4
- 2025Simplicial covering dimension of extremal concept classescited by 2
- 2026Tight list replicability bounds via a novel sphere covering theoremcited by 1
- 2026Sign-Rank, Index, and List Replicability: Connections and Separationscited by 1
- 2026Sign-Rank, Index, and List Replicability: Connections and Separations16 Jun 2026
- 2026Tight list replicability bounds via a novel sphere covering theorem4 Jun 2026
- 2025Simplicial covering dimension of extremal concept classes14 Nov 2025
- 2025Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces19 Mar 2025