Non-Stationary Functional Bilevel Optimization

Jason Bohne, Ieva Petrulionytė, Michael Arbel, Julien Mairal, Pawel Polak
Proceedings of The 29th International Conference on Artificial Intelligence and Statistics, PMLR 300:5275-5283, 2026.

Abstract

Functional bilevel optimization (FBO) provides a powerful framework for hierarchical learning in function spaces, yet current methods are limited to static offline settings and perform suboptimally in online, non-stationary scenarios. We propose \textbf{SmoothFBO}, the first algorithm for non-stationary FBO with both theoretical guarantees and practical scalability. SmoothFBO introduces a time-smoothed stochastic hypergradient estimator that reduces variance through a window parameter, enabling stable outer-loop updates with sublinear regret. Importantly, the classical parametric bilevel case is a special reduction of our framework, making SmoothFBO a natural extension to online, non-stationary settings. Empirically, SmoothFBO consistently outperforms existing FBO methods in non-stationary hyperparameter optimization and model-based reinforcement learning, demonstrating its practical effectiveness. Together, these results establish SmoothFBO as a general, theoretically grounded, and practically viable foundation for bilevel optimization in online, non-stationary scenarios.

Cite this Paper


BibTeX
@InProceedings{pmlr-v300-bohne26a, title = { Non-Stationary Functional Bilevel Optimization }, author = {Bohne, Jason and Petrulionyt\.{e}, Ieva and Arbel, Michael and Mairal, Julien and Polak, Pawel}, booktitle = {Proceedings of The 29th International Conference on Artificial Intelligence and Statistics}, pages = {5275--5283}, year = {2026}, editor = {Khan, Emtiyaz and Li, Yingzhen and Solin, Arno and Ramdas, Aaditya}, volume = {300}, series = {Proceedings of Machine Learning Research}, month = {02--05 May}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v300/main/assets/bohne26a/bohne26a.pdf}, url = {https://proceedings.mlr.press/v300/bohne26a.html}, abstract = { Functional bilevel optimization (FBO) provides a powerful framework for hierarchical learning in function spaces, yet current methods are limited to static offline settings and perform suboptimally in online, non-stationary scenarios. We propose \textbf{SmoothFBO}, the first algorithm for non-stationary FBO with both theoretical guarantees and practical scalability. SmoothFBO introduces a time-smoothed stochastic hypergradient estimator that reduces variance through a window parameter, enabling stable outer-loop updates with sublinear regret. Importantly, the classical parametric bilevel case is a special reduction of our framework, making SmoothFBO a natural extension to online, non-stationary settings. Empirically, SmoothFBO consistently outperforms existing FBO methods in non-stationary hyperparameter optimization and model-based reinforcement learning, demonstrating its practical effectiveness. Together, these results establish SmoothFBO as a general, theoretically grounded, and practically viable foundation for bilevel optimization in online, non-stationary scenarios. } }
Endnote
%0 Conference Paper %T Non-Stationary Functional Bilevel Optimization %A Jason Bohne %A Ieva Petrulionytė %A Michael Arbel %A Julien Mairal %A Pawel Polak %B Proceedings of The 29th International Conference on Artificial Intelligence and Statistics %C Proceedings of Machine Learning Research %D 2026 %E Emtiyaz Khan %E Yingzhen Li %E Arno Solin %E Aaditya Ramdas %F pmlr-v300-bohne26a %I PMLR %P 5275--5283 %U https://proceedings.mlr.press/v300/bohne26a.html %V 300 %X Functional bilevel optimization (FBO) provides a powerful framework for hierarchical learning in function spaces, yet current methods are limited to static offline settings and perform suboptimally in online, non-stationary scenarios. We propose \textbf{SmoothFBO}, the first algorithm for non-stationary FBO with both theoretical guarantees and practical scalability. SmoothFBO introduces a time-smoothed stochastic hypergradient estimator that reduces variance through a window parameter, enabling stable outer-loop updates with sublinear regret. Importantly, the classical parametric bilevel case is a special reduction of our framework, making SmoothFBO a natural extension to online, non-stationary settings. Empirically, SmoothFBO consistently outperforms existing FBO methods in non-stationary hyperparameter optimization and model-based reinforcement learning, demonstrating its practical effectiveness. Together, these results establish SmoothFBO as a general, theoretically grounded, and practically viable foundation for bilevel optimization in online, non-stationary scenarios.
APA
Bohne, J., Petrulionytė, I., Arbel, M., Mairal, J. & Polak, P.. (2026). Non-Stationary Functional Bilevel Optimization . Proceedings of The 29th International Conference on Artificial Intelligence and Statistics, in Proceedings of Machine Learning Research 300:5275-5283 Available from https://proceedings.mlr.press/v300/bohne26a.html.

Related Material