[17] Jonathan Huang, Carlos Guestrin, and Leonidas Guibas. Fourier theoretic probabilistic inference over permutations. Journal of machine learning research, 10(5), 2009.
[18] Itay Kezurer, Shahar Z Kovalsky, Ronen Basri, and Yaron Lipman. Tight relaxation of quadratic matching. 34(5), 2015.
[19] Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In Yoshua Bengio and Yann LeCun, editors, 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings, 2015.
[20] Risi Kondor, Andrew Howard, and Tony Jebara. Multi-object tracking with representations of the symmetric group. In Marina Meila and Xiaotong Shen, editors, Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, volume 2 of Proceedings of Machine Learning Research, pages 211-218, San Juan, Puerto Rico, 21-24 Mar 2007. PMLR.
[21] Tjalling C. Koopmans and Martin Beckmann. Assignment problems and the location of economic activities. *Econometrica*, 25(1), 1957.
[22] Harold W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2, 1955.
[23] Or Litany, Tal Remez, Emanuele Rodola, Alex Bronstein, and Michael Bronstein. Deep functional maps: Structured prediction for dense shape correspondence. In Proc. of International Conference on Computer Vision (ICCV), 2017.
[24] E. M. Loiola, N. M. de Abreu, P. O. B. Netto, P. Hahn, and T. M. Querido. A survey for the quadratic assignment problem. European Journal of Operational Research, 176(2), 2007.
[25] Riccardo Marin. Correspondence learning via linearly-invariant embedding (pytorch). https://github.com/riccardomarin/Diff-FMAPs-PyTorch, 2022.
[26] Riccardo Marin, Marie-Julie Rakotosaona, Simone Melzi, and Maks Ovsjanikov. Correspondence learning via linearly-invariant embedding. Advances in Neural Information Processing Systems, 33:1608-1620, 2020.
[27] Haggai Maron, Nadav Dym, Itay Kezurer, Shahar Kovalsky, and Yaron Lipman. Point registration via efficient convex relaxation. ACM Transactions on Graphics (TOG), 35(4):73, 2016.
[28] Gonzalo Mena, David Belanger, Scott Linderman, and Jasper Snoek. Learning latent permutations with gumbel-sinkhorn networks. arXiv preprint arXiv:1802.08665, 2018.
[29] Oleg R Musin. The kissing number in four dimensions. Annals of Mathematics, pages 1-32, 2008.
[30] Maks Ovsjanikov, Mirela Ben-Chen, Justin Solomon, Adrian Butscher, and Leonidas Guibas. Functional maps: a flexible representation of maps between shapes. ACM Transactions on Graphics (ToG), 31(4):1-11, 2012.
[31] C. Papazov and D. Burschka. Deformable 3d shape registration based on local similarity transforms. In Proc. of Symposium on Geometry Processing (SGP), 2011.
[32] Ulrich Pinkall and Konrad Polthier. Computing discrete minimal surfaces and their conjugates. Experimental Mathematics, 2(1):15 - 36, 1993.
[33] Sergey M Plis, Stephen McCracken, Terran Lane, and Vince D Calhoun. Directional statistics on permutations. In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, pages 600-608. JMLR Workshop and Conference Proceedings, 2011.
[34] Ryan Prescott Adams and Richard S Zemel. Ranking via sinkhorn propagation. arXiv e-prints, pages arXiv-1106, 2011.