phenomenon · first seen 5 Oct 2026
Littlestone dimension
A combinatorial measure of the complexity of a hypothesis class governing mistake bounds in online learning.
Mentions per week
PapersCodeDiscussion
Earliest sources
- Private online learning and prediction for Littlestone classesPapers · 5 Oct 2026 · Amartya Sanyal
- Nearly Linear Private Learning of Littlestone ClassesPapers · 16 Oct 2026 · Shay Moran, Chao Yan
- No-Regret Language GenerationPapers · 16 Oct 2026 · Jiaxun Li, Vinod Raman, Ambuj Tewari
- Optimal Multiclass Online Regret with Arbitrary Label SpacesPapers · 23 Oct 2026 · Sajad Ashkezari, Shai Ben-David
- Near-Optimal List Replicability from Littlestone DimensionPapers · 23 Oct 2026 · Ari Blondal, Pooya Hatami, Chavdar Lalov, Sivan Tretiak
- New Lower Bounds for Private PAC LearningPapers · 30 Oct 2026 · Prathamesh Dharangutte, Amartya Sanyal
Latest sources
- New Lower Bounds for Private PAC LearningPapers · 30 Oct 2026 · Prathamesh Dharangutte, Amartya Sanyal
- Near-Optimal List Replicability from Littlestone DimensionPapers · 23 Oct 2026 · Ari Blondal, Pooya Hatami, Chavdar Lalov, Sivan Tretiak
- Optimal Multiclass Online Regret with Arbitrary Label SpacesPapers · 23 Oct 2026 · Sajad Ashkezari, Shai Ben-David
- No-Regret Language GenerationPapers · 16 Oct 2026 · Jiaxun Li, Vinod Raman, Ambuj Tewari
- Nearly Linear Private Learning of Littlestone ClassesPapers · 16 Oct 2026 · Shay Moran, Chao Yan
- Private online learning and prediction for Littlestone classesPapers · 5 Oct 2026 · Amartya Sanyal