Cover Image

The Sample Complexity of Multiple Change Point Identification under Bandit Feedback

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Graf, Maximilian, Thuot, Victor
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Clustering Items through Bandit Feedback: Finding the Right Feature out of Many
by: Graf, Maximilian, et al.
Published: (2025)

The Sampling Complexity of Condorcet Winner Identification in Dueling Bandits
by: Saad, El Mehdi, et al.
Published: (2026)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
by: Hanneke, Steve, et al.
Published: (2026)

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

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization
by: Ji, Kaixuan, et al.
Published: (2026)

Sample Complexity of Probability Divergences under Group Symmetry
by: Chen, Ziyu, et al.
Published: (2023)

Inferring Change Points in Regression via Sample Weighting
by: Arpino, Gabriel, et al.
Published: (2026)

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

Fixed-Confidence Multiple Change Point Identification under Bandit Feedback
by: Lazzaro, Joseph, et al.
Published: (2025)

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

The Sample Complexity of Multicalibration
by: Collina, Natalie, et al.
Published: (2026)

The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints
by: Kazemi, Hadi, et al.
Published: (2025)

Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances
by: Matilla, German Martinez, et al.
Published: (2025)

Sample Complexity of the Sign-Perturbed Sums Identification Method: Scalar Case
by: Szentpéteri, Szabolcs, et al.
Published: (2024)

Generator Identification for Linear SDEs with Additive and Multiplicative Noise
by: Wang, Yuanyuan, et al.
Published: (2023)

Choosing the Better Bandit Algorithm under Data Sharing: When Do A/B Experiments Work?
by: Li, Shuangning, et al.
Published: (2025)

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

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

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

Nearest-Neighbor Radii under Dependent Sampling
by: Gao, Yuanyuan, et al.
Published: (2026)

Adaptive Smooth Non-Stationary Bandits
by: Suk, Joe
Published: (2024)

On the Sample Complexity of Robust Binary Hypothesis Testing
by: Vallinayagam, Shankar, et al.
Published: (2026)

The Sample Complexity of Simple Binary Hypothesis Testing
by: Pensia, Ankit, et al.
Published: (2024)

Optimal level set estimation for non-parametric tournament and crowdsourcing problems
by: Graf, Maximilian, et al.
Published: (2024)

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

Offline Estimation of Controlled Markov Chains: Minimaxity and Sample Complexity
by: Banerjee, Imon, et al.
Published: (2022)

Online Kernel CUSUM for Change-Point Detection
by: Wei, Song, et al.
Published: (2022)

Noise-contrastive Online Change Point Detection
by: Puchkin, Nikita, et al.
Published: (2022)

Multiscale Euclidean Network Trajectories: Second-Moment Geometry, Attribution, and Change Points
by: Ezoe, Haruka, et al.
Published: (2026)

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

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

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

Inferring Change Points in High-Dimensional Regression via Approximate Message Passing
by: Arpino, Gabriel, et al.
Published: (2024)

Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes
by: Wang, He, et al.
Published: (2024)

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

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

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

Locally Optimal Fixed-Budget Best Arm Identification in Two-Armed Gaussian Bandits with Unknown Variances
by: Kato, Masahiro
Published: (2023)

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

PCA for Point Processes
by: Picard, Franck, et al.
Published: (2024)