Imagen de Portada

Adaptive Smooth Non-Stationary Bandits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Suk, Joe
Formato:	Preprint
Publicado:	2024
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

Smooth Non-Stationary Bandits
por: Jia, Su, et al.
Publicado: (2023)

Non-Stationary Dueling Bandits Under a Weighted Borda Criterion
por: Suk, Joe, et al.
Publicado: (2024)

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

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

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

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

Large-Sample Properties of Non-Stationary Source Separation for Gaussian Signals
por: Bachoc, François, et al.
Publicado: (2022)

Bounds in Wasserstein Distance for Locally Stationary Processes
por: Tinio, Jan Nino G., et al.
Publicado: (2024)

Sampling from the Mean-Field Stationary Distribution
por: Kook, Yunbum, 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)

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

Sign Identifiability of Causal Effects in Stationary Stochastic Dynamical Systems
por: van Seeventer, Gijs, et al.
Publicado: (2026)

Bounds in Wasserstein Distance for Locally Stationary Functional Time Series
por: Tinio, Jan Nino G., et al.
Publicado: (2025)

Statistical Guarantees for Approximate Stationary Points of Shallow Neural Networks
por: Taheri, Mahsa, et al.
Publicado: (2022)

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

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

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)

Concentration of the Langevin Algorithm's Stationary Distribution
por: Altschuler, Jason M., et al.
Publicado: (2022)

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

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

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

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

Diffusion Models and the Manifold Hypothesis: Log-Domain Smoothing is Geometry Adaptive
por: Farghly, Tyler, et al.
Publicado: (2025)

Gaussian-Smoothed Sliced Probability Divergences
por: Alaya, Mokhtar Z., et al.
Publicado: (2024)

Efficient Agnostic Learning with Average Smoothness
por: Hanneke, Steve, et al.
Publicado: (2023)

Online Clustering of Data Sequences with Bandit Information
por: Chandran, G Dhinesh, 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)

Plugin Estimation of Smooth Optimal Transport Maps
por: Manole, Tudor, et al.
Publicado: (2021)

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

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

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

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

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

Smoothed SGD for quantiles: Bahadur representation and Gaussian approximation
por: Chen, Likai, et al.
Publicado: (2025)

Improved Guarantees for Langevin Monte Carlo with Average Smoothness
por: Dalalyan, Arnak S., et al.
Publicado: (2026)

Sparsified-Learning for High-Dimensional Heavy-Tailed Locally Stationary Time Series, Concentration and Oracle Inequalities
por: Wang, Yingjie, et al.
Publicado: (2025)

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