arXiv Machine Learning
Jun 2

Chaining 2-FWL GNNs for Combinatorial Graph Alignment

arXiv:2510. 03086v2 Announce Type: replace Abstract: For the combinatorial graph alignment problem (GAP) -- finding the node correspondence that maximizes the number of common edges (nce) between two unlabeled graphs -- properly initialized FAQ remains a strong classical baseline, while existing GNN approaches struggle in the purely structural setting.

By Marc Lelarge
arXiv Statistics ML
Oct 1

A Unified Dual Method for Matching Problems

arXiv:2609.39339v1 Announce Type: cross Abstract: Matching problems are ubiquitous in data science as they enable the alignment of structured objects and distributions. While existing solvers are oft...

By Guillaume Houry (HeKA | U1346), Ferdinand Genans (SU, LPSM), Jean Feydy (HeKA | U1346), Fran\c{c}ois-Xavier Vialard (LIGM)