Kissing to Find a Match: Efficient Low-Rank Permutation Representation - Supplementary Material Zorah Lähner University of Siegen

Onofre Martorell Princeton University University of the Balearic Islands Princeton, NJ 08544, United States Investigador ForInDoc del Govern de les Illes Balears yuval.bahat@gmail.com Our supplementary material includes a figure demonstrating the ability of our method to handle large matching problems and a graph showing the influence of the permutation matrix sparsity on the computation speed, as well as accuracy values on the experiments on point cloud assignment. As our method requires devising problem-specific adaptations, the supplementary material also includes a discussion on potential adaptations to our method. Further, it gives a short note on the non-linearity (ReLU) in our approach. Following our shape-matching experiments described in Sec.