Imagen de Portada

Choosing the Better Bandit Algorithm under Data Sharing: When Do A/B Experiments Work?

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Shuangning, Wang, Chonghuan, Wang, Jingyan
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Statistics Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
por: Praharaj, Samya, et al.
Publicado: (2025)

Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits
por: Liu, Jingyu, et al.
Publicado: (2025)

Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
por: Zhou, Julien, et al.
Publicado: (2024)

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
por: Rajaraman, Nived, et al.
Publicado: (2023)

The Sample Complexity of Multiple Change Point Identification under Bandit Feedback
por: Graf, Maximilian, et al.
Publicado: (2026)

Online Clustering of Data Sequences with Bandit Information
por: Chandran, G Dhinesh, et al.
Publicado: (2025)

Transfer Learning for Contextual Multi-armed Bandits
por: Cai, Changxiao, et al.
Publicado: (2022)

Algebraic Geometrical Analysis of Metropolis Algorithm When Parameters Are Non-identifiable
por: Nagata, Kenji, et al.
Publicado: (2024)

Batched Nonparametric Contextual Bandits
por: Jiang, Rong, et al.
Publicado: (2024)

Optimal Batched Linear Bandits
por: Ren, Xuanfei, et al.
Publicado: (2024)

Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm
por: Boudart, Pierre, et al.
Publicado: (2025)

Estimation of Models with Limited Data by Leveraging Shared Structure
por: Rui, Maryann, et al.
Publicado: (2023)

Adaptive Smooth Non-Stationary Bandits
por: Suk, Joe
Publicado: (2024)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
por: Azize, Achraf, et al.
Publicado: (2025)

Generalization Error Curves for Analytic Spectral Algorithms under Power-law Decay
por: Li, Yicheng, et al.
Publicado: (2024)

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

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

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

Is Algorithmic Stability Testable? A Unified Framework under Computational Constraints
por: Luo, Yuetian, et al.
Publicado: (2024)

LIBRA: Language Model Informed Bandit Recourse Algorithm for Personalized Treatment Planning
por: Cao, Junyu, et al.
Publicado: (2026)

When Are Trade-Off Functions Testable from Finite Samples?
por: Shi, Kaining, et al.
Publicado: (2026)

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

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

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

Conformal Predictions under Markovian Data
por: Zheng, Frédéric, et al.
Publicado: (2024)

FLIPHAT: Joint Differential Privacy for High Dimensional Sparse Linear Bandits
por: Chakraborty, Sunrit, et al.
Publicado: (2024)

Rectifying Conformity Scores for Better Conditional Coverage
por: Plassier, Vincent, et al.
Publicado: (2025)

A Simple and Optimal Policy Design with Safety against Heavy-Tailed Risk for Stochastic Bandits
por: Simchi-Levi, David, et al.
Publicado: (2022)

The Adaptivity Barrier in Batched Nonparametric Bandits: Sharp Characterization of the Price of Unknown Margin
por: Jiang, Rong, et al.
Publicado: (2025)

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

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

Improved Algorithm and Bounds for Successive Projection
por: Jin, Jiashun, et al.
Publicado: (2024)

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

Can Generative Artificial Intelligence Survive Data Contamination? Theoretical Guarantees under Contaminated Recursive Training
por: Wang, Kevin, et al.
Publicado: (2026)

Small Ensemble-based Data Assimilation: A Machine Learning-Enhanced Data Assimilation Method with Limited Ensemble Size
por: Li, Zhilin, et al.
Publicado: (2025)

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

Mean Testing under Truncation beyond Gaussian
por: Wang, Yuhao, et al.
Publicado: (2026)