Near-optimal Bayesian Active Learning with Correlated and Noisy Tests
Not on the map. Why?
Abstract (arXiv)
We consider the Bayesian active learning and experimental design problem, where the goal is to learn the value of some unknown target variable through a sequence of informative, noisy tests. In contrast to prior work, we focus on the challenging, yet practically relevant setting where test outcomes can be conditionally dependent given the hidden target variable. Under such assumptions, common heuristics, such as greedily performing tests that maximize the reduction in uncertainty of the target, often perform poorly. In this paper, we propose ECED, a novel, computationally efficient active learning algorithm, and prove strong theoretical guarantees that hold with correlated, noisy tests. Rather than directly optimizing the prediction error, at each step, ECED picks the test that maximizes the gain in a surrogate objective, which takes into account the dependencies between tests. Our analysis relies on an information-theoretic auxiliary function to track the progress of ECED, and utilizes adaptive submodularity to attain the near-optimal bound. We demonstrate strong empirical performance of ECED on two problem instances, including a Bayesian experimental design task intended to distinguish among economic theories of how people make risky decisions, and an active preference learning task via pairwise comparisons.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 May 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 3; 2024: 0; 2025: 0; 2026: 1.
6 papers.
- 2022Fast Rates in Pool-Based Batch Active Learningcited by 15
- 2021Scalable Batch-Mode Deep Bayesian Active Learning via Equivalence Class Annealingcited by 2
- 2023Active Cost-aware Labeling of Streaming Datacited by 2
- 2023Efficient Online Decision Tree Learning with Active Feature Acquisitioncited by 2
- 2026Cost-Aware Recovery-Pathway Identification and Bayesian Optimization for Autonomous Materials Discoverycited by 1
- 2023Optimal Decision Tree and Adaptive Submodular Ranking with Noisy Outcomescited by 0
- 2026Cost-Aware Recovery-Pathway Identification and Bayesian Optimization for Autonomous Materials Discovery26 Jul 2026
- 2023Optimal Decision Tree and Adaptive Submodular Ranking with Noisy Outcomes23 Dec 2023
- 2023Efficient Online Decision Tree Learning with Active Feature Acquisition3 May 2023
- 2023Active Cost-aware Labeling of Streaming Data13 Apr 2023
- 2022Fast Rates in Pool-Based Batch Active Learning11 Feb 2022
- 2021Scalable Batch-Mode Deep Bayesian Active Learning via Equivalence Class Annealing27 Dec 2021