Teacher Improves Learning by Selecting a Training Subset
Not on the map. Why?
Abstract (arXiv)
We call a learner super-teachable if a teacher can trim down an iid training set while making the learner learn even better. We provide sharp super-teaching guarantees on two learners: the maximum likelihood estimator for the mean of a Gaussian, and the large margin classifier in 1D. For general learners, we provide a mixed-integer nonlinear programming-based algorithm to find a super teaching set. Empirical experiments show that our algorithm is able to find good super-teaching sets for both regression and classification problems.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Feb 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 2; 2025: 1.
6 papers.
- 2024Lurking in the shadows: Unveiling Stealthy Backdoor Attacks against Personalized Federated Learningcited by 6
- 2024Representational Alignment Supports Effective Machine Teachingcited by 3
- 2025Data Selection for ERMscited by 3
- 2021Feedback Coding for Active Learningcited by 1
- 2022Time-Constrained Learningcited by 1
- 2023Optimally Teaching a Linear Behavior Cloning Agentcited by 0
- 2025Data Selection for ERMs20 Apr 2025
- 2024Lurking in the shadows: Unveiling Stealthy Backdoor Attacks against Personalized Federated Learning10 Jun 2024
- 2024Representational Alignment Supports Effective Machine Teaching6 Jun 2024
- 2023Optimally Teaching a Linear Behavior Cloning Agent26 Nov 2023
- 2022Time-Constrained Learning4 Feb 2022
- 2021Feedback Coding for Active Learning28 Feb 2021