atlas

Research map / Learning theory and algorithms / Clustering

Spectrally Approximating Large Graphs with Smaller Graphs

ICML 2018 · Learning theory and algorithms › Clustering · approach: Spectral clustering algorithms · 7 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
Coarsen the graph by randomized edge contraction with a heavy-edge potentialGraph Laplacian · General graphs satisfying the stated eigenvalue conditionprincipal eigenvalue approximationHelped
Use lifted coarse eigenvectors without refinementSpectral clustering · Bounded-degree graphs with a sufficiently large cluster eigengapk-means objective errorHelped
Use heavy-edge contraction on graphs with small degree variationREC · Graph spectral approximationRSS constantsHelped
Increase the dimensionality reduction ratioREC · Graph spectral approximationRSS constantsHurt
Apply a few local power-iteration smoothing steps after liftingCoarsened spectral clustering · MNIST digits 0–4, 12-nearest-neighbor graphrelative k-means errorHelped
Use coarsening on eigenspaces without a sufficiently large eigenvalue gapLifted principal eigenspaces · Stochastic block model graphseigenspace alignmentHurt

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