arXiv (All)
open access
Linear Last-Iterate Convergence Rates for Optimistic Learning in Harmonic Games
We prove that the last iterate of Optimistic Follow-The-Regularized-Leader (OFTRL) converges at a linear rate to a Nash equilibrium in multiplayer harmonic games. Our result holds under a mild game-regularity condition and for a large family of regularizers, including entropy, Tsallis, and log-barri
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
- Kuhn's Theorem for Games of the Extensive Form with Unawareness#147064
- An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game#1013408
- Making spanning graphs#1122858
- Conditions for Global Optimality in Quantum Arimoto-Blahut Algorithms#996557
- Stability and Convergence of Optimistic Exponential Weights with Asymmetric Step Sizes in Bimatrix Games#998289
Record · ID 1344061
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