conftrace_

dynamic regret

94 papers

Explore in graph

Co-occurring keywords

online learning (1777) online convex optimization (165) regret bound (1926) non-stationary environment (61) online algorithm (445) convex optimization (1321) adaptive regret (19) multi-armed bandit (1098) online gradient descent (39) policy optimization (657)

Papers

A Simple Online Algorithm for Competing with Dynamic Comparators UAI 2020
Randomized Exploration for Non-Stationary Stochastic Linear Bandits UAI 2020
Dynamic Regret of Policy Optimization in Non-Stationary Environments NIPS 2020
Parameter-free, Dynamic, and Strongly-Adaptive Online Learning ICML 2020
The Power of Predictions in Online Control NIPS 2020
Weighted Linear Bandits for Non-Stationary Environments NIPS 2019
Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysis NIPS 2019
Online Forecasting of Total-Variation-bounded Sequences NIPS 2019
Improved Path-length Regret Bounds for Bandits COLT 2019
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information COLT 2019
Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes COLT 2019
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free COLT 2019
Learning to Optimize under Non-Stationarity AISTATS 2019
Adaptive Online Learning in Dynamic Environments NIPS 2018
Dynamic Regret of Strongly Adaptive Methods ICML 2018
Efficient Contextual Bandits in Non-stationary Worlds COLT 2018
Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent COLT 2018
Improved Dynamic Regret for Non-degenerate Functions NIPS 2017
Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient ICML 2016