research
∙
10/07/2020
Near-Optimal Regret Bounds for Model-Free RL in Non-Stationary Episodic MDPs
We consider model-free reinforcement learning (RL) in non-stationary Mar...
share
research
∙
08/31/2020
Design and Analysis of Switchback Experiments
In switchback experiments, a firm sequentially exposes an experimental u...
research
∙
03/28/2020
Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability
We consider the general (stochastic) contextual bandit problem under the...
research
∙
07/20/2019
A Competitive Analysis of Online Knapsack Problems with Unit Density
We study an online knapsack problem where the items arrive sequentially ...
research
∙
06/07/2019
Reinforcement Learning under Drift
We propose algorithms with state-of-the-art dynamic regret bounds for un...
research
∙
02/28/2019
Meta Dynamic Pricing: Learning Across Experiments
We study the problem of learning across a sequence of price experiments ...
research
∙
11/02/2018
