AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Seeded Graph Matching for the Correlated Gaussian Wigner Model via the Projected Power Method

Ernesto Araya, Guillaume Braun, Hemant Tyagi

JMLR 2024 · Graph learning › Graph algorithms and clustering · approach: Optimization algorithms for graph matching · 5 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
add PPMGM refinement on top of Grampa and Umeyama seedless outputsGrampa, Umeyama · CGW synthetic graphs, n=800recovery fractionImproved
add PPMGM refinement on SHREC'16 shape matchingGrampa · SHREC'16 low-resolutionpercentage of nodes correctly matched: less than 15% -> more than 50%Improved
add PPMGM refinement to QPADMMQPADMM · CGW synthetic graphsrecovery fractionImproved
increase PPMGM iterations N from 1 to 30 (ablation)PPMGM · CGW synthetic graphs, n=500recovery rateMixed
increase matrix size from n=500 to n=1000 with multiple iterations (ablation)PPMGM · CGW synthetic graphsrecovery rate gain from N>1No clear effect
use sparsified inputs instead of full weighted matrices (ablation)PPMGM · CGW synthetic graphs, high noise, low seed overlaprecovery rateHurt
use a better seed (higher initial overlap) (ablation)PPMGM · CGW synthetic graphs, n=800recovery and varianceImproved

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