Adaptive Algorithm for Multi-Armed Bandit Problem with High-Dimensional Covariates
From MaRDI portal
Publication:6567892
DOI10.1080/01621459.2022.2152343MaRDI QIDQ6567892
Ching-Kang Ing, Ji Liu, Wei Qian
Publication date: 5 July 2024
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nearly unbiased variable selection under minimax concave penalty
- The Adaptive Lasso and Its Oracle Properties
- A stepwise regression method and consistent model selection for high-dimensional sparse linear models
- The multi-armed bandit problem with covariates
- Dynamic treatment regimes: technical challenges and applications
- Q-learning with censored data
- Performance guarantees for individualized treatment rules
- Woodroofe's one-armed bandit problem revisited
- Fast learning rates for plug-in classifiers
- Lasso-type recovery of sparse representations for high-dimensional data
- Asymptotically efficient adaptive allocation rules
- Adaptive treatment allocation and the multi-armed bandit problem
- Smooth discrimination analysis
- High-dimensional \(A\)-learning for optimal dynamic treatment regimes
- Randomized allocation with nonparametric estimation for a multi-armed bandit problem with covariates
- Optimal aggregation of classifiers in statistical learning.
- Randomized allocation with nonparametric estimation for contextual multi-armed bandits with delayed rewards
- The multi-armed bandit problem: an efficient nonparametric solution
- Pure exploration in finitely-armed and continuous-armed bandits
- Kernel estimation and model combination in a bandit problem with covariates
- A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
- Decoding by Linear Programming
- A One-Armed Bandit Problem with a Concomitant Variable
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Minimax nonparametric classification .I. Rates of convergence
- Optimal Dynamic Treatment Regimes
- Bandit Algorithms
- Online Decision Making with High-Dimensional Covariates
- A linear response bandit problem
- Sparse Minimum Discrepancy Approach to Sufficient Dimension Reduction with Simultaneous Variable Selection in Ultrahigh Dimension
- Estimation of treatment policies based on functional predictors
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Improved Rates for the Stochastic Continuum-Armed Bandit Problem
- Prediction, Learning, and Games
- Some aspects of the sequential design of experiments
- Finite-time analysis of the multiarmed bandit problem
- Randomized allocation with arm elimination in a bandit problem with covariates
- An Interactive Greedy Approach to Group Sparsity in High Dimensions
- Optimal treatment allocations in space and time for on-line control of an emerging infectious disease
This page was built for publication: Adaptive Algorithm for Multi-Armed Bandit Problem with High-Dimensional Covariates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567892)