English(EN) The Complexity of Min-Max Optimization for Quadratic Polynomials

超立方体上的最小-最大优化被证明是 PPAD-难的

作者 PulseAugur 编辑部 · [2 个来源] · 2026-06-15 17:37

研究人员已经确定，在超立方体上寻找涉及二次多项式的最小-最大优化问题的近似驻点是 PPAD-难的。即使对于变量出现次数有限的多线性多项式和逆多项式近似因子，这种复杂性也成立。因此，这项工作首次提出了双人零和多项式矩阵博弈的 PPAD-难结果。 AI

排序理由该集群包含一篇详细介绍理论复杂度结果的学术论文。[lever_c_demoted from research: ic=2 ai=0.4]

AI 生成摘要 · Google Gemini · 来自 2 个来源。我们如何撰写摘要 →

报道来源 [2]

arXiv cs.LG TIER_1 English(EN) · Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alexandros Hollender · 2026-06-16 04:00

The Complexity of Min-Max Optimization for Quadratic Polynomials

arXiv:2606.17000v1 Announce Type: cross Abstract: We prove that computing approximate stationary points of min-max optimization over the hypercube is PPAD-hard for quadratic polynomials. This holds even when the polynomials are multilinear, each variable appears in at most three …
arXiv cs.LG TIER_1 English(EN) · Alexandros Hollender · 2026-06-15 17:37

The Complexity of Min-Max Optimization for Quadratic Polynomials

We prove that computing approximate stationary points of min-max optimization over the hypercube is PPAD-hard for quadratic polynomials. This holds even when the polynomials are multilinear, each variable appears in at most three monomials, and the approximation factor is inverse…