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 uncertaintyaboutasetofhypotheses. Instead ofminimizinguncertaintyperse,weconsidera set of overlappingdecision regions of these hypotheses. Our goal is to drive uncertainty into a single decision region as quickly as possible. We identify necessary and sucient conditionsforcorrectlyidentifyingadecisionregion that contains all hypotheses consistent with observations. We develop a novel Hyperedge Cutting (HEC) algorithm for this problem, and prove that is competitive with the intractable optimal policy. Our ecient implementation of the algorithm relies on computingsubsetsofthecompletehomogeneoussymmetric polynomials. Finally, we demonstrate its eectiveness on two practical applications: approximate comparison-based learning and activelocalizationusingarobotmanipulator.
Near Optimal Bayesian Active Learning for Decision Making
Shervin Javdani,Yuxin Chen,Amin Karbasi,Andreas Krause,J. Bagnell,S. Srinivasa
Published 2014 in International Conference on Artificial Intelligence and Statistics
ABSTRACT
PUBLICATION RECORD
- Publication year
2014
- Venue
International Conference on Artificial Intelligence and Statistics
- Publication date
2014-02-24
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-21 of 21 references · Page 1 of 1
CITED BY
Showing 1-57 of 57 citing papers · Page 1 of 1