On the Equivalence between Online and Private Learnability beyond Binary Classification
Not on the map. Why?
Abstract (arXiv)
Alon et al. [2019] and Bun et al. [2020] recently showed that online learnability and private PAC learnability are equivalent in binary classification. We investigate whether this equivalence extends to multi-class classification and regression. First, we show that private learnability implies online learnability in both settings. Our extension involves studying a novel variant of the Littlestone dimension that depends on a tolerance parameter and on an appropriate generalization of the concept of threshold functions beyond binary classification. Second, we show that while online learnability continues to imply private learnability in multi-class classification, current proof techniques encounter significant hurdles in the regression setting. While the equivalence for regression remains open, we provide non-trivial sufficient conditions for an online learnable class to also be privately learnable.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 1; 2023: 2; 2024: 1; 2025: 2; 2026: 1.
12 papers.
- 2023Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalizationcited by 42
- 2021Majorizing Measures, Sequential Complexities, and Online Learningcited by 17
- 2023Statistical Indistinguishability of Learning Algorithmscited by 17
- 2021Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Gamescited by 16
- 2021Private learning implies quantum stabilitycited by 10
- 2022Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classescited by 8
- 2024Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' Theoremcited by 6
- 2021Multiclass versus Binary Differentially Private PAC Learningcited by 4
- 2021Differentially Private Nonparametric Regression Under a Growth Conditioncited by 3
- 2025Private Learning of Littlestone Classes, Revisitedcited by 3
- 2025Private List Learnability vs. Online List Learnabilitycited by 2
- 2026Encoding orders and trees in real-valued functionscited by 0
- 2026Encoding orders and trees in real-valued functions23 Jul 2026
- 2025Private Learning of Littlestone Classes, Revisited30 Sep 2025
- 2025Private List Learnability vs. Online List Learnability15 Jun 2025
- 2024Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' Theorem10 Jul 2024
- 2023Statistical Indistinguishability of Learning Algorithms23 May 2023
- 2023Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization22 Mar 2023
- 2022Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes16 Nov 2022
- 2021Differentially Private Nonparametric Regression Under a Growth Condition24 Nov 2021
- 2021Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games17 Nov 2021
- 2021Multiclass versus Binary Differentially Private PAC Learning22 Jul 2021
- 2021Private learning implies quantum stability14 Feb 2021
- 2021Majorizing Measures, Sequential Complexities, and Online Learning2 Feb 2021