paper-with-me

Papers

Open Problem: Model Selection for Contextual Bandits

2020-06-19 · Dylan J. Foster, Akshay Krishnamurthy, Haipeng Luo

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.

📄 PDF Abstract BibTeX arXiv:2006.10940

Code (0)

등록된 구현이 없습니다.

Tasks

modelModel SelectionMulti-Armed Bandits

Similar Papers 제목 키워드 기반

The Pareto Frontier of model selection for general Contextual Bandits

2021-10-25 · NeurIPS 2021 12 · Teodor V. Marinov, Julian Zimmert

Recent progress in model selection raises the question of the fundamental limits of these techniques. Under specific scrutiny has been model selection for general contextual bandits with nested policy classes, resulting …

Model SelectionMulti-Armed Bandits

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

2021-11-08 · Vidya Muthukumar, Akshay Krishnamurthy

Model selection in contextual bandits is an important complementary problem to regret minimization with respect to a fixed model class. We consider the simplest non-trivial instance of model-selection: distinguishing a s…

DiversityModel SelectionMulti-Armed Bandits

Model selection for contextual bandits

2019-06-03 · NeurIPS 2019 12 · Dylan J. Foster, Akshay Krishnamurthy, Haipeng Luo

We introduce the problem of model selection for contextual bandits, where a learner must adapt to the complexity of the optimal policy while balancing exploration and exploitation. Our main result is a new model selectio…

modelModel SelectionMulti-Armed Bandits

Dynamic Batch Learning in High-Dimensional Sparse Linear Contextual Bandits

2020-08-27 · Zhimei Ren, Zhengyuan Zhou

We study the problem of dynamic batch learning in high-dimensional sparse linear contextual bandits, where a decision maker, under a given maximum-number-of-batch constraint and only able to observe rewards at the end of…

Decision MakingMarketingMulti-Armed BanditsVocal Bursts Intensity Prediction

Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms

2022-11-08 · Osama A. Hanna, Lin F. Yang, Christina Fragouli

In this paper, we address the stochastic contextual linear bandit problem, where a decision maker is provided a context (a random set of actions drawn from a distribution). The expected reward of each action is specified…

Multi-Armed Bandits