Beyond Pessimism: Offline Learning in KL-regularized Games
A pessimism-free offline algorithm for KL-regularized games achieves O(1/n) sample complexity via equilibrium stability and smooth best responses.
Atlanta Poster Session 4, Thu, Dec 10, 4:30 PM–7:30 PM, Hall C1 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
