mlsanityData to 14 Oct 2026

Revisiting the Generalization of Neural Graph Edit Distance Models

arXiv 2610.04644 ↗First posted 3 Oct 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Neural approaches to Graph Edit Distance (GED) have achieved strong results under standard within-dataset evaluation, but much less is known about how well these models transfer across graph collections. We conduct a systematic study of this problem using exact GED supervision across diverse graph datasets and a broad set of representative learning-based methods. Our results reveal a pronounced gap between within-collection performance and cross-collection transfer. Models that perform well on their training collections often lose this advantage when evaluated on structurally different data. Training on multiple source collections substantially improves zero-shot transfer and provides a better starting point when limited supervision is available for a new target collection. Further analysis shows that transfer behavior varies with the source--target direction and the structural characteristics of the collections involved. These findings suggest that conventional within-collection evaluation provides only a partial view of the generalization behavior of neural GED models and motivate broader evaluation across heterogeneous graph collections.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 32 references that are in the map. First posted on arXiv 3 Oct 2026.

Builds on

20 of 32 references.

References · 20

  1. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  2. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 728
  3. 2019Graph Matching Networks for Learning the Similarity of Graph Structured Objectscited by 205
  4. 2018SimGNN: A Neural Network Approach to Fast Graph Similarity Computationcited by 90
  5. 2018Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matchingcited by 46
  6. 2021GREED: A Neural Framework for Learning Graph Distance Functionscited by 32
  7. 2024Efficient Graph Similarity Computation with Alignment Regularizationcited by 26
  8. 2020Combinatorial Learning of Graph Edit Distance via Dynamic Embeddingcited by 25
  9. 2023When to Pre-Train Graph Neural Networks? From Data Generation Perspective!cited by 18
  10. 2021Hierarchical Adaptive Pooling by Capturing High-order Dependency for Graph Representation Learningcited by 15
  11. 2024Graph Edit Distance with General Costs Using Neural Set Divergencecited by 11
  12. 2023MATA*: Combining Learnable Node Matching with A* Algorithm for Approximate Graph Edit Distance Computationcited by 10
8 more
  1. 2025GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Codecited by 9
  2. 2024Computing Approximate Graph Edit Distance via Optimal Transportcited by 6
  3. 2024GraSP: Simple yet Effective Graph Similarity Predictionscited by 5
  4. 2025GraphBridge: Towards Arbitrary Transfer Learning in GNNscited by 4
  5. 2025Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GANcited by 3
  6. 2025Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidancecited by 1
  7. 2025Graph2Region: Efficient Graph Similarity Learning with Structure and Scale Restorationcited by 1
  8. 2025Hierarchy-Aware Neural Subgraph Matching with Enhanced Similarity Measurecited by 1

Built on by

Not cited yet.