dorsal/arxiv
View SchemaNonparametric Kernel Clustering with Bandit Feedback
| Authors | Victor Thuot, Sebastian Vogt, Debarghya Ghoshdastidar, Nicolas Verzelen |
|---|---|
| Categories | |
| ArXiv ID | 2601.07535vv1 |
| URL | https://arxiv.org/abs/2601.07535 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Clustering with bandit feedback refers to the problem of partitioning a set of items, where the clustering algorithm can sequentially query the items to receive noisy observations. The problem is formally posed as the task of partitioning the arms of an N-armed stochastic bandit according to their underlying distributions, grouping two arms together if and only if they share the same distribution, using samples collected sequentially and adaptively. This setting has gained attention in recent years due to its applicability in recommendation systems and crowdsourcing. Existing works on clustering with bandit feedback rely on a strong assumption that the underlying distributions are sub-Gaussian. As a consequence, the existing methods mainly cover settings with linearly-separable clusters, which has little practical relevance. We introduce a framework of ``nonparametric clustering with bandit feedback'', where the underlying arm distributions are not constrained to any parametric, and hence, it is applicable for active clustering of real-world datasets. We adopt a kernel-based approach, which allows us to reformulate the nonparametric problem as the task of clustering the arms according to their kernel mean embeddings in a reproducing kernel Hilbert space (RKHS). Building on this formulation, we introduce the KABC algorithm with theoretical correctness guarantees and analyze its sampling budget. We introduce a notion of signal-to-noise ratio for this problem that depends on the maximum mean discrepancy (MMD) between the arm distributions and on their variance in the RKHS. Our algorithm is adaptive to this unknown quantity: it does not require it as an input yet achieves instance-dependent guarantees.
{
"annotation_id": "2621b578-8d8a-48ef-be4c-cb8259ce20a0",
"date_created": "2026-02-17T05:53:12.601000Z",
"date_modified": "2026-02-17T05:53:12.601000Z",
"file_hash": "c21ecf88f0944e10b945070db2d2c23bae281eb0f4fa1a76e4c837817bf47b39",
"private": false,
"record": {
"abstract": "Clustering with bandit feedback refers to the problem of partitioning a set of items, where the clustering algorithm can sequentially query the items to receive noisy observations. The problem is formally posed as the task of partitioning the arms of an N-armed stochastic bandit according to their underlying distributions, grouping two arms together if and only if they share the same distribution, using samples collected sequentially and adaptively. This setting has gained attention in recent years due to its applicability in recommendation systems and crowdsourcing. Existing works on clustering with bandit feedback rely on a strong assumption that the underlying distributions are sub-Gaussian. As a consequence, the existing methods mainly cover settings with linearly-separable clusters, which has little practical relevance. We introduce a framework of ``nonparametric clustering with bandit feedback\u0027\u0027, where the underlying arm distributions are not constrained to any parametric, and hence, it is applicable for active clustering of real-world datasets. We adopt a kernel-based approach, which allows us to reformulate the nonparametric problem as the task of clustering the arms according to their kernel mean embeddings in a reproducing kernel Hilbert space (RKHS). Building on this formulation, we introduce the KABC algorithm with theoretical correctness guarantees and analyze its sampling budget. We introduce a notion of signal-to-noise ratio for this problem that depends on the maximum mean discrepancy (MMD) between the arm distributions and on their variance in the RKHS. Our algorithm is adaptive to this unknown quantity: it does not require it as an input yet achieves instance-dependent guarantees.",
"arxiv_id": "2601.07535",
"authors": [
"Victor Thuot",
"Sebastian Vogt",
"Debarghya Ghoshdastidar",
"Nicolas Verzelen"
],
"categories": [
"stat.ML",
"cs.LG"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Nonparametric Kernel Clustering with Bandit Feedback",
"url": "https://arxiv.org/abs/2601.07535",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "94377a14-51bf-4c7f-a0da-2b16891b3658",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}