Universal Learning of Repeated Matrix Games
Jan Poland, Marcus Hutter
Abstract
We study and compare the learning dynamics of two universal learning algorithms, one based on Bayesian learning and the other on prediction with expert advice. Both approaches have strong asymptotic performance guarantees. When confronted with the task of finding good long-term strategies in repeated 2x2 matrix games, they behave quite differently.
Create a lesson
Related papers
Reinforcement Learning Enables Scaling Generalist Robot Policy Improvement
Michal Korniak, Marco Bagatella, Ralf Römer et al.
Adaptive Multi Mode: Budget-Aware Routing of Optimizers By Online Landscape Probes
Benjamin Jacob Bodner
Navigating Disagreement Among Criteria for Evaluating Explanation Faithfulness
Grant Shanklin, Jiří Němeček, Asia Biega
Context--Answer Metamodels: Forecasting LLM Activations Before the First Answer Token
Tommy He, Thomas Jiralerspong
Systolic Linear Attention: Co-Designing Tile-Grouped Gated Delta Attention for TPUs
Gagik Amirkhanyan, Nuojin Cheng
Message-passing graph persistence
Jorge Luiz Franco, Arthur Queiroz Moura, Moacir Ponti et al.