Unseeded low-rank graph matching by transform-based unsupervised point registration

TL;DR

This paper introduces a novel, efficient, and theoretically guaranteed method for unseeded low-rank graph matching by aligning distributions through Laplace transform discrepancies, avoiding complex correspondence optimization.

Contribution

The paper proposes a new distribution-matching approach for low-rank graph matching that offers consistency guarantees and reduced computational complexity compared to traditional methods.

Findings

Method achieves consistency guarantees.

Reduces optimization complexity from Ω(n^2) to O(d^2).

Demonstrates effectiveness through numerical examples.

Abstract

The problem of learning a correspondence relationship between nodes of two networks has drawn much attention of the computer science community and recently that of statisticians. The unseeded version of this problem, in which we do not know any part of the true correspondence, is a long-standing challenge. For low-rank networks, the problem can be translated into an unsupervised point registration problem, in which two point sets generated from the same distribution are matchable by an unknown orthonormal transformation. Conventional methods generally lack consistency guarantee and are usually computationally costly. In this paper, we propose a novel approach to this problem. Instead of simultaneously estimating the unknown correspondence and orthonormal transformation to match up the two point sets, we match their distributions via minimizing our designed loss function capturing the discrepancy between their Laplace transforms, thus avoiding the optimization over all possible correspondences. This dramatically reduces the dimension of the optimization problem from $\Omega(n^2)$ parameters to $O(d^2)$ parameters, where $d$ is the fixed rank, and enables convenient theoretical analysis. In this paper, we provide arguably the first consistency guarantee and explicit error rate for general low-rank models. Our method provides control over the computational complexity ranging from $\omega(n)$ (any growth rate faster than $n$) to $O(n^2)$ while pertaining consistency. We demonstrate the effectiveness of our method through several numerical examples.