atlas

Research map / Graph learning / Graph algorithms and clustering

Featured Graph Coarsening with Similarity Guarantees

ICML 2023 · Graph learning › Graph algorithms and clustering · approach: Graph distance and retrieval

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
Joint learning of coarsened graph and features (FGC) with sparsity regularizer vs. SCAL/GCONDFGC · Node classification, Cora r=0.3accuracy: 85.79 vs 81.56 (GCOND) and 79.42 (SCAL)Helped
Replacing GCN with GAT/APPNP as downstream GNN on FGC coarsened graphs (ablation)FGC · Node classification, Cora/Citeseer/Co-phy/Pubmedaccuracy: similar accuracy across GCN, GAT, APPNPNo clear effect
Feature-aware coarsening (FGC) vs. structure-only coarsening (LVN/LVE) on spectral and REE metricsFGC · Cora r=0.3, REEREE: 0.04 vs 0.65/0.71Helped

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