Co-occurring keywords · papers mentioning both
Papers
Lower Bounds for Greedy Teaching Set Constructions
COLT 2025
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
ICLR 2025
MAP- and MLE-Based Teaching
JMLR 2024
Non-Clashing Teaching Maps for Balls in Graphs
COLT 2024
On a Combinatorial Problem Arising in Machine Teaching
ICML 2024
Bandit Learnability can be Undecidable
COLT 2023
Nonparametric Iterative Machine Teaching
ICML 2023
On Batch Teaching Without Collusion
JMLR 2023
Tournaments, Johnson Graphs and NC-Teaching
ALT 2023
Distinguishing Relational Pattern Languages With a Small Number of Short Strings
ALT 2022
Non-Cheating Teaching Revisited: A New Probabilistic Machine Teaching Model
IJCAI 2022
On Batch Teaching with Sample Complexity Bounded by VCD
NeurIPS 2022
The Teaching Dimension of Regularized Kernel Learners
ICML 2022
Teaching via Best-Case Counterexamples in the Learning-with-Equivalence-Queries Paradigm
NeurIPS 2021
The Sample Complexity of Teaching by Reinforcement on Q-Learning
AAAI 2021
The Teaching Dimension of Kernel Perceptron
AISTATS 2021
Optimal Collusion-Free Teaching
ALT 2019
Optimal Cooperative Inference
AISTATS 2018
No Learner Left Behind: On the Complexity of Teaching Multiple Learners Simultaneously
IJCAI 2017
Preference-based Teaching
JMLR 2017
Preference-based Teaching
COLT 2016
The Label Complexity of Mixed-Initiative Classifier Training
ICML 2016
The Teaching Dimension of Linear Learners
ICML 2016
The Teaching Dimension of Linear Learners
JMLR 2016
How Do Humans Teach: On Curriculum Learning and Teaching Dimension
NeurIPS 2011