conftrace_

switching regret

4 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (3) online learning (3) non-stationary problem (1) adversarial bandit (1) experts problem (1) adaptive strategy (1) static regret (1) corral algorithm (1) linear bandit (1) online algorithm (1)

Papers

Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously NeurIPS 2024 Competing against Adaptive Strategies in Online Learning via Hints AISTATS 2023 Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits COLT 2022 Equipping Experts/Bandits with Long-term Memory NeurIPS 2019