Papers › Online Learning with Bounded Recall
Online Learning with Bounded Recall
Jon Schneider, Kiran Vodrahalli
We study the problem of full-information online learning in the "bounded recall" setting popular in the study of repeated games. An online learning algorithm 𝒜 is M-bounded-recall if its output at time t can be written as a function of the M previous rewards (and not e.g. any other internal state of 𝒜). We first demonstrate that a natural approach to constructing bounded-recall algorithms from mean-based no-regret learning algorithms (e.g., running Hedge over the last M rounds) fails, and that any such algorithm incurs constant regret per round. We then construct a stationary bounded-recall algorithm that achieves a per-round regret of Θ(1/√(M)), which we complement with a tight lower bound. Finally, we show that unlike the perfect recall setting, any low regret bound bounded-recall algorithm must be aware of the ordering of the past M losses -- any bounded-recall algorithm which plays a symmetric function of the past M losses must incur constant regret per round.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections