arXiv (All)
open access
Average-and Last-Iterate Lower Bounds for Optimistic Matrix Mirror-Prox in Quantum Zero-Sum Games
Optimistic matrix mirror-prox (OMMP) computes $ε$-approximate Nash equilibria in quantum zero-sum games with an $O(1/\varepsilon)$ average-iterate guarantee [arXiv:2311.10859]. We investigate whether this dependence on accuracy is tight and whether geometric last-iterate convergence can be guarantee
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The $A$-optimal design problem and the $S$-matrix conjecture#1034074
- Matrix-Vector Complexity of Low-Rank Approximation#1130682
- Stability and Convergence of Optimistic Exponential Weights with Asymmetric Step Sizes in Bimatrix Games#998289
- Faster Convergence of Multidimensional Approximate Agreement via Smallest Enclosing Balls#821526
- Polylogarithmic Nash Regret in Matrix Games with Bandit Feedback#1129428
Record · ID 1143436
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive