AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Sublinear Algorithms for Hierarchical Clustering

Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil

NeurIPS 2022 · Learning theory and algorithms › Clustering · approach: Correlation clustering · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
Replace the input graph with an (epsilon,delta)-cut sparsifierHierarchical clustering under Dasgupta's objective · Weighted graphshierarchical clustering cost: (1+4epsilon)phi; additive n(n+1)delta phiImproved
Embed a constant-degree expander with edge weights delta before effective-resistance sparsification(epsilon,delta)-cut sparsifier construction · Query model, unweighted graphsconstruction time and queries: \widetilde{O}(n \delta^{-1}\epsilon^{-2})Improved
Use cut sparsification in the dynamic streamHierarchical clustering · Dynamic streaming, weighted graphsspace: \widetilde{O}(\epsilon^{-2}n)Improved
Build per-vertex linear sketches in two rounds, then cluster their cut sparsifierHierarchical clustering · MPC, weighted graphsrounds: 2 rounds; \widetilde{O}(n) memoryImproved
Use sketches for sparser inputs and random edge subsampling for denser inputsHierarchical clustering · MPC, unweighted graphsrounds: 1 round; \widetilde{O}(n^{4/3}) memoryImproved

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