Research map / Learning theory and algorithms / Sample complexity
A Parameterized Theory of PAC Learning
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Improved Sample Complexity for Multiclass PAC Learning (NeurIPS 2024 · similarity 0.90)
- Learning Distributions from Multiple Data Providers (NeurIPS 2026 · similarity 0.89)
- Transductive Learning is Compact (NeurIPS 2024 · similarity 0.88)
- On the Computational Landscape of Replicable Learning (NeurIPS 2024 · similarity 0.88)
- Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale (NeurIPS 2026 · similarity 0.87)
- Optimal Sample Complexity of Contrastive Learning (ICLR 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.