A characterization of list learnability
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 51427 (Why is no real title available?)
- scientific article; zbMATH DE number 5485581 (Why is no real title available?)
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A generalization of Sauer's lemma
- A theory of the learnable
- A theory of universal learning
- Algorithmic High-Dimensional Robust Statistics
- Corrigendum to ``Shifting: One-inclusion mistake bounds and sample compression
- Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension
- Learnability and the Vapnik-Chervonenkis dimension
- Learning from untrusted data
- List Decodable Learning via Sum of Squares
- List-decodable robust mean estimation and learning mixtures of spherical Gaussians
- Multiclass learnability and the ERM principle
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the density of families of sets
- On the uniform convergence of the frequencies of occurrence of events to their probabilities
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Sample Compression Schemes for VC Classes
- Understanding machine learning. From theory to algorithms
This page was built for publication: A characterization of list learnability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499335)
