On the Equivalence between Online and Private Learnability beyond Binary Classification
Young Hun Jung, Baekjin Kim, Ambuj Tewari
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4730290f-8e33-4de1-be27-d5d15abd5d51Cited by top-tier papers8
- Private learning implies quantum stabilityYihui Quek, Srinivasan Arunachalam, John A. SmolinNeurIPS 2021 · 20 citations
- Statistical Indistinguishability of Learning AlgorithmsAlkis Kalavasis, Amin Karbasi, Shay Moran, Grigoris VelegkasICML 2023 · 20 citations
- A Computational Separation between Private Learning and Online LearningMark BunNeurIPS 2020 · 11 citations
- Fast rates for nonparametric online learning: from realizability to learning in gamesConstantinos Daskalakis, Noah GolowichSTOC 2022 · 8 citations
- Multiclass versus Binary Differentially Private PAC LearningSatchit Sivakumar, Mark Bun, Marco GaboardiNeurIPS 2021 · 5 citations
Builds on1
Related papers
- Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' TheoremSimone Fioravanti, Steve Hanneke, Shay Moran, Hilla Schefler et al.FOCS 2024 · 1 citation
- Littlestone Classes are Privately Online LearnableNoah Golowich, Roi LivniNeurIPS 2021 · 15 citations
- Private Online Learning against an Adaptive Adversary: Realizable and Agnostic SettingsBo Li, Wei Wang, Peng YeNeurIPS 2025 · 2 citations
- Private Learning of Littlestone Classes, RevisitedXin LyuSTOC 2026 · 4 citations
- A Trichotomy for Transductive Online LearningSteve Hanneke, Shay Moran, Jonathan ShaferNeurIPS 2023 · 15 citations
