SOURCE-LINKED INTELLIGENCE

Stochastic Nonconvex Bilevel Optimization: Improved Rates Without Rare-Visit Assumption

arXiv · AI, language, vision and robotics · article · Sep 6, 2026 · UTC

We investigate stochastic simple bilevel optimization with smooth and possibly nonconvex upper- and lower-level objectives. Existing stochastic extensions of dynamic barrier gradient descent (DBGD) either obtain fast convergence under an unverifiable trajectory-dependent ``rare-visit'' assumption, or remove this assumption at a substantially higher oracle cost. We show that a simple denominator-only regularization of the DBGD multiplier eliminates the need for such an assumption while preserving fast convergence rates. Specifically, our method achieves $(\varepsilon, \varepsilon)$-stationarity

Read original source ↗ Open in workspace

recordType

paper

region

Global