Kissing to Find a Match: Efficient Low-Rank Permutation Representation

by   Hannah Dröge, et al.

Permutation matrices play a key role in matching and assignment problems across the fields, especially in computer vision and robotics. However, memory for explicitly representing permutation matrices grows quadratically with the size of the problem, prohibiting large problem instances. In this work, we propose to tackle the curse of dimensionality of large permutation matrices by approximating them using low-rank matrix factorization, followed by a nonlinearity. To this end, we rely on the Kissing number theory to infer the minimal rank required for representing a permutation matrix of a given size, which is significantly smaller than the problem size. This leads to a drastic reduction in computation and memory costs, e.g., up to 3 orders of magnitude less memory for a problem of size n=20000, represented using 8.4×10^5 elements in two small matrices instead of using a single huge matrix with 4× 10^8 elements. The proposed representation allows for accurate representations of large permutation matrices, which in turn enables handling large problems that would have been infeasible otherwise. We demonstrate the applicability and merits of the proposed approach through a series of experiments on a range of problems that involve predicting permutation matrices, from linear and quadratic assignment to shape matching problems.


page 1

page 2

page 3

page 4


Compact Factorization of Matrices Using Generalized Round-Rank

Matrix factorization is a well-studied task in machine learning for comp...

Low Permutation-rank Matrices: Structural Properties and Noisy Completion

We consider the problem of noisy matrix completion, in which the goal is...

Kernelized multi-graph matching

Multigraph matching is a recent variant of the graph matching problem. I...

From graphs to DAGs: a low-complexity model and a scalable algorithm

Learning directed acyclic graphs (DAGs) is long known a critical challen...

DeepPermNet: Visual Permutation Learning

We present a principled approach to uncover the structure of visual data...

Gaussianity and typicality in matrix distributional semantics

Constructions in type-driven compositional distributional semantics asso...

Please sign up or login with your details

Forgot password? Click here to reset