atlas

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

BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits

NeurIPS 2020 · Bandits and online learning › Multi-armed bandits · approach: Bandit formulations for ML problems · 9 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 adaptive bandit sampling instead of exact PAM searchPAM BUILD and SWAP searches · Large real-world datasetsdistance computations: up to 200x fewer distance computationsHelped
Use BanditPAM instead of the FastPAM1 implementationk-medoids clustering · MNIST, n = 70,000runtime: 4x fasterHelped
Use BanditPAM rather than PAMk-medoids clustering · MNIST subsamples, l2, k=5clustering loss ratio to PAM: 1No clear effect
Re-estimate arm-dependent sigma values at each BUILD or SWAP search (ablation)BanditPAM · MNIST BUILD stepscomputational performanceHelped
Apply BanditPAM under the scRNA-PCA projection, where arm means are concentrated and rewards have heavier tailsBanditPAM · scRNA-PCA, l2distance-calls-per-iteration scaling: 1.204Hurt

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