Learning Universe Model for Partial Matching Networks over Multiple Graphs
Zetian Jiang, Jiaxin Lu, Tianzhe Wang, Junchi Yan

TL;DR
This paper introduces a novel universe matching framework for partial graph matching that effectively handles inliers and outliers, enabling end-to-end learning for various graph matching scenarios including online and multi-graph matching.
Contribution
It proposes the first deep learning model capable of handling two-graph, multiple-graph, online, and mixture graph matching simultaneously using a universe matching perspective.
Findings
Achieves state-of-the-art performance in partial graph matching tasks.
Effectively models inlier and outlier detection within a unified framework.
Handles new graphs from different categories seamlessly.
Abstract
We consider the general setting for partial matching of two or multiple graphs, in the sense that not necessarily all the nodes in one graph can find their correspondences in another graph and vice versa. We take a universe matching perspective to this ubiquitous problem, whereby each node is either matched into an anchor in a virtual universe graph or regarded as an outlier. Such a universe matching scheme enjoys a few important merits, which have not been adopted in existing learning-based graph matching (GM) literature. First, the subtle logic for inlier matching and outlier detection can be clearly modeled, which is otherwise less convenient to handle in the pairwise matching scheme. Second, it enables end-to-end learning especially for universe level affinity metric learning for inliers matching, and loss design for gathering outliers together. Third, the resulting matching model…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks
