← Back to all news
arXiv Machine Learning October 2, 2026 By Yiheng Su, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Pucheng Xiong

Average-and Last-Iterate Lower Bounds for Optimistic Matrix Mirror-Prox in Quantum Zero-Sum Games

Read the original on arXiv Machine Learning →

The Flow has not summarised this story yet — read it at arXiv Machine Learning.

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

arXiv Machine Learning
Jun 3

Coherent Swap Regret and Channel-Proof Learning

arXiv:2606. 02655v1 Announce Type: cross Abstract: External regret certifies stability only against replacing one's behavior by a fixed alternative.

By Sohail Sarkar
reinforcement-learningbenchmarks
More like this →
arXiv Machine Learning
1d ago

Fully Online Decentralized Learning in Stochastic Games with Unknown Independent Chains

arXiv:2610. 01181v1 Announce Type: new Abstract: We consider stochastic games with independent controlled chains and unknown transition kernels, where players observe only their local states and realized payoffs.

By S. Rasoul Etesami
More like this →
arXiv Machine Learning
Aug 6

Sublogarithmic Swap Regret in Multiplayer General-Sum Games via Hybrid Regularization

arXiv:2608. 04149v1 Announce Type: cross Abstract: Swap regret governs the rate at which uncoupled learning dynamics converge to correlated equilibria in multiplayer general-sum games.

By Taira Tsuchiya
More like this →
arXiv Statistics ML
3d ago

Lower Bounds for Linear-Oracle Online Learning

arXiv:2609.38375v1 Announce Type: new Abstract: Can a constant number of linear minimizations per round improve on the $T^{3/4}$ regret rate of online Frank-Wolfe on general convex sets? Weibel et al...

By Mohit Sinha
More like this →
arXiv Machine Learning
Sep 22

A Horizon-Independent Regret Bound for Optimistic Hedge in General-Sum Games

arXiv:2609.22839v1 Announce Type: cross Abstract: Can simple learning rules keep their regret bounded in self-play? Recent work achieves constant regret bounds through modified regularization and hig...

By Junsoo Ha
reinforcement-learning
More like this →
arXiv Machine Learning
Aug 17

Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms

arXiv:2608. 14319v1 Announce Type: new Abstract: We study quantum multi-armed bandits (QMAB) and quantum linear bandits (QLB) in the model of Wan et al.

By Maoli Liu, Zhuohua Li, John C. S. Lui
ragreinforcement-learningsafety
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea