Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
DGX agentarXiv:2602.06457v2 Announce Type: replace Abstract: Online bilevel optimization (OBO) has emerged as a powerful framework for many machine learning problems. Prior works have developed several algorit