Intrinsic characterization of private PAC sample complexity
Identify a combinatorial measure that characterizes the sample complexity of privately PAC learning every measurable hypothesis class of finite Littlestone dimension, without restricting the class to Cartesian products of VC-one factors, countable evaluation quotients, or candidate-wise small-δ regimes.
References
Identify a combinatorial measure of a class that determines the sample complexity of privately learning it, analogously to the characterization of non-private learning in terms of the VC dimension.
— VALG: An Agentic System for ML Theory Research
(2608.13060 - Zhang et al., 13 Aug 2026) in Section 4, Subsection “Does Differential Privacy Make PAC Learning Much Harder?”, Subproblem 1: The Sample Complexity of Private Learning
The other two questions---the optimal sample complexity and the algorithmic principles that attain it---remain open.
— Nearly Linear Private Learning of Littlestone Classes
(2610.23160 - Moran et al., 16 Oct 2026) in Section 1, Introduction
This question, explicitly raised by Nissim, Stemmer, and Tsfadia in their COLT 2026 open-problem paper, remains open.
— Nearly Linear Private Learning of Littlestone Classes
(2610.23160 - Moran et al., 16 Oct 2026) in Section 2, subsection “Nearly Linear Dependence on Littlestone Dimension”