{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:59:52Z","timestamp":1787500792174,"version":"build-2736575974"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:00:00Z","timestamp":1777507200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:00:00Z","timestamp":1777507200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001230","name":"Macquarie University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001230","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>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.<\/jats:p>","DOI":"10.1007\/s10994-026-07039-5","type":"journal-article","created":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T05:47:31Z","timestamp":1777528051000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["FigBO: A Generalized Acquisition Function Framework with Look-Ahead Capability for Bayesian Optimization"],"prefix":"10.1007","volume":"115","author":[{"given":"Hui","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuhui","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhangkai","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Longbing","family":"Cao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,30]]},"reference":[{"key":"7039_CR1","doi-asserted-by":"publisher","first-page":"20577","DOI":"10.52202\/075280-0904","volume":"36","author":"S Ament","year":"2023","unstructured":"Ament, S., Daulton, S., Eriksson, D., Balandat, M., & Bakshy, E. (2023). Unexpected improvements to expected improvement for Bayesian optimization. Advances in Neural Information Processing Systems, 36, 20577\u201320612.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"7039_CR2","unstructured":"Bergstra, J., Bardenet, R., Bengio, Y., & K\u00e9gl, B. (2011). Algorithms for hyper-parameter optimization. Advances in Neural Information Processing Systems,24"},{"key":"7039_CR3","unstructured":"Berkenkamp, F., Krause, A.,& Schoellig, A.P. (2016) Bayesian optimization with safety constraints: Safe and automatic parameter tuning in robotics.\u201d arxiv. arXiv preprint arXiv:1602.04450"},{"key":"7039_CR4","first-page":"1613","volume":"37","author":"C Blundell","year":"2015","unstructured":"Blundell, C., Cornebise, J., Kavukcuoglu, K., & Wierstra, D. (2015). Weight uncertainty in neural network. Proceedings of the 32nd International Conference on Machine Learning, PMLR, 37, 1613\u20131622.","journal-title":"Proceedings of the 32nd International Conference on Machine Learning, PMLR"},{"key":"7039_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L. (2001). Random forests. Machine Learning, 45, 5\u201332.","journal-title":"Machine Learning"},{"key":"7039_CR6","unstructured":"Brochu, E., Cora, V.M.,& De\u00a0Freitas, N. (2010) A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning. arXiv preprint arXiv:1012.2599"},{"issue":"10","key":"7039_CR7","first-page":"2879","volume":"12","author":"AD Bull","year":"2011","unstructured":"Bull, A. D. (2011). Convergence rates of efficient global optimization algorithms. Journal of Machine Learning Research, 12(10), 2879\u20132904.","journal-title":"Journal of Machine Learning Research"},{"key":"7039_CR8","doi-asserted-by":"crossref","unstructured":"Calandra, R., Gopalan, N., Seyfarth, A., Peters, J.,& Deisenroth, M.P. (20214) Bayesian gait optimization for bipedal locomotion. In: Learning and Intelligent Optimization: 8th International Conference, Lion 8, Gainesville, FL, USA, February 16-21, 2014. Revised Selected Papers 8, pp. 274\u2013290. Springer","DOI":"10.1007\/978-3-319-09584-4_25"},{"issue":"5","key":"7039_CR9","doi-asserted-by":"publisher","first-page":"2701","DOI":"10.1007\/s10994-024-06515-0","volume":"113","author":"A Candelieri","year":"2024","unstructured":"Candelieri, A., Ponti, A., & Archetti, F. (2024). Fair and green hyperparameter optimization via multi-objective and multiple information source Bayesian optimization. Machine Learning, 113(5), 2701\u20132731.","journal-title":"Machine Learning"},{"key":"7039_CR10","unstructured":"Eggensperger, K., M\u00fcller, P., Mallik, N., Feurer, M., Sass, R., Klein, A., Awad, N., Lindauer, M.,& Hutter, F. (2021) HPOBench: A collection of reproducible multi-fidelity benchmark problems for HPO. arXiv preprint arXiv:2109.06716"},{"key":"7039_CR11","first-page":"493","volume":"161","author":"D Eriksson","year":"2021","unstructured":"Eriksson, D., & Jankowiak, M. (2021). High-dimensional Bayesian optimization with sparse axis-aligned subspaces. Uncertainty in Artificial Intelligence, 161, 493\u2013503.","journal-title":"Uncertainty in Artificial Intelligence"},{"issue":"5","key":"7039_CR12","doi-asserted-by":"publisher","first-page":"2410","DOI":"10.1137\/070693424","volume":"47","author":"PI Frazier","year":"2008","unstructured":"Frazier, P. I., Powell, W. B., & Dayanik, S. (2008). A knowledge-gradient policy for sequential information collection. SIAM Journal on Control and Optimization, 47(5), 2410\u20132439.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"7039_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/9781108348973","volume-title":"Bayesian Optimization","author":"R Garnett","year":"2023","unstructured":"Garnett, R. (2023). Bayesian Optimization. Cambridge University Press."},{"key":"7039_CR14","doi-asserted-by":"crossref","unstructured":"Hayashi, S., Honda, J., & Kashima, H. (2022). Bayesian optimization with partially specified queries. Machine Learning, 1\u201330","DOI":"10.1007\/s10994-021-06079-3"},{"issue":"6","key":"7039_CR15","first-page":"1809","volume":"13","author":"P Hennig","year":"2012","unstructured":"Hennig, P., & Schuler, C. J. (2012). Entropy search for information-efficient global optimization. Journal of Machine Learning Research, 13(6), 1809\u20131837.","journal-title":"Journal of Machine Learning Research"},{"key":"7039_CR16","unstructured":"Hern\u00e1ndez-Lobato, J. M., & Hoffman, M.W.,& Ghahramani, Z. (2014). Predictive entropy search for efficient global optimization of black-box functions. Advances in Neural Information Processing Systems.,27"},{"key":"7039_CR17","unstructured":"Hoffman, M., & Brochu, E.,& De Freitas, N. (2011). Portfolio allocation for Bayesian optimization. UAI,11, 327\u2013336."},{"key":"7039_CR18","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H.H.,& Leyton-Brown, K. (2011) Sequential model-based optimization for general algorithm configuration. In: Learning and Intelligent Optimization: 5th International Conference, LION 5, Rome, Italy, January 17-21, 2011. Selected Papers 5, pp. 507\u2013523. Springer","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"7039_CR19","unstructured":"Hvarfner, C., Hellsten, E.O.,& Nardi, L. (2024) Vanilla Bayesian optimization performs great in high dimension. arXiv preprint arXiv:2402.02229"},{"key":"7039_CR20","unstructured":"Hvarfner, C., Hutter, F.,& Nardi, L. (2023) A general framework for user-guided Bayesian optimization. arXiv preprint arXiv:2311.14645"},{"key":"7039_CR21","unstructured":"Hvarfner, C., Stoll, D., Souza, A., Lindauer, M., Hutter, F., & Nardi, L. (2022). $$\\pi $$BO: Augmenting acquisition functions with user beliefs for Bayesian optimization. arXiv preprint arXiv:2204.11051 (2022)"},{"key":"7039_CR22","doi-asserted-by":"publisher","first-page":"11494","DOI":"10.52202\/068431-0835","volume":"35","author":"C Hvarfner","year":"2022","unstructured":"Hvarfner, C., Hutter, F., & Nardi, L. (2022). Joint entropy search for maximally-informed Bayesian optimization. Advances in Neural Information Processing Systems, 35, 11494\u201311506.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"7039_CR23","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1012771025575","volume":"21","author":"DR Jones","year":"2001","unstructured":"Jones, D. R. (2001). A taxonomy of global optimization methods based on response surfaces. Journal of Global Optimization, 21, 345\u2013383.","journal-title":"Journal of Global Optimization"},{"key":"7039_CR24","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones, D. R., Schonlau, M., & Welch, W. J. (1998). Efficient global optimization of expensive black-box functions. Journal of Global Optimization, 13, 455\u2013492.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"7039_CR25","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1287\/opre.43.4.684","volume":"43","author":"C-W Ko","year":"1995","unstructured":"Ko, C.-W., Lee, J., & Queyranne, M. (1995). An exact algorithm for maximum entropy sampling. Operations Research, 43(4), 684\u2013691.","journal-title":"Operations Research"},{"key":"7039_CR26","unstructured":"Rahimi, A.,& Recht, B. (2007). Random features for large-scale kernel machines. Advances in Neural Information Processing systems.,20"},{"key":"7039_CR27","unstructured":"Renganathan, S.A., Larson, J.,& Wild, S.M. (2021) Lookahead acquisition functions for finite-horizon time-dependent Bayesian optimization and application to quantum optimal control. arXiv preprint arXiv:2105.09824"},{"key":"7039_CR28","unstructured":"Ru, B., Wan, X., Dong, X., & Osborne, M. (2020) Interpretable neural architecture search via Bayesian optimisation with weisfeiler-Lehman kernels. arXiv preprint arXiv:2006.07556"},{"key":"7039_CR29","unstructured":"\u0160ehi\u0107, K., Gramfort, A., Salmon, J., & Nardi, L. (2022) Lassobench: A high-dimensional hyperparameter optimization benchmark suite for lasso. In: International Conference on Automated Machine Learning, pp. 2\u20131 . PMLR"},{"issue":"1","key":"7039_CR30","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1214\/aoms\/1177729893","volume":"21","author":"J Sherman","year":"1950","unstructured":"Sherman, J., & Morrison, W. J. (1950). Adjustment of an inverse matrix corresponding to a change in one element of a given matrix. The Annals of Mathematical Statistics, 21(1), 124\u2013127.","journal-title":"The Annals of Mathematical Statistics"},{"key":"7039_CR31","unstructured":"Snoek, J., & Larochelle, H.,& Adams, R.P. (2012). Practical Bayesian optimization of machine learning algorithms. Advances in Neural Information Processing Systems.,25"},{"issue":"5","key":"7039_CR32","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2011.2182033","volume":"58","author":"N Srinivas","year":"2012","unstructured":"Srinivas, N., Krause, A., Kakade, S. M., & Seeger, M. W. (2012). Information-theoretic regret bounds for Gaussian process optimization in the bandit setting. IEEE Transactions on Information Theory, 58(5), 3250\u20133265.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3\u20134","key":"7039_CR33","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson, W. R. (1933). On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, 25(3\u20134), 285\u2013294.","journal-title":"Biometrika"},{"key":"7039_CR34","unstructured":"Wang, Z.,& Jegelka, S. (2017). Max-value entropy search for efficient Bayesian optimization. Proceedings of the 34th International Conference on Machine Learning, PMLR,70, 3627\u20133635."},{"issue":"9","key":"7039_CR35","first-page":"5503","volume":"44","author":"L Wang","year":"2021","unstructured":"Wang, L., Xie, S., Li, T., Fonseca, R., & Tian, Y. (2021). Sample-efficient neural architecture search by learning actions for monte carlo tree search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(9), 5503\u20135515.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"7039_CR36","volume-title":"Gaussian Processes for Machine Learning","author":"CKI Williams","year":"2006","unstructured":"Williams, C. K. I., & Rasmussen, C. E. (2006). Gaussian Processes for Machine Learning. MIT Press."},{"key":"7039_CR37","unstructured":"Wu, J.,& Frazier, P. (2019). Practical two-step lookahead Bayesian optimization. Advances in Neural Information Processing Systems.,32"},{"key":"7039_CR38","unstructured":"Ziomek, J.K.,& Ammar, H.B. (2023). Are random decompositions all we need in high dimensional Bayesian optimisation. Proceedings of the 40th International Conference on Machine Learning, PMLR,202, 43347\u201343368."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07039-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-026-07039-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07039-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T06:33:05Z","timestamp":1782282785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-026-07039-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,30]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["7039"],"URL":"https:\/\/doi.org\/10.1007\/s10994-026-07039-5","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,30]]},"assertion":[{"value":"31 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"110"}}