Cover Image

Active clustering with bandit feedback

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Thuot, Victor, Carpentier, Alexandra, Giraud, Christophe, Verzelen, Nicolas
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Phase Transition for Stochastic Block Model with more than $\sqrt{n}$ Communities
by: Carpentier, Alexandra, et al.
Published: (2025)

Phase Transition for Stochastic Block Model with more than $\sqrt{n}$ Communities (II)
by: Carpentier, Alexandra, et al.
Published: (2025)

Low-degree Lower bounds for clustering in moderate dimension
by: Carpentier, Alexandra, et al.
Published: (2026)

Low-degree lower bounds via almost orthonormal bases
by: Carpentier, Alexandra, et al.
Published: (2025)

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)

Computational lower bounds in latent models: clustering, sparse-clustering, biclustering
by: Even, Bertrand, et al.
Published: (2025)

Statistical and computational challenges in ranking
by: Carpentier, Alexandra, et al.
Published: (2025)

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

Extreme bandits
by: Carpentier, Alexandra, et al.
Published: (2026)

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

Revealing graph bandits for maximizing local influence
by: Carpentier, Alexandra, et al.
Published: (2026)

Computation-information gap in high-dimensional clustering
by: Even, Bertrand, et al.
Published: (2024)

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

Minimum mean-squared error estimation with bandit feedback
by: Ghosh, Ayon, et al.
Published: (2022)

Active multiple matrix completion with adaptive confidence sets
by: Locatelli, Andrea, et al.
Published: (2026)

Minimax optimal seriation in polynomial time
by: Issartel, Yann, et al.
Published: (2024)

Computational barriers for permutation-based problems, and cumulants of weakly dependent random variables
by: Even, Bertrand, et al.
Published: (2025)

A simple and improved algorithm for noisy, convex, zeroth-order optimisation
by: Carpentier, Alexandra
Published: (2024)

Model-free algorithms for fast node clustering in SBM type graphs and application to social role inference in animals
by: Cloez, Bertrand, et al.
Published: (2025)

Seriation of Toeplitz and latent position matrices: optimal rates and computational trade-offs
by: Berenfeld, Clément, et al.
Published: (2024)

Fairness in two-player zero-sum games with bandit feedback
by: Akash, S, et al.
Published: (2026)

Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier
by: Fiegel, Come, et al.
Published: (2026)

Spectral bandits
by: Kocák, Tomáš, et al.
Published: (2026)

Stochastic contextual bandits with graph feedback: from independence number to MAS number
by: Wen, Yuxiao, et al.
Published: (2024)

Stochastic simultaneous optimistic optimization
by: Valko, Michal, et al.
Published: (2026)

Instance-dependent Stochastic Lipschitz bandit
by: Potfer, Marius, et al.
Published: (2026)

Spectral bandits for smooth graph functions
by: Valko, Michal, et al.
Published: (2026)

Approximate information maximization for bandit games
by: Barbier-Chebbah, Alex, et al.
Published: (2023)

Online learning in bandits with predicted context
by: Guo, Yongyi, et al.
Published: (2023)

Risk and optimal policies in bandit experiments
by: Adusumilli, Karun
Published: (2021)

On the optimal regret of collaborative personalized linear bandits
by: Huang, Bruce, et al.
Published: (2025)

Offline-to-online hyperparameter transfer for stochastic bandits
by: Sharma, Dravyansh, et al.
Published: (2025)

On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX
by: Mortazavi, Ali, et al.
Published: (2024)

Linear bandits with polylogarithmic minimax regret
by: Lumbreras, Josep, et al.
Published: (2024)

Lookahead identification in adversarial bandits: accuracy and memory bounds
by: Brukhim, Nataly, et al.
Published: (2026)

Efficient kernelized bandit algorithms via exploration distributions
by: Hu, Bingshan, et al.
Published: (2025)

Leveraging priors on distribution functions for multi-arm bandits
by: Vashishtha, Sumit, et al.
Published: (2025)

Trading off rewards and errors in multi-armed bandits
by: Erraqabi, Akram, et al.
Published: (2026)

Ensemble sampling for linear bandits: small ensembles suffice
by: Janz, David, et al.
Published: (2023)