Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Loss
Not on the map. Why?
Abstract (arXiv)
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).
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 30 of its 56 references that are in the map. First posted on arXiv 19 Feb 2024.
Builds on
30 of 56 references.
References · 30
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020End-to-End Object Detection with Transformerscited by 7,384
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Deep Setscited by 1,394
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
- 2020On Layer Normalization in the Transformer Architecturecited by 906
- 2019Diffusion Improves Graph Learningcited by 414
- 2018MolGAN: An implicit generative model for small molecular graphscited by 392
- 2018GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoderscited by 375
- 2016Deep Biaffine Attention for Neural Dependency Parsingcited by 334
18 more
- 2018Optimal Transport for structured data with application on graphscited by 170
- 2021A Comprehensive Survey of Scene Graphs: Generation and Applicationcited by 125
- 2022Panoptic Scene Graph Generationcited by 114
- 2021Energy-Based Learning for Scene Graph Generationcited by 104
- 2018Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical propertiescited by 93
- 2022Relationformer: A Unified Framework for Image-to-Graph Generationcited by 67
- 2021Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costscited by 61
- 2020The Unbalanced Gromov Wasserstein Distance: Conic Formulation and Relaxationcited by 55
- 2015Randomized sketches for kernels: Fast and optimal non-parametric regressioncited by 31
- 2019A Two-Step Graph Convolutional Decoder for Molecule Generationcited by 25
- 2022Aligning individual brains with Fused Unbalanced Gromov-Wassersteincited by 23
- 2022Learning to Predict Graphs with Fused Gromov-Wasserstein Barycenterscited by 22
- 2019Image-Conditioned Graph Generation for Road Network Extractioncited by 17
- 2021Non-Autoregressive Semantic Parsing for Compositional Task-Oriented Dialogcited by 17
- 2022Knowledge Graph Generation From Textcited by 15
- 2023Unbalanced Optimal Transport: A Unified Framework for Object Detectioncited by 14
- 2022Fast Kernel Methods for Generic Lipschitz Losses via p-Sparsified Sketchescited by 5
- 2014Graph matching: relax or not?cited by 1
Built on by
Citing papers per year: 2025: 2; 2026: 5.
7 papers.
- 2025The quest for the GRAph Level autoEncoder (GRALE)cited by 8
- 2026Conformal Graph Prediction with Z-Gromov-Wasserstein Distancescited by 2
- 2025Synthetic Data for Blood Vessel Network Extractioncited by 1
- 2026GraViti: Graph-Level Variational Autoencoders with Relaxed Permutation Invariancecited by 1
- 2026Building Deep Graph Predictors with Graph Imitation Learningcited by 0
- 2026LineGraph2Road: Structural Graph Reasoning on Line Graphs for Road Network Extractioncited by 0
- 2026Graph Matching Relaxations and Amortization for Supervised Graph Predictioncited by 0
- 2026Graph Matching Relaxations and Amortization for Supervised Graph Prediction14 Sep 2026
- 2026GraViti: Graph-Level Variational Autoencoders with Relaxed Permutation Invariance15 May 2026
- 2026Conformal Graph Prediction with Z-Gromov-Wasserstein Distances2 Mar 2026
- 2026LineGraph2Road: Structural Graph Reasoning on Line Graphs for Road Network Extraction26 Feb 2026
- 2026Building Deep Graph Predictors with Graph Imitation Learning21 Jan 2026
- 2025The quest for the GRAph Level autoEncoder (GRALE)28 May 2025
- 2025Synthetic Data for Blood Vessel Network Extraction16 Apr 2025