🤖 AI Summary
This work addresses the significant gap between theory and practice in single-loop methods for bilevel optimization, such as Approximate Implicit Differentiation (AID) and Iterative Differentiation (ITD), whose existing convergence bounds are notoriously loose. To bridge this gap, the authors propose a Decoupled Norm Analysis (DNA) framework that enables a refined convergence analysis of single-loop AID and ITD. Theoretically, they improve the convergence rate of AID from 𝒪(κ⁶/K) to 𝒪(κ⁵/K) and establish that ITD achieves an asymptotic error of 𝒪(κ²)—matching the known lower bound and improving upon the previous 𝒪(κ³) guarantee. Extensive numerical experiments on both synthetic and real-world tasks corroborate the tightness and practical relevance of the derived bounds.
📝 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}(κ^6/K)$ to $\mathcal{O}(κ^5/K)$, where $κ$ is the condition number of the inner-level problem. For ITD, we prove that the asymptotic error is $\mathcal{O}(κ^2)$, exactly matching the known lower bound and improving upon the previous $\mathcal{O}(κ^3)$ guarantee. Numerical experiments on synthetic and real tasks corroborate our theoretical findings.