平滑度
李普希茨连续性
双层优化
超参数
数学优化
趋同(经济学)
计算机科学
甲骨文公司
估计员
班级(哲学)
信任域
点(几何)
最优化问题
梯度下降
数学
对抗制
算法
收敛速度
静止点
核(代数)
人工智能
凸优化
应用数学
领域(数学分析)
缩小
继续
作者
Shuyan Ge,Rujun Jiang,Luo Luo
出处
期刊:
[Global Science Press]
日期:2026-07-19
卷期号:5 (3): 391-428
摘要
Bilevel optimization is pivotal in machine learning applications such as hyperparameter tuning and adversarial training. While existing methods for nonconvex-strongly-convex bilevel optimization can find an $\epsilon$-stationary point under Lipschitz continuity assumptions, two critical gaps persist: improving algorithmic complexity and generalizing smoothness conditions. This paper addresses these challenges by introducing an accelerated framework under Hölder continuity$-$a broader class of smoothness that subsumes Lipschitz continuity. We propose a restarted accelerated gradient method that leverages inexact hypergradient estimators and establishes theoretical oracle complexity for finding $\epsilon$-stationary points. Empirically, experiments on data hypercleaning and hyperparameter optimization demonstrate superior convergence rates compared to state-of-the-art baselines.
科研通智能强力驱动
Strongly Powered by AbleSci AI