Research map / Learning theory and algorithms / Sample complexity
On the Recursive Teaching Dimension of VC Classes
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace the O(d 2^d log log|C|) bound of Moran et al. with a bound depending only on VC dimension, RTD <= 2^{d+1}(d-2)+d+4 | recursive teaching dimension of VC classes · theoretical, VC dimension d | upper bound on RTD | Helped |
| Use SAT solvers to find a class C0 (VCD 3, RTD 5, n=12) and take k-fold Cartesian products | worst-case ratio RTD/VCD · concept classes | RTD/VCD ratio: 5/3 vs prior 3/2 | Helped |
Closest papers by meaning
- On a Combinatorial Problem Arising in Machine Teaching (ICML 2024 · similarity 0.85)
- 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)
- An Õptimal Differentially Private PAC Learner for Concept Classes with VC Dimension 1 (NeurIPS 2026 · similarity 0.84)
- The Parameterized Complexity of Computing the VC-Dimension (NeurIPS 2025 · similarity 0.84)
- Multiclass Transductive Online Learning (NeurIPS 2024 · 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.