Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability. Mathematics of Operations Research.. 2021.
Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective. COLT 2021.. 2021.
Online Pricing with Offline Data: Phase Transition and Inverse Square Law. Management Science.. 2021.