Revisiting the Generalization of Neural Graph Edit Distance Models

arXiv:2610.04644v1 Announce Type: new Abstract: 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.

Related

• Gradient Descent as Implicit EM in Distance-Based Neural Models
• Beyond the Laplacian: Doubly Stochastic Matrices for Graph Neural Networks
• On the Rademacher Complexity of Graph Neural Networks: Unifying Expressivity and Geometry

Source: arXiv cs.LG | 2026-10-06