Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
非凸-强凸双层优化的一阶Oracle下界复杂度
机构 * Kaiyi Ji(机凯毅)
AI总结 针对光滑非凸-强凸双层优化,在确定性和随机一阶Oracle模型下,分别证明了$\Omega(\kappa^{3/2}\epsilon^{-2})$和$\Omega(\kappa^{5/2}\epsilon^{-4})$的下界,改进了单层非凸优化和极小极大问题的已知最优下界。
Comments Accepted by ICML 2026