两篇新研究论文介绍了用于解决复杂双层优化问题的新型一阶方法。其中一篇论文提出了一种用于线性约束双层优化的障碍度量方法，利用对数障碍平滑实现可微性，并开发了障碍感知调度以提高稳定性。第二篇论文提出了用于具有 minimax 和约束下层问题的双层优化的基于惩罚的方法，在确定性和随机设置下提供了改进的预言机复杂度界限，并通过拉格朗日对偶扩展到凸约束下层最小化。 AI
影响 为可能在训练复杂AI模型中具有下游应用的优化问题引入了新的算法方法。
排序理由 两篇在arXiv上发表的学术论文，介绍了新的优化方法。
AI 生成摘要 · Google Gemini · 来自 4 个来源。 我们如何撰写摘要 →
arXiv:2605.11476v1 Announce Type: cross Abstract: We study bilevel optimization with a fixed polyhedral lower feasible set. Such problems are challenging for two reasons: active-set changes can make the upper objective nonsmooth, and existing hypergradient methods typically requi…
We study bilevel optimization with a fixed polyhedral lower feasible set. Such problems are challenging for two reasons: active-set changes can make the upper objective nonsmooth, and existing hypergradient methods typically require lower-Hessian inversions or equivalent linear s…
arXiv:2605.08006v1 Announce Type: cross Abstract: We study a class of bilevel optimization problems in which both the upper- and lower-level problems have minimax structures. This setting captures a broad range of emerging applications. Despite the extensive literature on bilevel…
We study a class of bilevel optimization problems in which both the upper- and lower-level problems have minimax structures. This setting captures a broad range of emerging applications. Despite the extensive literature on bilevel optimization and minimax optimization separately,…