A new first-order method for online bilevel optimization achieves regret O(1 + V_T + H_{2,T}) over O(T log T) iterations without Hessian-vector products.
On momentum-based gradient methods for bilevel optimization with nonconvex lower-level
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fully First-Order Algorithms for Online Bilevel Optimization
A new first-order method for online bilevel optimization achieves regret O(1 + V_T + H_{2,T}) over O(T log T) iterations without Hessian-vector products.