2025
Clustering Items through Bandit Feedback: Finding the Right Feature out of Many
ICML 2025poster
We study the problem of clustering a set of items based on bandit feedback. Each of the $n$ items is characterized by a feature vector, with a possibly large dimension $d$. The items are partitioned into two unknown groups, such that items within the same group share the same feature vector. We con…