989 citations · 4.1k across the 80 of their papers we have counts for
4 papers · 2 filters
Lazier Than Lazy Greedy
Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi +2
Is it possible to maximize a monotone submodular function faster than the widely used lazy greedy algorithm (also known as accelerated greedy), both in theory and practice? In this…
Online Submodular Maximization under a Matroid Constraint with Application to Learning Assignments
Daniel Golovin, Andreas Krause, Matthew Streeter
Which ads should we display in sponsored search in order to maximize our revenue? How should we dynamically rank information sources to maximize the value of the ranking? These app…
Near-Optimally Teaching the Crowd to Classify
Adish Singla, Ilija Bogunovic, Gábor Bartók +2
How should we present training examples to learners to teach them classification rules? This is a natural problem when training workers for crowdsourcing labeling tasks, and is als…
Near Optimal Bayesian Active Learning for Decision Making
Shervin Javdani, Yuxin Chen, Amin Karbasi +3
How should we gather information to make effective decisions? We address Bayesian active learning and experimental design problems, where we sequentially select tests to reduce unc…