Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Loss
Paul Krzakala, Junjie Yang, Rémi Flamary, Florence d'Alché-Buc, Charlotte Laclau, Matthieu Labeau
Abstract
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).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 72846624-1685-4018-bc5f-b52ca2c73b0eCited by top-tier papers1
Ask how each one uses itBuilds on8
- On Layer Normalization in the Transformer ArchitectureRuibin Xiong, Yunchang Yang, Di He, Kai Zheng et al.ICML 2020 · 1,388 citations
- The Unbalanced Gromov Wasserstein Distance: Conic Formulation and RelaxationThibault Séjourné, François-Xavier Vialard, Gabriel PeyréNeurIPS 2021 · 106 citations
- Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and CostsMeyer Scetbon, Gabriel Peyré, Marco CuturiICML 2022 · 73 citations
- Aligning individual brains with fused unbalanced Gromov WassersteinAlexis Thual, Quang Huy Tran, Tatiana Zemskova, Nicolas Courty et al.NeurIPS 2022 · 61 citations
- Partial Optimal Tranport with applications on Positive-Unlabeled LearningLaetitia Chapel, Mokhtar Z. Alaya, Gilles GassoNeurIPS 2020 · 30 citations
Related papers
- Learning to Predict Graphs with Fused Gromov-Wasserstein BarycentersLuc Brogat-Motte, Rémi Flamary, Céline Brouard, Juho Rousu et al.ICML 2022 · 27 citations
- Template based Graph Neural Network with Optimal Transport DistancesCédric Vincent-Cuaz, Rémi Flamary, Marco Corneli, Titouan Vayer et al.NeurIPS 2022 · 35 citations
- Unsupervised Learning for Optimal Transport plan prediction between unbalanced graphsSonia Mazelet, Rémi Flamary, Bertrand ThirionNeurIPS 2025 · 5 citations
- Learning Combinatorial Embedding Networks for Deep Graph MatchingRunzhong Wang, Junchi Yan, Xiaokang YangICCV 2019 · 268 citations
- Learning Adaptive Neighborhoods for Graph Neural NetworksAvishkar Saha, Oscar Mendez, Chris Russell, Richard BowdenICCV 2023 · 12 citations
