A characterization of list learnability
From MaRDI portal
Publication:6499335
DOI10.1145/3564246.3585190MaRDI QIDQ6499335
Moses Charikar, Chirag Pabbaraju
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Corrigendum to ``Shifting: One-inclusion mistake bounds and sample compression
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- A generalization of Sauer's lemma
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension
- Sample Compression Schemes for VC Classes
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Learning from untrusted data
- List Decodable Learning via Sum of Squares
- List-decodable robust mean estimation and learning mixtures of spherical gaussians
- On the Uniform Convergence of the Frequencies of Occurrence of Events to Their Probabilities
- Understanding Machine Learning
- A theory of universal learning
- Algorithmic High-Dimensional Robust Statistics
This page was built for publication: A characterization of list learnability
