Sharper Analysis of Single-Loop Methods for Bilevel Optimization

Abstract

Bilevel optimization underpins many machine learning applications, including hyperparameter optimization, meta-learning, neural architecture search, and reinforcement learning. While hypergradient-based methods have advanced significantly, a gap persists between theoretical guarantees and practical single-loop implementations required for efficiency. We bridge this gap by establishing sharper convergence results for single-loop approximate implicit differentiation (AID) and iterative differentiation (ITD) methods, leveraging our proposed analytical framework, decoupled norm analysis (DNA). For AID, we improve the convergence rate from $\mathcal{O}(\hat{I}{º}^6/K)$ to $\mathcal{O}(\hat{I}{º}^5/K)$, where $\hat{I}º$ is the condition number of the inner-level problem. For ITD, we prove that the asymptotic error is $\mathcal{O}(\hat{I}{º}^2)$, exactly matching the known lower bound and improving upon the previous $\mathcal{O}(\hat{I}{º}^3)$ guarantee. Numerical experiments on synthetic and real tasks corroborate our theoretical findings.

26 pages,6 figures