Cover Image

Batched Kernelized Bandits: Refinements and Extensions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ma, Chenkai, Chen, Keqin, Scarlett, Jonathan
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Lower Bounds for Time-Varying Kernelized Bandits
by: Cai, Xu, et al.
Published: (2024)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
by: Li, Zihan, et al.
Published: (2022)

Quantile Multi-Armed Bandits with 1-bit Feedback
by: Lau, Ivan, et al.
Published: (2025)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)

Tight Regret Bounds for Bayesian Optimization in One Dimension
by: Scarlett, Jonathan
Published: (2018)

Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
by: Lau, Ivan, et al.
Published: (2026)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
by: Lau, Ivan, et al.
Published: (2025)

Concomitant Group Testing
by: Bui, Thach V., et al.
Published: (2023)

A General Framework for Clustering and Distribution Matching with Bandit Feedback
by: Yavas, Recep Can, et al.
Published: (2024)

Statistical Mean Estimation with Coded Relayed Observations
by: Ling, Yan Hao, et al.
Published: (2025)

A Fast Binary Splitting Approach for Non-Adaptive Learning of Erdős--Rényi Graphs
by: Ta, Hoang, et al.
Published: (2025)

Beam-aware Kernelized Contextual Bandits for User Association and Beamforming in mmWave Vehicular Networks
by: He, Xiaoyang, et al.
Published: (2026)

Refined Differentially Private Linear Regression via Extension of a Free Lunch Result
by: S, Sasmita Harini, et al.
Published: (2026)

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

A Distribution Testing Approach to Clustering Distributions
by: Kumar, Gunjan, et al.
Published: (2025)

Batch Universal Prediction
by: Bondaschi, Marco, et al.
Published: (2024)

Envy-Free Allocation of Indivisible Goods via Noisy Queries
by: Li, Zihan, et al.
Published: (2026)

Restless Linear Bandits
by: Khaleghi, Azadeh
Published: (2024)

Optimal Clustering with Bandit Feedback
by: Yang, Junwen, et al.
Published: (2022)

Universal Batch Learning Under The Misspecification Setting
by: Vituri, Shlomi, et al.
Published: (2024)

The Conditional Regret-Capacity Theorem for Batch Universal Prediction
by: Bondaschi, Marco, et al.
Published: (2025)

Bandit Convex Optimization with Gradient Prediction Adaptivity
by: Wang, Shuche, et al.
Published: (2026)

Optimal Arm Elimination Algorithms for Combinatorial Bandits
by: Wen, Yuxiao, et al.
Published: (2025)

Conversational Dueling Bandits in Generalized Linear Models
by: Yang, Shuhua, et al.
Published: (2024)

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

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

A Modularized Framework for Piecewise-Stationary Restless Bandits
by: Li, Kuan-Ta, et al.
Published: (2026)

Competing Bandits in Matching Markets via Super Stability
by: Basu, Soumya
Published: (2025)

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

Relaxed Triangle Inequality for Kullback-Leibler Divergence Between Multivariate Gaussian Distributions
by: Xiao, Shiji, et al.
Published: (2026)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
by: Panda, Subhodip, et al.
Published: (2026)

Optimal Best Arm Identification with Fixed Confidence in Restless Bandits
by: Karthik, P. N., et al.
Published: (2023)

Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits
by: Bian, Jie, et al.
Published: (2024)

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

Batches Stabilize the Minimum Norm Risk in High Dimensional Overparameterized Linear Regression
by: Ioushua, Shahar Stein, et al.
Published: (2023)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing
by: Ryu, J. Jon, et al.
Published: (2025)

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

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
by: Chen, Fan, et al.
Published: (2024)

Diminishing Exploration: A Minimalist Approach to Piecewise Stationary Multi-Armed Bandits
by: Li, Kuan-Ta, et al.
Published: (2024)