返回
Adaptive Algorithm for Multi-Armed Bandit Problem with High-Dimensional Covariates
DOI:10.1080/01621459.2022.2152343.png)
摘要
En 中文
This article studies an important sequential decision making problem known as the multi-armed stochastic bandit problem with covariates. Under a linear bandit framework with high-dimensional covariates, we propose a general multi-stage arm allocation algorithm that integrates both arm elimination and randomized assignment strategies. By employing a class of high-dimensional regression methods for coefficient estimation, the proposed algorithm is shown to have near optimal finite-time regret performance under a new study scope that requires neither a margin condition nor a reward gap condition for competitive arms. Based on the synergistically verified benefit of the margin, our algorithm exhibits adaptive performance that automatically adapts to the margin and gap conditions, and attains optimal regret rates simultaneously for both study scopes, without or with the margin, up to a logarithmic factor. Besides the desirable regret performance, the proposed algorithm simultaneously generates useful coefficient estimation output for competitive arms and is shown to achieve both estimation consistency and variable selection consistency. Promising empirical performance is demonstrated through extensive simulation and two real data evaluation examples. for this article are available online.
Keyword:
Contextual bandits
Exploration-exploitation tradeoff
High-dimensional regression model
Sequential decision making
Stepwise regression procedure
期刊
J
IF:
3
论文数:
5.2K
被引数:
4.8W
机构
引用论文
Cognitive Processing in Migraine: A Failure To Find Facilitation in Patients with Aura
Cephalalgia
IF0
Correction: Clinical Applicability and Cutoff Values for an Unstructured Neuropsychological Assessment Protocol for Older Adults with Low Formal Education
PLoS ONE
IF0

