Cover Image

Fixed-Confidence Multiple Change Point Identification under Bandit Feedback

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lazzaro, Joseph, Pike-Burke, Ciara
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fixed-Budget Change Point Identification in Piecewise Constant Bandits
by: Lazzaro, Joseph, et al.
Published: (2025)

Locally Differentially Private Thresholding Bandits
by: Barbara, Annalisa, et al.
Published: (2025)

QuACK: A Multipurpose Queuing Algorithm for Cooperative $k$-Armed Bandits
by: Howson, Benjamin, et al.
Published: (2024)

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

Learning Fair And Effective Points-Based Rewards Programs
by: Hssaine, Chamsi, et al.
Published: (2025)

When and why randomised exploration works (in linear bandits)
by: Abeille, Marc, et al.
Published: (2025)

Sample-Efficiency in Multi-Batch Reinforcement Learning: The Need for Dimension-Dependent Adaptivity
by: Johnson, Emmeran, et al.
Published: (2023)

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

Optimal Best-Arm Identification under Fixed Confidence with Multiple Optima
by: Truong, Lan V.
Published: (2025)

Stochastic Shortest Path with Sparse Adversarial Costs
by: Johnson, Emmeran, et al.
Published: (2025)

On the necessity of adaptive regularisation:Optimal anytime online learning on $\boldsymbol{\ell_p}$-balls
by: Johnson, Emmeran, et al.
Published: (2025)

Bandit Pareto Set Identification: the Fixed Budget Setting
by: Kone, Cyrille, et al.
Published: (2023)

Constrained Pareto Set Identification with Bandit Feedback
by: Kone, Cyrille, et al.
Published: (2025)

Fixed Confidence Best Arm Identification in the Bayesian Setting
by: Jang, Kyoungseok, et al.
Published: (2024)

Risk-Averse Best Arm Set Identification with Fixed Budget and Fixed Confidence
by: Nonaga, Shunta, et al.
Published: (2025)

Fair Best Arm Identification with Fixed Confidence
by: Russo, Alessio, et al.
Published: (2024)

Fixed-Budget Constrained Best Arm Identification in Grouped Bandits
by: Mukherjee, Raunak, et al.
Published: (2026)

Multi-thresholding Good Arm Identification with Bandit Feedback
by: Jiang, Xuanke, et al.
Published: (2025)

The Cost of Learning under Multiple Change Points
by: Gafni, Tomer, et al.
Published: (2026)

Multiclass Online Learnability under Bandit Feedback
by: Raman, Ananth, et al.
Published: (2023)

A Finite Time Analysis of Thompson Sampling for Bayesian Optimization with Preferential Feedback
by: Lazzaro, Joseph, et al.
Published: (2026)

Fixed-Confidence Best Arm Identification with Decreasing Variance
by: Roychowdhury, Tamojeet, et al.
Published: (2025)

Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors
by: Balagopalan, Kapilan, et al.
Published: (2026)

Prior-Dependent Allocations for Bayesian Fixed-Budget Best-Arm Identification in Structured Bandits
by: Nguyen, Nicolas, et al.
Published: (2024)

Learning Markov Decision Processes under Fully Bandit Feedback
by: Zhuo, Zhengjia, et al.
Published: (2026)

Robust Pareto Set Identification with Contaminated Bandit Feedback
by: Korkmaz, İlter Onat, et al.
Published: (2022)

Optimal Multi-Objective Best Arm Identification with Fixed Confidence
by: Chen, Zhirui, et al.
Published: (2025)

Optimal High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback
by: Ye, Haishan
Published: (2026)

Nearest Neighbour with Bandit Feedback
by: Pasteris, Stephen, et al.
Published: (2023)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
by: Goyal, Tanmay, et al.
Published: (2025)

Improved Online Confidence Bounds for Multinomial Logistic Bandits
by: Lee, Joongkyu, et al.
Published: (2025)

Lipschitz Bandits with Stochastic Delayed Feedback
by: Liu, Zhongxuan, et al.
Published: (2025)

Queueing Matching Bandits with Preference Feedback
by: Kim, Jung-hun, et al.
Published: (2024)

Graph Feedback Bandits with Similar Arms
by: Qi, Han, et al.
Published: (2024)

Nonparametric Kernel Clustering with Bandit Feedback
by: Thuot, Victor, et al.
Published: (2026)

Fixed Point Neural Acceleration and Inverse Surrogate Model for Battery Parameter Identification
by: Cheon, Hojin, et al.
Published: (2025)

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

Cascading Bandits With Feedback
by: Prakash, R Sri, et al.
Published: (2025)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
by: Nie, Guanyu, et al.
Published: (2024)

Does Feedback Help in Bandits with Arm Erasures?
by: Karakas, Merve, et al.
Published: (2025)