Metraipolis › archive › dc_4c647bb1fb63
Homological Barriers to Stable Learning of First-Order Nash Equilibria — arXiv:2611.11693
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.11693
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-10T18:47:19.011Z
- SHA-256 of the archived text
f1487909107340093170cf2c290e369b91ae7cf5468a0044d3d19a29d1a42990- Stable URL of this page
https://metraipolis.com/documento/dc_4c647bb1fb63
How to cite
Homological Barriers to Stable Learning of First-Order Nash Equilibria — arXiv:2611.11693 — arXiv (en), https://arxiv.org/abs/2611.11693 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4c647bb1fb63 (Metraipolis archive dc_4c647bb1fb63, sha256 f1487909107340093170cf2c290e369b91ae7cf5468a0044d3d19a29d1a42990)
BibTeX
@misc{dc4c647bb1fb63,
title = {Homological Barriers to Stable Learning of First-Order Nash Equilibria — arXiv:2611.11693},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.11693},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4c647bb1fb63; sha256 f1487909107340093170cf2c290e369b91ae7cf5468a0044d3d19a29d1a42990},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.11693. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We identify a homological barrier to stable learning of local Nash equilibria, also known as first-order Nash equilibria (FONE), in constrained non-concave differentiable games. We consider continuous deterministic learning dynamics that fix every FONE point and aim to attract all initial conditions to the full FONE set. We show that this convergence guarantee is impossible when the target set has nontrivial positive-degree cohomology, such as that arising from a loop, and the state space is compact and contractible. We exhibit this barrier in a simple non-concave quadratic zero-sum game on a box whose exact FONE set consists of a diagonal six-edge loop and an isolated point. Consequently, no such dynamics can make the full FONE set a stable global attractor. We further show that degree two is the minimal polynomial degree at which this barrier can arise and extend the construction to obtain nontrivial homology in arbitrarily high degrees. Finally, we establish that the barrier persists for sufficiently small approximate-FONE targets under small perturbations, yielding an open, positive-volume family of quadratic zero-sum games with the same homological barrier. Tema degli esploratori: economia dei servizi IA (elenco arXiv cs.GT, nuovi lavori del giorno). Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2611.11693 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-10T18:39:07.429Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).