Cover Image

Transfer Learning for Contextual Multi-armed Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cai, Changxiao, Cai, T. Tony, Li, Hongzhe
Format:	Preprint
Published:	2022
Subjects:	Machine Learning Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minimax-optimal trust-aware multi-armed bandits
by: Cai, Changxiao, et al.
Published: (2024)

Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions
by: Wu, Jingda, et al.
Published: (2026)

Breaking AR's Sampling Bottleneck: Provable Acceleration via Diffusion Language Models
by: Li, Gen, et al.
Published: (2025)

Minimax Optimality of the Probability Flow ODE for Diffusion Models
by: Cai, Changxiao, et al.
Published: (2025)

Adaptation to Intrinsic Dependence in Diffusion Language Models
by: Zhao, Yunxiao, et al.
Published: (2026)

Are First-Order Diffusion Samplers Really Slower? A Fast Forward-Value Approach
by: Jiao, Yuchen, et al.
Published: (2025)

Dimension-Free Convergence of Diffusion Models for Approximate Gaussian Mixtures
by: Li, Gen, et al.
Published: (2025)

Design Experiments to Compare Multi-armed Bandit Algorithms
by: Meng, Huiling, et al.
Published: (2026)

Extended UCB Policies for Multi-armed Bandit Problems
by: Liu, Keqin, et al.
Published: (2011)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

Batched Nonparametric Contextual Bandits
by: Jiang, Rong, et al.
Published: (2024)

Minimax and Adaptive Covariance Matrix Estimation under Differential Privacy
by: Cai, T. Tony, et al.
Published: (2026)

Navigating Sparsities in High-Dimensional Linear Contextual Bandits
by: Zhao, Rui, et al.
Published: (2025)

Asymptotically Optimal Problem-Dependent Bandit Policies for Transfer Learning
by: Prevost, Adrien, et al.
Published: (2025)

Transfer Learning for Nonparametric Contextual Dynamic Pricing
by: Wang, Fan, et al.
Published: (2025)

Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits
by: Xu, Yunbei, et al.
Published: (2020)

Avoiding the Price of Adaptivity: Inference in Linear Contextual Bandits via Stability
by: Praharaj, Samya, et al.
Published: (2025)

Early Stopping in Contextual Bandits and Inferences
by: Cui, Zihan
Published: (2025)

Multi-Armed Bandits With Machine Learning-Generated Surrogate Rewards
by: Ji, Wenlong, et al.
Published: (2025)

Optimal Differentially Private Ranking from Pairwise Comparisons
by: Cai, T. Tony, et al.
Published: (2025)

Federated PCA and Estimation for Spiked Covariance Matrices: Optimal Rates and Efficient Algorithm
by: Li, Jingyang, et al.
Published: (2024)

Optimal Differentially Private PCA and Estimation for Spiked Covariance Matrices
by: Cai, T. Tony, et al.
Published: (2024)

Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning
by: Cai, T. Tony, et al.
Published: (2023)

Minimax And Adaptive Transfer Learning for Nonparametric Classification under Distributed Differential Privacy Constraints
by: Auddy, Arnab, et al.
Published: (2024)

Towards a Sharp Analysis of Offline Policy Learning for $f$-Divergence-Regularized Contextual Bandits
by: Zhao, Qingyue, et al.
Published: (2025)

Multitask Learning and Bandits via Robust Statistics
by: Xu, Kan, et al.
Published: (2021)

Nonparametric Bandits with Single-Index Rewards: Optimality and Adaptivity
by: Ma, Wanteng, et al.
Published: (2025)

Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
by: Zhao, Qingyue, et al.
Published: (2026)

Confidence-Based Decoding is Provably Efficient for Diffusion Language Models
by: Cai, Changxiao, et al.
Published: (2026)

The Fragility of Optimized Bandit Algorithms
by: Fan, Lin, et al.
Published: (2021)

Optimal Batched Linear Bandits
by: Ren, Xuanfei, et al.
Published: (2024)

Representation-Enhanced Neural Knowledge Integration with Application to Large-Scale Medical Ontology Learning
by: Liu, Suqi, et al.
Published: (2024)

Adaptive Smooth Non-Stationary Bandits
by: Suk, Joe
Published: (2024)

Understanding Overparametrization in Survival Models through Interpolation
by: Liu, Yin, et al.
Published: (2025)

Wasserstein Transfer Learning
by: Zhang, Kaicheng, et al.
Published: (2025)

Truncated LinUCB for Stochastic Linear Bandits
by: Song, Yanglei, et al.
Published: (2022)

Testing the Feasibility of Linear Programs with Bandit Feedback
by: Gangrade, Aditya, et al.
Published: (2024)

Thompson sampling: Precise arm-pull dynamics and adaptive inference
by: Han, Qiyang
Published: (2026)

Multi-Environment GLAMP: Approximate Message Passing for Transfer Learning with Applications to Lasso-based Estimators
by: Wang, Longlin, et al.
Published: (2025)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
by: Réveillard, William, et al.
Published: (2025)