arXiv Machine Learning
Sharp Statistical Thresholds for Attributed Gaussian Graph Matching
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Statistics ML
Oct 22
Covariate-assisted graph matching
arXiv:2512.11761v2 Announce Type: replace-cross Abstract: Data integration often requires aligning datasets without unique identifiers; for network data this is commonly addressed through graph match...
arXiv Machine Learning
Sep 15
Graph Matching Relaxations and Amortization for Supervised Graph Prediction
arXiv:2609.15437v1 Announce Type: cross Abstract: End-to-end Supervised Graph Prediction (SGP) requires a permutation-invariant loss to compare predicted and target graphs with arbitrary node orderin...
arXiv Machine Learning
Jun 19
Prior-Informed Flow Matching for Graph Reconstruction
arXiv:2601. 22107v2 Announce Type: replace Abstract: We introduce \textit{Prior-Informed Flow Matching (PIFM)}, a conditional flow model for graph reconstruction.
arXiv AI
Jun 30
Confidence-feedback-weighted graph matching network: online-offline laser-induced damage site matching under complex interference
arXiv:2606. 29255v1 Announce Type: cross Abstract: Online inspection images of final optics in high-power laser facilities contain pseudo-damage sites that closely resemble true damage sites.
arXiv AI
Jul 9
Diffusion enabled Optimal Transport distances for graph matching
arXiv:2607. 06646v1 Announce Type: cross Abstract: This paper introduces Diffusion Semi-Relaxed Fused Gromov-Wasserstein (DsrFGW), a novel method for graph comparison that unifies node features and structural connectivity through optimal transport.
arXiv Machine Learning
Aug 26
Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)
arXiv:2506.02825v3 Announce Type: replace-cross Abstract: We present the OmniMatch algorithm for seeded multiple graph matching. In the setting of $d$-dimensional Random Dot Product Graphs (RDPG), we...