Nonparametric Kernel Clustering with Bandit Feedback
Fuente:
arXiv
Saved in:
| Main Authors: | Thuot, Victor, Vogt, Sebastian, Ghoshdastidar, Debarghya, Verzelen, Nicolas |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| 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)
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)
by: Saad, El Mehdi, et al.
Published: (2026)
Explaining Kernel Clustering via Decision Trees
by: Fleissner, Maximilian, et al.
Published: (2024)
by: Fleissner, Maximilian, et al.
Published: (2024)
Active clustering with bandit feedback
by: Thuot, Victor, et al.
Published: (2024)
by: Thuot, Victor, et al.
Published: (2024)
The Sample Complexity of Multiple Change Point Identification under Bandit Feedback
by: Graf, Maximilian, et al.
Published: (2026)
by: Graf, Maximilian, et al.
Published: (2026)
Explainable Clustering Beyond Worst-Case Guarantees
by: Fleissner, Maximilian, et al.
Published: (2024)
by: Fleissner, Maximilian, et al.
Published: (2024)
Recovering Imbalanced Clusters via Gradient-Based Projection Pursuit
by: Eppert, Martin, et al.
Published: (2025)
by: Eppert, Martin, et al.
Published: (2025)
Transformers Provably Learn Sparse XOR with Polylogarithmic Parameters
by: Han, Yaomengxi, et al.
Published: (2025)
by: Han, Yaomengxi, et al.
Published: (2025)
When can we Approximate Wide Contrastive Models with Neural Tangent Kernels and Principal Component Analysis?
by: Anil, Gautham Govind, et al.
Published: (2024)
by: Anil, Gautham Govind, et al.
Published: (2024)
Non-Singularity of the Gradient Descent map for Neural Networks with Piecewise Analytic Activations
by: Crăciun, Alexandru, et al.
Published: (2025)
by: Crăciun, Alexandru, et al.
Published: (2025)
On the Convergence of Gradient Descent for Large Learning Rates
by: Crăciun, Alexandru, et al.
Published: (2024)
by: Crăciun, Alexandru, et al.
Published: (2024)
Tight PAC-Bayesian Risk Certificates for Contrastive Learning
by: Van Elst, Anna, et al.
Published: (2024)
by: Van Elst, Anna, et al.
Published: (2024)
Gaussian Process Limit Reveals Structural Benefits of Graph Transformers
by: Ayday, Nil, et al.
Published: (2026)
by: Ayday, Nil, et al.
Published: (2026)
Impact of Bottleneck Layers and Skip Connections on the Generalization of Linear Denoising Autoencoders
by: Ham, Jonghyun, et al.
Published: (2025)
by: Ham, Jonghyun, et al.
Published: (2025)
Theoretical Foundations of Representation Learning using Unlabeled Data: Statistics and Optimization
by: Esser, Pascal, et al.
Published: (2025)
by: Esser, Pascal, et al.
Published: (2025)
Exact Generalisation Error Exposes Benchmarks Skew Graph Neural Networks Success (or Failure)
by: Ayday, Nil, et al.
Published: (2025)
by: Ayday, Nil, et al.
Published: (2025)
A Probabilistic Model for Non-Contrastive Learning
by: Fleissner, Maximilian, et al.
Published: (2025)
by: Fleissner, Maximilian, et al.
Published: (2025)
A Theoretical Characterization of Optimal Data Augmentations in Self-Supervised Learning
by: Feigin, Shlomo Libo, et al.
Published: (2024)
by: Feigin, Shlomo Libo, et al.
Published: (2024)
Infinite Width Limits of Self Supervised Neural Networks
by: Fleissner, Maximilian, et al.
Published: (2024)
by: Fleissner, Maximilian, et al.
Published: (2024)
Interpretable Self-Supervised Learning via Representer Landmarks and Nyström Approximation
by: Zarvandi, Maedeh, et al.
Published: (2025)
by: Zarvandi, Maedeh, et al.
Published: (2025)
Exact Certification of (Graph) Neural Networks Against Label Poisoning
by: Sabanayagam, Mahalakshmi, et al.
Published: (2024)
by: Sabanayagam, Mahalakshmi, et al.
Published: (2024)
Robustness Certificates for Neural Networks against Adversarial Attacks
by: Taheri, Sara, et al.
Published: (2025)
by: Taheri, Sara, et al.
Published: (2025)
Provable Robustness of (Graph) Neural Networks Against Data Poisoning and Backdoor Attacks
by: Gosch, Lukas, et al.
Published: (2024)
by: Gosch, Lukas, et al.
Published: (2024)
Robust Feature Inference: A Test-time Defense Strategy using Spectral Projections
by: Singh, Anurag, et al.
Published: (2023)
by: Singh, Anurag, et al.
Published: (2023)
Generalization Certificates for Adversarially Robust Bayesian Linear Regression
by: Sabanayagam, Mahalakshmi, et al.
Published: (2025)
by: Sabanayagam, Mahalakshmi, et al.
Published: (2025)
Different Statistical Perspectives for Understanding Generalisation in Graph Neural Networks
by: Ayday, Nil, et al.
Published: (2026)
by: Ayday, Nil, et al.
Published: (2026)
Exact Certification of Neural Networks and Partition Aggregation Ensembles against Label Poisoning
by: Mohgaonkar, Ajinkya, et al.
Published: (2026)
by: Mohgaonkar, Ajinkya, et al.
Published: (2026)
Statistical and computational challenges in ranking
by: Carpentier, Alexandra, et al.
Published: (2025)
by: Carpentier, Alexandra, et al.
Published: (2025)
Low-degree Lower bounds for clustering in moderate dimension
by: Carpentier, Alexandra, et al.
Published: (2026)
by: Carpentier, Alexandra, et al.
Published: (2026)
Optimal Clustering with Bandit Feedback
by: Yang, Junwen, et al.
Published: (2022)
by: Yang, Junwen, et al.
Published: (2022)
Sparse Nonparametric Contextual Bandits
by: Flynn, Hamish, et al.
Published: (2025)
by: Flynn, Hamish, et al.
Published: (2025)
Batched Nonparametric Contextual Bandits
by: Jiang, Rong, et al.
Published: (2024)
by: Jiang, Rong, et al.
Published: (2024)
Phase Transition for Stochastic Block Model with more than $\sqrt{n}$ Communities
by: Carpentier, Alexandra, et al.
Published: (2025)
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)
by: Carpentier, Alexandra, et al.
Published: (2025)
Laplacian Kernelized Bandit
by: Wu, Shuang, et al.
Published: (2026)
by: Wu, Shuang, et al.
Published: (2026)
High-dimensional Nonparametric Contextual Bandit Problem
by: Iwazaki, Shogo, et al.
Published: (2025)
by: Iwazaki, Shogo, et al.
Published: (2025)
Optimal level set estimation for non-parametric tournament and crowdsourcing problems
by: Graf, Maximilian, et al.
Published: (2024)
by: Graf, Maximilian, et al.
Published: (2024)
Clustering by Nonparametric Smoothing
by: Hofmeyr, David P.
Published: (2025)
by: Hofmeyr, David P.
Published: (2025)
Adaptive Estimation and Inference in Semi-parametric Heterogeneous Clustered Multitask Learning via Neyman Orthogonality
by: Chen, Hanxiao, et al.
Published: (2026)
by: Chen, Hanxiao, et al.
Published: (2026)
Low-degree lower bounds via almost orthonormal bases
by: Carpentier, Alexandra, et al.
Published: (2025)
by: Carpentier, Alexandra, et al.
Published: (2025)
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) -
Explaining Kernel Clustering via Decision Trees
by: Fleissner, Maximilian, et al.
Published: (2024) -
Active clustering with bandit feedback
by: Thuot, Victor, et al.
Published: (2024) -
The Sample Complexity of Multiple Change Point Identification under Bandit Feedback
by: Graf, Maximilian, et al.
Published: (2026)