Research map / Learning theory and algorithms / Sample complexity
On Batch Teaching with Sample Complexity Bounded by VCD
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
- Preference-Based Batch and Sequential Teaching: Towards a Unified View of Models (NeurIPS 2019 · similarity 0.90)
- On a Combinatorial Problem Arising in Machine Teaching (ICML 2024 · similarity 0.86)
- The Computational Complexity of Positive Non-Clashing Teaching in Graphs (ICLR 2025 · similarity 0.84)
- Improved Sample Complexity for Multiclass PAC Learning (NeurIPS 2024 · similarity 0.84)
- On the Complexity of Teaching a Family of Linear Behavior Cloning Learners (NeurIPS 2024 · similarity 0.84)
- Learning to Solve Complex Problems via Dataset Decomposition (NeurIPS 2025 · similarity 0.83)
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.