A Finite-Horizon Approach to Active Level Set Estimation
Not on the map. Why?
Abstract (arXiv)
We consider the problem of active learning in the context of spatial sampling for level set estimation (LSE), where the goal is to localize all regions where a function of interest lies above/below a given threshold as quickly as possible. We present a finite-horizon search procedure to perform LSE in one dimension while optimally balancing both the final estimation error and the distance traveled for a fixed number of samples. A tuning parameter is used to trade off between the estimation accuracy and distance traveled. We show that the resulting optimization problem can be solved in closed form and that the resulting policy generalizes existing approaches to this problem. We then show how this approach can be used to perform level set estimation in higher dimensions under the popular Gaussian process model. Empirical results on synthetic data indicate that as the cost of travel increases, our method's ability to treat distance nonmyopically allows it to significantly improve on the state of the art. On real air quality data, our approach achieves roughly one fifth the estimation error at less than half the cost of competing algorithms.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 53 references that are in the map. First posted on arXiv 18 Oct 2023.
Builds on
5 of 53 references.
References · 5
- 2016Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimationcited by 40
- 2016Adaptive Design of Experiments for Conservative Estimation of Excursion Setscited by 10
- 2019Thresholding Graph Bandits with GrAPLcited by 5
- 2017Data-Driven Learning and Planning for Environmental Samplingcited by 3
- 2015Distance-Penalized Active Learning Using Quantile Searchcited by 1
Built on by
Not cited yet.