Linear Bandits under Exact Sliding-Window Constraints
A rare-switching bandit algorithm keeps exact sliding-window feasibility with near-optimal regret.
1 stories, newest first · one card per story
A rare-switching bandit algorithm keeps exact sliding-window feasibility with near-optimal regret.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views