Applications of Littlestone dimension to query learning and to compression

DOI10.4230/LIPICS.MFCS.2024.42MaRDI QIDQ7241044zbMATH OpenFDO

Authors Hunter Chase, James Freitag, Lev Reyzin

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2024.42

zbMATH Keywords

compression schemeLittlestone dimensionquery learningrandom queries

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
• Compression schemes, stable definable families, and o-minimal structures
• MODEL THEORY AND MACHINE LEARNING
• Sample Compression Schemes for VC Classes
• The power of random counterexamples
• Unlabeled compression schemes for maximum classes

This page was built for publication: Applications of Littlestone dimension to query learning and to compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241044)