Co-occurring keywords · papers mentioning both
Papers
An Online Algorithm for Smoothed Regression and LQR Control
AISTATS 2019
Bandits with Feedback Graphs and Switching Costs
NeurIPS 2019
Competitive ratio vs regret minimization: achieving the best of both worlds
ALT 2019
Online learning with feedback graphs and switching costs
AISTATS 2019
Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints
NeurIPS 2019
Provably Efficient Q-Learning with Low Switching Cost
NeurIPS 2019
Online learning over a finite action set with limited switching
COLT 2018
Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent
COLT 2018
Bandits with Movement Costs and Adaptive Pricing
COLT 2017
Multi-Armed Bandits with Metric Movement Costs
NeurIPS 2017
Batched Bandit Problems
COLT 2015
Higher-Order Regret Bounds with Switching Costs
COLT 2014
Online Learning with Switching Costs and Other Adaptive Adversaries
NeurIPS 2013