Transfer learning for contextual multi-armed bandits
From MaRDI portal
Publication:6192325
DOI10.1214/23-aos2341arXiv2211.12612MaRDI QIDQ6192325
Unnamed Author, Hongzhe Li, Changxiao Cai
Publication date: 11 March 2024
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.12612
self-similarityadaptivityminimax rateregret boundstransfer learningcovariate shiftcontextual multi-armed bandit
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistical inference for the mean outcome under a possibly non-unique optimal treatment strategy
- A sharp adaptive confidence ball for self-similar functions
- The multi-armed bandit problem with covariates
- Adaptive confidence intervals for regression functions under shape constraints
- Performance guarantees for individualized treatment rules
- UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem
- Woodroofe's one-armed bandit problem revisited
- Fast learning rates for plug-in classifiers
- Optimal spatial adaptation to inhomogeneous smoothness: An approach based on kernel estimates with variable bandwidth selectors
- On nonparametric confidence intervals
- Smooth discrimination analysis
- An adaptation theory for nonparametric confidence intervals
- New goodness-of-fit tests and their application to nonparametric confidence sets
- Adaptive confidence interval for pointwise curve estimation.
- Randomized allocation with nonparametric estimation for a multi-armed bandit problem with covariates
- Optimal aggregation of classifiers in statistical learning.
- Finite-sample confidence envelopes for shape-restricted densities
- Honest adaptive confidence bands and self-similar functions
- Marginal singularity and the benefits of labels in covariate-shift
- Adaptive transfer learning
- Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm
- Confidence bands in density estimation
- Confidence sets for nonparametric wavelet regression
- Confidence sets in sparse regression
- Minimax and adaptive inference in nonparametric function estimation
- Transfer learning for nonparametric classification: minimax rate and adaptive classifier
- Asymptotically Minimax Adaptive Estimation. I: Upper Bounds. Optimally Adaptive Estimates
- Dynamic Assortment Personalization in High Dimensions
- A One-Armed Bandit Problem with a Concomitant Variable
- Asymptotically Minimax Adaptive Estimation. II. Schemes without Optimal Adaptation: Adaptive Estimators
- On a Problem of Adaptive Estimation in Gaussian White Noise
- 10.1162/153244303321897663
- Smoothness-Adaptive Contextual Bandits
- Smooth Contextual Bandits: Bridging the Parametric and Nondifferentiable Regret Regimes
- MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
- Online Decision Making with High-Dimensional Covariates
- A linear response bandit problem
- Performance Bounds in $L_p$‐norm for Approximate Value Iteration
- Some aspects of the sequential design of experiments
- Transfer Learning for High-Dimensional Linear Regression: Prediction, Estimation and Minimax Optimality
- Randomized allocation with arm elimination in a bandit problem with covariates
- Transfer Learning in Large-Scale Gaussian Graphical Models with False Discovery Rate Control
- Optimally tackling covariate shift in RKHS-based nonparametric regression
