Samplability makes learning easier
From MaRDI portal
Cites work
- A theory of the learnable
- Average Case Complete Problems
- Cryptographic primitives based on hard learning problems
- Distributional PAC-learning from Nisan's natural proofs
- Improved learning from Kolmogorov complexity
- Learnability and the Vapnik-Chervonenkis dimension
- Lifting uniform learners via distributional decomposition
- On computable online learning
- On learnability wih computable learners
- On the learnability of discrete distributions
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On worst-case learning in relativized heuristica
- Random generation of combinatorial structures from a uniform distribution
- The need for structure in quantum speedups
- Understanding machine learning. From theory to algorithms
This page was built for publication: Samplability makes learning easier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445533)