Convergence of Bayesian Bilevel Optimization
Shi Fu, Fengxiang He, Xinmei Tian, Dacheng Tao
摘要
This paper presents the first theoretical guarantee for Bayesian bilevel optimization (BBO) that we term for the prevalent bilevel framework combining Bayesian optimization at the outer level to tune hyperparameters, and the inner-level stochastic gradient descent (SGD) for training the model. We prove sublinear regret bounds suggesting simultaneous convergence of the inner-level model parameters and outer-level hyperparameters to optimal configurations for generalization capability. A pivotal, technical novelty in the proofs is modeling the excess risk of the SGDtrained parameters as evaluation noise during Bayesian optimization. Our theory implies the inner unit horizon, defined as the number of SGD iterations, shapes the convergence behavior of BBO. This suggests practical guidance on configuring the inner unit horizon to enhance training efficiency and model performance. Hyperparameter optimization is crucial for leveraging deep learning's capabilities (Yang & Shami (2020); Elsken et al. (2019)). Techniques span Bayesian optimization (Wu et al. (2019); Victoria & Maragatham (2021)), decision theory (Bergstra & Bengio (2012)), multi-fidelity methods (Li et al. (2017)), and gradient-based approaches (Maclaurin et al. (2015)). We focus on BBO, exploring Bayesian optimization and bilevel frameworks' relevant aspects for hyperparameter tuning. Bayesian optimization. Bayesian optimization (BO) (Osborne & Osborne (2010); Kandasamy et al. (2020)) is a prevalent approach for hyperparameter tuning by efficiently exploring and exploiting hyperparameter spaces (Nguyen et al. (2017)). Gaussian processes (Bogunovic et al. (2018)) are commonly used as priors in BO to model uncertainty and estimate objective function distributions (Bro (2010); Wilson et al. (2014)). Among acquisition functions guiding queries in BO, the EI acquisition function (Jones & Welch (1998); Malkomes & Garnett (2018); Scarlett et al. (2017); Qin et al. (2017)) is one of the most widely utilized for balancing exploration-exploitation (Nguyen & Osborne (2020); Zhan & Xing (2020)). Other acquisitions like UCB (Valko et al. (2013)), knowledge
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper9
- Bilevel Optimization: Convergence Analysis and Enhanced DesignKaiyi Ji, Junjie Yang, Yingbin LiangICML 2021 · 被引用 343 次
- On the Iteration Complexity of Hypergradient ComputationRiccardo Grazzi, Luca Franceschi, Massimiliano Pontil, Saverio SalzoICML 2020 · 被引用 241 次
- Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient DescentYunwen Lei, Yiming YingICML 2020 · 被引用 165 次
- Stability and Generalization of Bilevel Programming in Hyperparameter OptimizationFan Bao, Guoqiang Wu, Chongxuan Li, Jun Zhu 等NeurIPS 2021 · 被引用 53 次
- Sharper Generalization Bounds for Learning with Gradient-dominated Objective FunctionsYunwen Lei, Yiming YingICLR 2021 · 被引用 52 次
相关 Paper
- Stochastic Regret Guarantees for Online Zeroth- and First-Order Bilevel OptimizationParvin Nazari, Bojian Hou, Davoud Ataee Tarzanagh, Li Shen 等NeurIPS 2025 · 被引用 5 次
- BO: Augmenting Acquisition Functions with User Beliefs for Bayesian OptimizationCarl Hvarfner, Danny Stoll, Artur L. F. Souza, Marius Lindauer 等ICLR 2022 · 被引用 93 次
- Bayesian Optimistic Optimisation with Exponentially Decaying RegretHung Tran-The, Sunil Gupta, Santu Rana, Svetha VenkateshICML 2021 · 被引用 4 次
- Provably Faster Algorithms for Bilevel OptimizationJunjie Yang, Kaiyi Ji, Yingbin LiangNeurIPS 2021 · 被引用 175 次
- Improved Penalty Method via Doubly Stochastic Gradients for Bilevel Hyperparameter OptimizationWanli Shi, Bin GuAAAI 2021 · 被引用 6 次
