Cover Image

Quantile Multi-Armed Bandits with 1-bit Feedback

Fuente: arXiv

Saved in:

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

Similar Items

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

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

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)

Batched Kernelized Bandits: Refinements and Extensions
by: Ma, Chenkai, et al.
Published: (2026)

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

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

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

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

Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits
by: Gu, Yuzhou, et al.
Published: (2025)

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
by: Hou, Yunlong, et al.
Published: (2026)

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

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

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

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)

Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback
by: Pokhriyal, Subham, et al.
Published: (2026)

Quantile Learn-Then-Test: Quantile-Based Risk Control for Hyperparameter Optimization
by: Farzaneh, Amirmohammad, et al.
Published: (2024)

Optimal 1-bit Error Exponent for 2-hop Relaying with Binary-Input Channels
by: Ling, Yan Hao, et al.
Published: (2023)

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

Causal Feature Selection Method for Contextual Multi-Armed Bandits in Recommender System
by: Zhao, Zhenyu, et al.
Published: (2024)

Distributional Information Embedding: A Framework for Multi-bit Watermarking
by: He, Haiyun, et al.
Published: (2025)

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

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

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

Price of universality in vector quantization is at most 0.11 bit
by: Harbuzova, Alina, et al.
Published: (2026)

Which bits went where? Past and future transfer entropy decomposition with the information bottleneck
by: Murphy, Kieran A., et al.
Published: (2024)

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

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

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

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)

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

Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits
by: Chawla, Ronshee, et al.
Published: (2023)

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
by: Ji, Kaixuan, et al.
Published: (2026)

Combinatorial Multi-armed Bandits: Arm Selection via Group Testing
by: Mukherjee, Arpan, et al.
Published: (2024)

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

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

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)