AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Manifold structure in graph embeddings

Patrick Rubin-Delanchy

NeurIPS 2020 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 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
use random forest instead of least-squares on 100-dim spectral embeddingregression on spectral embedding · Graph regressionout-of-sample MSE: 1.63 -> 1.11Improved
use neural network instead of least-squaresregression on spectral embedding · Graph regressionout-of-sample MSE: 1.63 -> 1.25Improved
use Lasso instead of least-squaresregression on spectral embedding · Graph regressionout-of-sample MSE: 1.63 -> 1.58Improved
nonlinear manifold-exploiting regressors vs linear onesregression on spectral embedding · Graph regressionout-of-sample MSE: 1.11 vs 1.58Improved
t-SNE instead of direct spectral embedding into R^2 (linear reduction)spectral embedding visualisation · Los Alamos / Yelp graphsvisual structureImproved
UMAP instead of t-SNEspectral embedding visualisation · Los Alamos / Yelp graphsvisual structureNo clear effect
choose D-hat by profile-likelihood rank selection (6) instead of 10spectral embedding · Los Alamos network flowembedding dimension: 10 -> 6No clear effect

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