Metraipolis › archive › dc_3d4d9643bfb5

Randomized Matvec Lower Bounds for Simplex-Based Matrix Games — arXiv:2610.02095

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02095
License (as archived)
CC0-1.0
Archived
2026-10-06T16:01:19.016Z
SHA-256 of the archived text
e6bf1e1ddbeaff98a1535339fe02271d7f812e48e60d875017170ab4f93e8403
Stable URL of this page
https://metraipolis.com/documento/dc_3d4d9643bfb5

How to cite

Randomized Matvec Lower Bounds for Simplex-Based Matrix Games — arXiv:2610.02095 — arXiv (en), https://arxiv.org/abs/2610.02095 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3d4d9643bfb5 (Metraipolis archive dc_3d4d9643bfb5, sha256 e6bf1e1ddbeaff98a1535339fe02271d7f812e48e60d875017170ab4f93e8403)
BibTeX
@misc{dc3d4d9643bfb5,
  title = {Randomized Matvec Lower Bounds for Simplex-Based Matrix Games — arXiv:2610.02095},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02095},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3d4d9643bfb5; sha256 e6bf1e1ddbeaff98a1535339fe02271d7f812e48e60d875017170ab4f93e8403},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.02095. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove randomized matrix-vector query lower bounds for two normalized matrix-game geometries: a Euclidean unit ball against a probability simplex, with row norms at most one, and two probability simplices, with entries of absolute value at most one. Each query returns $(Ax,A^\top y)$ for arbitrary real vectors. The algorithm must return a feasible pair with full saddle-point gap at most $\varepsilon$, with probability at least $2/3$ on every admissible matrix. For sufficiently small $\varepsilon$, the worst-case query complexities are $\Omega(\varepsilon^{-2/3}/(\log^2(1/\varepsilon)\log\log(1/\varepsilon)))$ for ball-simplex games and $\Omega(\varepsilon^{-2/3}/(\log^{7/3}(1/\varepsilon)\log\log(1/\varepsilon)))$ for simplex-simplex games. The hard instances have dimensions of order $\varepsilon^{-2/3}$ and $\varepsilon^{-2/3}/\log^{1/3}(1/\varepsilon)$, respectively, and the bounds extend to larger dimensions. These lower bounds match the deterministic upper bounds of Karmarkar, O'Carroll, and Sidford up to logarithmic factors. The proof extracts a fresh Gaussian core after adaptive two-sided queries and uses uncertainty in its smallest singular value to establish linear-system solve hardness. Two reductions transfer this hardness to matrix games by converting a small full gap into a small residual, with an additional logarithmic normalization loss only for simplex-simplex games.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.OC).
Categorie arXiv: Optimization and Control (math.OC) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.02095 — 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-10-06T15:14:57.987Z dalla pagina https://arxiv.org/catchup/math.OC/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).