Research map / Learning theory and algorithms / Sample complexity
Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes
Alkis Kalavasis, Grigoris Velegkas, Amin Karbasi
Read the paperCheck your idea against 137,217 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)
- Representation Preserving Multiclass Agnostic to Realizable Reduction (ICML 2025 · similarity 0.89)
- Universal Rates for Active Learning (NeurIPS 2024 · similarity 0.88)
- Fast Rates for Bandit PAC Multiclass Classification (NeurIPS 2024 · similarity 0.88)
- Collaborative Learning with Different Labeling Functions (ICML 2024 · similarity 0.87)
- Surprises in Proper Positive-Only Learning (NeurIPS 2026 · similarity 0.86)
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.
