atlas

Research map / Graph learning / Graph algorithms and clustering

Improved Dynamic Graph Learning through Fault-Tolerant Sparsification

ICML 2019 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 1 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
replace from-scratch spectral sparsification at each time point with fault-tolerant (FT) sparsification maintained by constant-cost per-update insertions/deletionsdynamic graph Laplacian-regularized estimation and SSL · Facebook ego-combined dynamic graphaverage update time: 34.2 s to 0.3 ms (speedup > 10^5)Helped
use FT spectral sparsifier instead of from-scratch sparsifier for dynamic updatesLaplacian-regularized estimation and graph SSL · Facebook ego-combined, sigma 0.1 and 0.01estimation/SSL errorNo clear effect
FT sparsification keeps a somewhat larger edge count than from-scratch sparsificationspectral sparsifier size · Facebook ego-combined# edges: 16502 vs 12978 edges (about 27% more)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