Open Problem: Model Selection for Contextual Bandits

06/19/2020
by   Dylan J. Foster, et al.
0

In statistical learning, algorithms for model selection allow the learner to adapt to the complexity of the best hypothesis class in a sequence. We ask whether similar guarantees are possible for contextual bandit learning.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/03/2019

Model selection for contextual bandits

We introduce the problem of model selection for contextual bandits, wher...
research
10/25/2021

The Pareto Frontier of model selection for general Contextual Bandits

Recent progress in model selection raises the question of the fundamenta...
research
11/08/2021

Universal and data-adaptive algorithms for model selection in linear contextual bandits

Model selection in contextual bandits is an important complementary prob...
research
07/24/2023

Anytime Model Selection in Linear Bandits

Model selection in the context of bandit optimization is a challenging p...
research
07/13/2022

Cost-Effective Online Contextual Model Selection

How can we collect the most useful labels to learn a model selection pol...
research
06/28/2019

FIESTA: Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms

We present FIESTA, a model selection approach that significantly reduces...
research
02/12/2021

Pareto Optimal Model Selection in Linear Bandits

We study a model selection problem in the linear bandit setting, where t...

Please sign up or login with your details

Forgot password? Click here to reset