989 citations · 4.1k across the 80 of their papers we have counts for
4 papers · 1 filter
Efficient Minimization of Decomposable Submodular Functions
Peter Stobbe, Andreas Krause
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of con…
Near-Optimal Bayesian Active Learning with Noisy Observations
Daniel Golovin, Andreas Krause, Debajyoti Ray
We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypoth…
Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization
Daniel Golovin, Andreas Krause
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously difficu…
Online Distributed Sensor Selection
Daniel Golovin, Matthew Faulkner, Andreas Krause
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to con…