Understanding the Role of Adaptivity in Machine Teaching: The Case of Version Space Learners

Abstract

In real-world applications of education, an effective teacher adaptively chooses the next example to teach based on the learner's current state. However, most existing work in algorithmic machine teaching focuses on the batch setting, where adaptivity plays no role. In this paper, we study the case of teaching consistent, version space learners in an interactive setting. At any time step, the teacher provides an example, the learner performs an update, and the teacher observes the learner's new state. We highlight that adaptivity does not speed up the teaching process when considering existing models of version space learners, such as "worst-case" (the learner picks the next hypothesis randomly from the version space) and "preference-based" (the learner picks hypothesis according to some global preference). Inspired by human teaching, we propose a new model where the learner picks hypotheses according to some local preference defined by the current hypothesis. We show that our model exhibits several desirable properties, e.g., adaptivity plays a key role, and the learner's transitions over hypotheses are smooth/interpretable. We develop efficient teaching algorithms and demonstrate our results via simulation and user studies.

arXiv commentNeurIPS 2018 (extended version)

Cited by in corpus (18)

• Long-Term Personalization of an In-Home Socially Assistive Robot for Children With Autism Spectrum Disorders
• Policy Teaching via Environment Poisoning: Training-time Adversarial Attacks against Reinforcement Learning
• Learner-aware Teaching: Inverse Reinforcement Learning with Preferences and Constraints
• Policy Teaching in Reinforcement Learning via Environment Poisoning Attacks
• Teaching Multiple Concepts to a Forgetful Learner
• Robust Federated Training via Collaborative Machine Teaching using Trusted Instances
• Reward Poisoning in Reinforcement Learning: Attacks Against Unknown Learners in Unknown Environments
• Curriculum Design for Teaching via Demonstrations: Theory and Applications
• The Teaching Dimension of Kernel Perceptron
• Fair Clustering Using Antidote Data
• The Sample Complexity of Teaching-by-Reinforcement on Q-Learning
• Iterative Teaching by Label Synthesis
• Teaching an Active Learner with Contrastive Examples
• Average-case Complexity of Teaching Convex Polytopes via Halfspace Queries
• Teaching to Learn: Sequential Teaching of Agents with Inner States
• Adaptive Teaching of Temporal Logic Formulas to Learners with Preferences
• Iterative Classroom Teaching
• Preference-Based Batch and Sequential Teaching