An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness

TL;DR

This paper introduces AccBO, an accelerated stochastic bilevel optimization algorithm that improves convergence rates under unbounded smoothness conditions, with theoretical guarantees and practical effectiveness demonstrated through experiments.

Contribution

The paper proposes a novel accelerated bilevel optimization algorithm, AccBO, achieving faster convergence rates under unbounded smoothness assumptions with rigorous theoretical analysis.

Findings

Achieves $ ilde{O}(1/ε^3)$ oracle complexity for $ ext{ε}$-stationary points.

Proves high-probability bounds for stochastic Nesterov gradient dynamics under distribution drift.

Experimental results show significant performance improvements over baseline methods.

Abstract

This paper investigates a class of stochastic bilevel optimization problems where the upper-level function is nonconvex with potentially unbounded smoothness and the lower-level problem is strongly convex. These problems have significant applications in sequential data learning, such as text classification using recurrent neural networks. The unbounded smoothness is characterized by the smoothness constant of the upper-level function scaling linearly with the gradient norm, lacking a uniform upper bound. Existing state-of-the-art algorithms require $\widetilde{O}(1/\epsilon^4)$ oracle calls of stochastic gradient or Hessian/Jacobian-vector product to find an $\epsilon$-stationary point. However, it remains unclear if we can further improve the convergence rate when the assumptions for the function in the population level also hold for each random realization almost surely. To address this issue, we propose a new Accelerated Bilevel Optimization algorithm named AccBO. The algorithm updates the upper-level variable by normalized stochastic gradient descent with recursive momentum and the lower-level variable by the stochastic Nesterov accelerated gradient descent algorithm with averaging. We prove that our algorithm achieves an oracle complexity of $\widetilde{O}(1/\epsilon^3)$ to find an $\epsilon$-stationary point, when the lower-level stochastic gradient's variance is $O(\epsilon)$. Our proof relies on a novel lemma characterizing the dynamics of stochastic Nesterov accelerated gradient descent algorithm under distribution drift with high probability for the lower-level variable, which is of independent interest and also plays a crucial role in analyzing the hypergradient estimation error over time. Experimental results on various tasks confirm that our proposed algorithm achieves the predicted theoretical acceleration and significantly outperforms baselines in bilevel optimization.