Non-Stationary Functional Bilevel Optimization

Jason Bohne, Ieva Petrulionyte, Michael Arbel, Julien Mairal, Paweł Polak
1/21/2026
stat.MLcs.LG

No confident code implementation found for this paper.

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 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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{bohne2026nonstationary,
  title  = {Non-Stationary Functional Bilevel Optimization},
  author = {Jason Bohne and Ieva Petrulionyte and Michael Arbel and Julien Mairal and Paweł Polak},
  year   = {2026},
  eprint = {2601.15363},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.15363v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.15363.svg)](https://codeofpaper.com/paper/2601.15363)

Discussion