FigBO: A Generalized Acquisition Function Framework with Look-Ahead Capability for Bayesian Optimization
Top Cited Papers
Open Access
- 30 April 2026
- journal article
- research article
- Published by Springer Nature in Machine Learning
- Vol. 115 (5) , 110
Abstract
Bayesian optimization is a powerful technique for optimizing expensive-to-evaluate black-box functions, consisting of two main components: a surrogate model and an acquisition function. In recent years, myopic acquisition functions have been widely adopted for their simplicity and effectiveness. However, their lack of look-ahead capability limits their performance. To address this limitation, we propose FigBO, a generalized acquisition function that incorporates the future impact of candidate points on global information gain. FigBO is a plug-and-play method that can integrate seamlessly with most existing myopic acquisition functions. Theoretically, we analyze the regret bound and convergence rate of FigBO when combined with the myopic base acquisition function expected improvement (EI), comparing them to those of standard EI. Empirically, extensive experimental results across diverse tasks demonstrate that FigBO achieves state-of-the-art performance and significantly faster convergence compared to existing methods.Keywords
Funding Information
- Macquarie University
This publication has 15 references indexed in Scilit:
- Fair and green hyperparameter optimization via multi-objective and multiple information source Bayesian optimizationMachine Learning, 2024
- Bayesian Optimization2023
- Bayesian optimization with partially specified queriesMachine Learning, 2022
- Bayesian Gait Optimization for Bipedal Locomotion2014
- Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit SettingIEEE Transactions on Information Theory, 2012
- Sequential Model-Based Optimization for General Algorithm Configuration2011
- A Taxonomy of Global Optimization Methods Based on Response SurfacesJournal of Global Optimization, 2001
- Random ForestsMachine Learning, 2001
- Efficient Global Optimization of Expensive Black-Box FunctionsJournal of Global Optimization, 1998
- ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLESBiometrika, 1933