arXiv (All)
open access
Why Last-Iterate Scale-Invariant Regret Matching Converges Linearly?
IREG-PRM+ normalizes the cumulative regret vector by its own norm and attains optimal regret without knowledge of the payoff scale. Run unmodified on zero-sum matrix games, it converges linearly in the last iterate, and no analysis explains why. The obstacle is that the algorithm has no fixed step s
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
- Reputation in the Shadow of Exit#1013171
- Convergence and Regret of the Policy Gradient for Multi-Armed Bandits in Diffusion Environment#422240
- Block Optimism for Nonstationary Bandits with Latent Linear Dynamics#1155846
- MESHA: Mechanism-Enforced Sequential Halving for Strategic Linear Bandits#373413
- From Optimal Actions to World Models: Identifiability of Transition Kernels in Discounted MDPs#440372
Record · ID 1142457
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