Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Loss
About
We propose Any2graph, a generic framework for end-to-end Supervised Graph Prediction (SGP) i.e. a deep learning model that predicts an entire graph for any kind of input. The framework is built on a novel Optimal Transport loss, the Partially-Masked Fused Gromov-Wasserstein, that exhibits all necessary properties (permutation invariance, differentiability and scalability) and is designed to handle any-sized graphs. Numerical experiments showcase the versatility of the approach that outperform existing competitors on a novel challenging synthetic dataset and a variety of real-world tasks such as map construction from satellite image (Sat2Graph) or molecule prediction from fingerprint (Fingerprint2Graph).
Paul Krzakala, Junjie Yang, R\'emi Flamary, Florence d'Alch\'e-Buc, Charlotte Laclau, Matthieu Labeau• 2024
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Supervised Graph Prediction | QM9 (test) | Edit Distance2.13 | 7 | |
| Supervised Graph Prediction | Coloring (test) | Edit Distance0.2 | 4 | |
| Supervised Graph Prediction | GDB13 (test) | Edit Distance3.63 | 4 | |
| Supervised Graph Prediction | Toulouse (test) | Edit Distance0.13 | 4 | |
| Graph-level Tasks | QM9 (test) | Inference Throughput (graphs/sec)10 | 4 | |
| Supervised Graph Prediction | USCities (test) | Edit Distance1.86 | 2 |
Showing 6 of 6 rows