Adaptive Algorithm for Multi-Armed Bandit Problem with High-Dimensional Covariates
type: Item
instance of: scholarly article
title: Adaptive Algorithm for Multi-Armed Bandit Problem with High-Dimensional Covariates
DOI: 10.1080/01621459.2022.2152343
author: Wei Qian
author: Ching-Kang Ing
author: Ji Liu
published in: Journal of the American Statistical Association
publication date: 2024-07-05T00:00:00Z
Mathematics Subject Classification ID: 62-XX
zbMATH DE Number: 7877134
MaRDI profile type: Publication
cites work: Randomized allocation with nonparametric estimation for contextual multi-armed bandits with delayed rewards
cites work: Fast learning rates for plug-in classifiers
cites work: Finite-time analysis of the multiarmed bandit problem
cites work: Improved Rates for the Stochastic Continuum-Armed Bandit Problem
cites work: Online Decision Making with High-Dimensional Covariates
cites work: Q3809068
cites work: Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
cites work: Pure exploration in finitely-armed and continuous-armed bandits
cites work: Decoding by Linear Programming
cites work: Prediction, Learning, and Games
cites work: The multi-armed bandit problem: an efficient nonparametric solution
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
cites work: Q4692329
cites work: Q-learning with censored data
cites work: Woodroofe's one-armed bandit problem revisited
cites work: A linear response bandit problem
cites work: A stepwise regression method and consistent model selection for high-dimensional sparse linear models
cites work: Dynamic treatment regimes: technical challenges and applications
cites work: Optimal treatment allocations in space and time for on-line control of an emerging infectious disease
cites work: Adaptive treatment allocation and the multi-armed bandit problem
cites work: Asymptotically efficient adaptive allocation rules
cites work: Bandit Algorithms
cites work: Smooth discrimination analysis
cites work: Q5405185
cites work: Estimation of treatment policies based on functional predictors
cites work: Lasso-type recovery of sparse representations for high-dimensional data
cites work: Optimal Dynamic Treatment Regimes
cites work: The multi-armed bandit problem with covariates
cites work: Performance guarantees for individualized treatment rules
cites work: Sparse Minimum Discrepancy Approach to Sufficient Dimension Reduction with Simultaneous Variable Selection in Ultrahigh Dimension
cites work: An Interactive Greedy Approach to Group Sparsity in High Dimensions
cites work: Kernel estimation and model combination in a bandit problem with covariates
cites work: Randomized allocation with arm elimination in a bandit problem with covariates
cites work: Q4617637
cites work: Some aspects of the sequential design of experiments
cites work: High-dimensional \(A\)-learning for optimal dynamic treatment regimes
cites work: Optimal aggregation of classifiers in statistical learning.
cites work: A One-Armed Bandit Problem with a Concomitant Variable
cites work: Minimax nonparametric classification .I. Rates of convergence
cites work: Randomized allocation with nonparametric estimation for a multi-armed bandit problem with covariates
cites work: Nearly unbiased variable selection under minimax concave penalty
cites work: Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
cites work: Sparse Recovery With Orthogonal Matching Pursuit Under RIP
cites work: The Adaptive Lasso and Its Oracle Properties
description: scientific article; zbMATH DE number 7877134