Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability

Submitted by yunzong@mit.edu on

TitleBypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability
Publication TypeJournal Article
Year of Publication2021
AuthorsSimchi-Levi D, Xu Y
JournalMathematics of Operations Research
Topicsa. Statistical Learning in Operations