💤Quietscore 60.5Jun 15, 2026·2606.17000cs.CCcs.GTcs.LGmath.OC

The Complexity of Min-Max Optimization for Quadratic Polynomials

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alexandros Hollender

Narrative

No narrative written yet. The narrate cron picks top papers by score; run /api/cron/narrate to populate this manually.

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 monomials, and the approximation factor is inverse polynomial. As a direct consequence, we obtain the first PPAD-hardness results for two-team zero-sum polymatrix games.

Citation timeline

Not enough citation snapshots yet to plot a timeline. Come back after a few cron runs.

Signal

Stars: 17
Repos: 8
Citations: 0
Velocity: 0.00/d

GitHub repos (8)

ehijano/rss_fetch⭐ 11
“ </item> <item> <title>The Complexity of Min-Max Optimization for Quadratic Polynomials</title> <link>https://arxiv.org/abs/2606.17000</link> <description>arXiv:2606.17000v1 Announce Type: cross Abstract: We prove that computing approximate stationary po”
sairaman436/vybe-intelligence-vault⭐ 5
“source_name: arXiv Machine Learning source_url: https://arxiv.org/abs/2606.17000 authors: []”
claudlos/carlos-debrief⭐ 1
“ <div class="cards-grid"><div class="card" data-full-desc="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 ”
qiao-925/news-digest⭐ 0
“ - **The Complexity of Min-Max Optimization for Quadratic Polynomials** — 🔬 arXiv-CC > arXiv:2606.17000v1 Announce Type: new Abstract: We prove that computing approximate stationary points of min-max optimiz https://arxiv.org/abs/2606.17000 - **Bayesian Variational System I”
sirichen2/sirichen2.github.io⭐ 0
“ "Andrea Celli", "Alexandros Hollender" ], "abs_url": "https://arxiv.org/abs/2606.17000v1", "pdf_url": "https://arxiv.org/pdf/2606.17000v1", "published": "2026-06-15T17:37:13+00:00", "updated": "2026-06-15T17:37:13+00:00",”
yizhenliu99/coding-blog⭐ 0
“ "published": "2026-06-15", "summary": "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”
Clifeast/clifeast.github.io⭐ 0
“ ], "date": "2026-06-15", "source": "arXiv cs.CC", "url": "https://arxiv.org/abs/2606.17000v1", "abstract": "We prove that computing approximate stationary points of min-max optimization over the hypercube is PPAD-hard for quadrati”
Miruuuu-sue/ijas-readability⭐ 0
“2606.17011v1,ROVE: Unlocking Human Interventions for Humanoid Manipulation via Reinforcement Learning,Wei Xiao; Weiliang Tang; Yuying Ge; Hui Zhou; Yao Mu; Li Zhang; Yixiao Ge,cs.RO; cs.LG,2026-06-15T17:45:06+00:00,2026-06-15T17:45:06+00:00,http://arxiv.org/abs/2606.17011v1,https”