Dynamic Exploration-Exploitation Trade-Off in Active Learning Regression with Bayesian Hierarchical Modeling
Not on the map. Why?
Abstract (arXiv)
Active learning provides a framework to adaptively query the most informative experiments towards learning an unknown black-box function. Various approaches of active learning have been proposed in the literature, however, they either focus on exploration or exploitation in the design space. Methods that do consider exploration-exploitation simultaneously employ fixed or ad-hoc measures to control the trade-off that may not be optimal. In this paper, we develop a Bayesian hierarchical approach, referred as BHEEM, to dynamically balance the exploration-exploitation trade-off as more data points are queried. To sample from the posterior distribution of the trade-off parameter, We subsequently formulate an approximate Bayesian computation approach based on the linear dependence of queried data in the feature space. Simulated and real-world examples show the proposed approach achieves at least 21% and 11% average improvement when compared to pure exploration and exploitation strategies respectively. More importantly, we note that by optimally balancing the trade-off between exploration and exploitation, BHEEM performs better or at least as well as either pure exploration or pure exploitation.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 6 of its 80 references that are in the map. First posted on arXiv 16 Apr 2023.
Builds on
6 of 80 references.
References · 6
- 2017Dealing with Integer-valued Variables in Bayesian Optimization with Gaussian Processescited by 65
- 2014Algorithms for multi-armed bandit problemscited by 63
- 2018Active Learning for Regression Using Greedy Samplingcited by 26
- 2019A hierarchical expected improvement method for Bayesian optimizationcited by 13
- 2017A Variance Maximization Criterion for Active Learningcited by 9
- 2016Auxiliary Likelihood-Based Approximate Bayesian Computation in State Space Modelscited by 5
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.