Paper recorded by Signals 4 on 2026-09-18 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-18 on arXiv · recorded by Signals 4 on 2026-09-21
Category: cs.LG · 机器学习 · first seen 2026-09-21
We introduce Multiplicatively Optimistic Regret Matching (MORM), an uncoupled learning rule for finite general-sum games. Under simultaneous full-information self-play, every player achieves external regret $O(\sqrt n\log d)$ uniformly over all horizons, using only one-step optimism. The analysis combines a potential-based regret-matching argument with multiplicative stability and Hellinger contro