This paper addresses the challenging problem of retrieval and matching of
graph structured objects, and makes two key contributions. First, we
demonstrate how Graph Neural Networks (GNN), which have emerged as an effective
model for various supervised prediction problems defined on structured data,
can be trained to produce embedding of graphs in vector spaces that enables
efficient similarity reasoning. Second, we propose a novel Graph Matching
Network model that, given a pair of graphs as input, computes a similarity
score between them by jointly reasoning on the pair through a new cross-graph
attention-based matching mechanism. We demonstrate the effectiveness of our
models on different domains including the challenging problem of
control-flow-graph based function similarity search that plays an important
role in the detection of vulnerabilities in software systems. The experimental
analysis demonstrates that our models are not only able to exploit structure in
the context of similarity learning but they can also outperform domain-specific
baseline systems that have been carefully hand-engineered for these problems.

本文提出了两个关键性贡献：首先是演示了图神经网络如何训练并嵌入向量空间，以便有效地进行相似性推理；其次是提出了一种新的图匹配网络模型，通过新的跨图注意力匹配机制，在一对图之间共同推理，计算它们之间的相似度得分。在不同领域的实验分析表明，本文提出的模型不仅能够在相似性学习的上下文中利用结构，而且能够优于针对此类问题精心设计的基线系统。