102 citations · 207 across the 33 of their papers we have counts for
8 papers · 1 filter
Efficient learning of smooth probability functions from Bernoulli tests with guarantees
Paul Rolland, Ali Kavis, Alex Immer +2
We study the fundamental problem of learning an unknown, smooth probability function via pointwise Bernoulli tests. We provide a scalable algorithm for efficiently solving this pro…
Iterative Classroom Teaching
Teresa Yeo, Parameswaran Kamalaruban, Adish Singla +5
We consider the machine teaching problem in a classroom-like setting wherein the teacher has to deliver the same examples to a diverse group of students. Their diversity stems from…
Teaching Inverse Reinforcement Learners via Features and Demonstrations
Luis Haug, Sebastian Tschiatschek, Adish Singla
Learning near-optimal behaviour from an expert's demonstrations typically relies on the assumption that the learner knows the features that the true reward function depends on. In…
A Unified Approach to Quantifying Algorithmic Unfairness: Measuring Individual & Group Unfairness via Inequality Indices
Till Speicher, Hoda Heidari, Nina Grgic-Hlaca +4
Discrimination via algorithmic decision making has received considerable attention. Prior work largely focuses on defining conditions for fairness, but does not define satisfactory…
Enhancing the Accuracy and Fairness of Human Decision Making
Isabel Valera, Adish Singla, Manuel Gomez Rodriguez
Societies often rely on human experts to take a wide variety of decisions affecting their members, from jail-or-release decisions taken by judges and stop-and-frisk decisions taken…
Teaching Multiple Concepts to a Forgetful Learner
Anette Hunziker, Yuxin Chen, Oisin Mac Aodha +5
How can we help a forgetful learner learn multiple concepts within a limited time frame? While there have been extensive studies in designing optimal schedules for teaching a singl…