atlas

Research map / Bandits and online learning / Multi-armed bandits

Optimal Clustering with Noisy Queries via Multi-Armed Bandit

ICML 2022 · Bandits and online learning › Multi-armed bandits · approach: Bandit formulations for ML problems · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use multi-armed bandit best-arm identification to identify each vertex's cluster instead of querying a fixed number of representatives from every clusterNoisy clustering · Noisy clustering, nearly balanced instancesquery complexity: O(\frac{nk\log n}{\delta^2}) -> O(\frac{n(k+\log n)}{\delta^2})Helped
Use multi-armed bandit identification with iterative filtering and cluster mergingNoisyClustering · Noisy clustering, general instancesquery complexity: O(\frac{nk\log n}{\delta^2}+\frac{k^{10}\log^2 n}{\delta^4}) -> O(\frac{n(k+\log n)}{\delta^2}+\frac{k^{8}\log^3 n}{\delHelped
Apply a best-arm-identification reduction to establish a new information-theoretic lower boundNoisy clustering · Noisy clustering, k≥2expected query complexity lower bound: \Omega(\frac{nk}{\delta^2}) and \Omega(\frac{n\log n}{\delta^2})Mixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy