The Bayesian Stability Zoo
Not on the map. Why?
Abstract (arXiv)
We show that many definitions of stability found in the learning theory literature are equivalent to one another. We distinguish between two families of definitions of stability: distribution-dependent and distribution-independent Bayesian stability. Within each family, we establish equivalences between various definitions, encompassing approximate differential privacy, pure differential privacy, replicability, global stability, perfect generalization, TV stability, mutual information stability, KL-divergence stability, and R'enyi-divergence stability. Along the way, we prove boosting results that enable the amplification of the stability of a learning rule. This work is a step towards a more systematic taxonomy of stability notions in learning theory, which can promote clarity and an improved understanding of an array of stability concepts that have emerged in recent years.
Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 13 of its 45 references that are in the map. First posted on arXiv 27 Oct 2023.
Builds on
13 of 45 references.
References · 13
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 303
- 2014Preserving Statistical Validity in Adaptive Data Analysiscited by 103
- 2018Private PAC learning implies finite Littlestone dimensioncited by 74
- 2020An Equivalence Between Private Classification and Online Predictioncited by 64
- 2022Robustness Implies Privacy in Statistical Estimationcited by 47
- 2022Reproducibility in Learningcited by 44
- 2023Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalizationcited by 42
- 2023From Robustness to Privacy and Backcited by 27
- 2020A Limitation of the PAC-Bayes Frameworkcited by 25
- 2023Statistical Indistinguishability of Learning Algorithmscited by 17
- 2016Adaptive Learning with Robust Generalization Guaranteescited by 15
- 2022Finite Littlestone Dimension Implies Finite Information Complexitycited by 7
1 more
Built on by
Citing papers per year: 2024: 5; 2025: 4; 2026: 4.
13 papers.
Sort:
- 2024Replicable Learning of Large-Margin Halfspacescited by 12
- 2024Replicability in High Dimensional Statisticscited by 8
- 2024On the Computational Landscape of Replicable Learningcited by 7
- 2024Replicable Uniformity Testingcited by 4
- 2025Borsuk-Ulam and Replicable Learning of Large-Margin Halfspacescited by 4
- 2025Private List Learnability vs. Online List Learnabilitycited by 2
- 2025Replicable Distribution Testingcited by 2
- 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
- 2024Generalizability of experimental studiescited by 0
- 2026Computationally Efficient Replicable Learning of Parities and Applicationscited by 0
1 more
- 2026Expressivity of Contradiction Graphscited by 0
- 2026Sign-Rank, Index, and List Replicability: Connections and Separations16 Jun 2026
- 2026Tight list replicability bounds via a novel sphere covering theorem4 Jun 2026
- 2026Expressivity of Contradiction Graphs19 May 2026
- 2026Computationally Efficient Replicable Learning of Parities and Applications10 Feb 2026
- 2025Simplicial covering dimension of extremal concept classes14 Nov 2025
- 2025Replicable Distribution Testing3 Jul 2025
- 2025Private List Learnability vs. Online List Learnability15 Jun 2025
- 2025Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces19 Mar 2025
- 2024Replicable Uniformity Testing12 Oct 2024
- 2024Generalizability of experimental studies25 Jun 2024
- 2024Replicability in High Dimensional Statistics4 Jun 2024
- 2024On the Computational Landscape of Replicable Learning24 May 2024
1 more
- 2024Replicable Learning of Large-Margin Halfspaces21 Feb 2024
- 2024Replicable Learning of Large-Margin Halfspacescited by 12
- 2024Replicability in High Dimensional Statisticscited by 8
- 2024On the Computational Landscape of Replicable Learningcited by 7
- 2024Replicable Uniformity Testingcited by 4
- 2025Borsuk-Ulam and Replicable Learning of Large-Margin Halfspacescited by 4
- 2025Private List Learnability vs. Online List Learnabilitycited by 2
- 2025Replicable Distribution Testingcited by 2
- 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
- 2024Generalizability of experimental studiescited by 0
- 2026Computationally Efficient Replicable Learning of Parities and Applicationscited by 0
12 most cited of 13 All 13 (JSON)
- 2026Sign-Rank, Index, and List Replicability: Connections and Separations16 Jun 2026
- 2026Tight list replicability bounds via a novel sphere covering theorem4 Jun 2026
- 2026Expressivity of Contradiction Graphs19 May 2026
- 2026Computationally Efficient Replicable Learning of Parities and Applications10 Feb 2026
- 2025Simplicial covering dimension of extremal concept classes14 Nov 2025
- 2025Replicable Distribution Testing3 Jul 2025
- 2025Private List Learnability vs. Online List Learnability15 Jun 2025
- 2025Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces19 Mar 2025
- 2024Replicable Uniformity Testing12 Oct 2024
- 2024Generalizability of experimental studies25 Jun 2024
- 2024Replicability in High Dimensional Statistics4 Jun 2024
- 2024On the Computational Landscape of Replicable Learning24 May 2024
12 newest of 13 All 13 (JSON)