Adaptive Algorithm for Multi-Armed Bandit Problem with High-Dimensional Covariates
From MaRDI portal
Publication:6567892
Cites work
- scientific article; zbMATH DE number 4078557 (Why is no real title available?)
- scientific article; zbMATH DE number 194374 (Why is no real title available?)
- scientific article; zbMATH DE number 6276176 (Why is no real title available?)
- A One-Armed Bandit Problem with a Concomitant Variable
- A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
- A linear response bandit problem
- A stepwise regression method and consistent model selection for highdimensional sparse linear models
- Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
- Adaptive treatment allocation and the multi-armed bandit problem
- An Interactive Greedy Approach to Group Sparsity in High Dimensions
- Asymptotically efficient adaptive allocation rules
- Bandit algorithms
- Decoding by Linear Programming
- Dynamic treatment regimes: technical challenges and applications
- Estimation of treatment policies based on functional predictors
- Fast learning rates for plug-in classifiers
- Finite-time analysis of the multiarmed bandit problem
- High-dimensional \(A\)-learning for optimal dynamic treatment regimes
- Improved Rates for the Stochastic Continuum-Armed Bandit Problem
- Kernel estimation and model combination in a bandit problem with covariates
- Lasso-type recovery of sparse representations for high-dimensional data
- Minimax nonparametric classification .I. Rates of convergence
- Nearly unbiased variable selection under minimax concave penalty
- Online decision making with high-dimensional covariates
- Optimal Dynamic Treatment Regimes
- Optimal aggregation of classifiers in statistical learning.
- Optimal treatment allocations in space and time for on-line control of an emerging infectious disease
- Performance guarantees for individualized treatment rules
- Prediction, Learning, and Games
- Pure exploration in finitely-armed and continuous-armed bandits
- Q-learning with censored data
- Randomized allocation with arm elimination in a bandit problem with covariates
- Randomized allocation with nonparametric estimation for a multi-armed bandit problem with covariates
- Randomized allocation with nonparametric estimation for contextual multi-armed bandits with delayed rewards
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Smooth discrimination analysis
- Some aspects of the sequential design of experiments
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Sparse minimum discrepancy approach to sufficient dimension reduction with simultaneous variable selection in ultrahigh dimension
- The Adaptive Lasso and Its Oracle Properties
- The \(k\)-nearest neighbour UCB algorithm for multi-armed bandits with covariates
- The multi-armed bandit problem with covariates
- The multi-armed bandit problem: an efficient nonparametric solution
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Woodroofe's one-armed bandit problem revisited
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)
