English

Open Problem: Model Selection for Contextual Bandits

Machine Learning 2020-06-22 v1 Machine Learning

Abstract

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.

Keywords

Cite

@article{arxiv.2006.10940,
  title  = {Open Problem: Model Selection for Contextual Bandits},
  author = {Dylan J. Foster and Akshay Krishnamurthy and Haipeng Luo},
  journal= {arXiv preprint arXiv:2006.10940},
  year   = {2020}
}

Comments

COLT 2020 open problem

R2 v1 2026-06-23T16:27:17.931Z