Fetching the paper…
Reading the bibliography…
Comparing two probability measures supported on heterogeneous spaces is an increasingly important problem in machine learning.
On random graphs I
Paul Erdős and Alfréd Rényi · 1959
Earlier work this paper cites.
Organization and maintenance of large ordered indices
Rudolf Bayer and Edward M. McCreight · 1972
Earlier work this paper cites.
Geometric intersection problems
Michael Ian Shamos and Dan Hoey · 1976
Earlier work this paper cites.
A sweepline algorithm for voronoi diagrams
Steven Fortune · 1987
Earlier work this paper cites.
A new data structure for cumulative frequency tables
Peter M. Fenwick · 1994
Earlier work this paper cites.
The anatomy of a large-scale hypertextual web search engine
Sergey Brin and Lawrence Page · 1998
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner · 1998
Earlier work this paper cites.
Emergence of scaling in random networks
Albert-Laszlo Barabasi and Reka Albert · 1999
Earlier work this paper cites.
Authoritative sources in a hyperlinked environment
Jon M. Kleinberg · 1999
Earlier work this paper cites.
Shape distributions
Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, and David P. Dobkin · 2002
Earlier work this paper cites.
Geodesic object representation and recognition
A. Ben Hamza and Hamid Krim · 2003
Earlier work this paper cites.
On reconstructing n -point configurations from the distribution of distances or areas
Mireille Boutin and Gregor Kemper · 2004
Earlier work this paper cites.
Brenda, the enzyme database: updates and major new developments
Ida Schomburg, Antje Chang, Christian Ebeling, Marion Gremse, Christian Heldt, Gregor Huhn, and Dietmar Schomburg · 2004
Earlier work this paper cites.
Protein function prediction via graph kernels
Karsten M Borgwardt, Cheng Soon Ong, Stefan Schönauer, SVN Vishwanathan, Alex J Smola, and Hans-Peter Kriegel · 2005
Earlier work this paper cites.
Robust global registration
Natasha Gelfand, Niloy J. Mitra, Leonidas J. Guibas, and Helmut Pottmann · 2005
Earlier work this paper cites.
Efficient computation of isometry-invariant distances between surfaces
Alexander M. Bronstein, Michael M. Bronstein, and Ron Kimmel · 2006
Earlier work this paper cites.
Integral invariants for shape matching
Siddharth Manay, Daniel Cremers, Byung-Woo Hong, Anthony J. Yezzi, and Stefano Soatto · 2006
Earlier work this paper cites.
On the use of gromov-hausdorff distances for shape comparison
Facundo Mémoli · 2007
Earlier work this paper cites.
Local histogram based segmentation using the wasserstein distance
Kangyu Ni, Xavier Bresson, Tony F. Chan, and Selim Esedoglu · 2009
Cited alongside, same era.
Shrec’10 track: Robust shape retrieval
Alexander M. Bronstein, Michael M. Bronstein, Umberto Castellani, Bianca Falcidieno, Andrea Fusiello, Afzal Godil, Leonidas J. Guibas, Iasonas Kokkinos, Zhouhui Lian, Maks Ovsjanikov, Giuseppe Patanè, Michela Spagnuolo, and Roberto Toldo · 2010
Cited alongside, same era.
Gromov–Wasserstein distances and the metric approach to object matching
Facundo Mémoli · 2011
Cited alongside, same era.
Wasserstein barycenter and its application to texture mixing
Julien Rabin, Gabriel Peyré, Julie Delon, and Marc Bernot · 2011
Cited alongside, same era.
Blue noise through optimal transport
Fernando De Goes, Katherine Breeden, Victor Ostromoukhov, and Mathieu Desbrun · 2012
Cited alongside, same era.
The space of spaces: curvature bounds and gradient flows on the space of metric measure spaces
Gromov-wasserstein alignment of word embedding spaces
David Alvarez-Melis and Tommi S. Jaakkola · 2018
Later among the works it cites.
Learning generative models with sinkhorn divergences
Aude Genevay, Gabriel Peyré, and Marco Cuturi · 2018
Later among the works it cites.
Networks
Mark Newman · 2018
Later among the works it cites.
Improving GANs using optimal transport
Tim Salimans, Han Zhang, Alec Radford, and Dimitris Metaxas · 2018
Later among the works it cites.
Wasserstein dictionary learning: Optimal transport-based unsupervised nonlinear dictionary learning
Morgan A Schmitz, Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck · 2018
Later among the works it cites.
Graphrnn: Generating realistic graphs with deep auto-regressive models
Jiaxuan You, Rex Ying, Xiang Ren, William L. Hamilton, and Jure Leskovec · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Karl-Theodor Sturm · 2012
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Cited alongside, same era.
Equivalence of distance-based and rkhs-based statistics in hypothesis testing
Dino Sejdinovic, Bharath Sriperumbudur, Arthur Gretton, Kenji Fukumizu, et al · 2013
Cited alongside, same era.
Energy statistics: A class of statistics based on distances
Gábor J Székely and Maria L Rizzo · 2013
Cited alongside, same era.
On convex relaxation of graph isomorphism
Yonathan Aflalo, Alexander Bronstein, and Ron Kimmel · 2015
Cited alongside, same era.
Tight relaxation of quadratic matching
Itay Kezurer, Shahar Z. Kovalsky, Ronen Basri, and Yaron Lipman · 2015
Cited alongside, same era.
From word embeddings to document distances
Matt Kusner, Yu Sun, Nicholas Kolkin, and Kilian Weinberger · 2015
Cited alongside, same era.
Learning generative models across incomparable spaces
Charlotte Bunne, David Alvarez-Melis, Andreas Krause, and Stefanie Jegelka · 2019
Later among the works it cites.
Wasserstein of wasserstein loss for learning generative models
Yonatan Dukler, Wuchen Li, Alex Tong Lin, and Guido Montúfar · 2019
Later among the works it cites.
Unsupervised alignment of embeddings with wasserstein procrustes
Edouard Grave, Armand Joulin, and Quentin Berthet · 2019
Later among the works it cites.
GOT: an optimal transport framework for graph comparison
Hermina Petric Maretic, Mireille El Gheche, Giovanni Chierchia, and Pascal Frossard · 2019
Later among the works it cites.
Pytorch: An imperative style, high-performance deep learning library
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Köpf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala · 2019
Later among the works it cites.
Optimal-transport analysis of single-cell gene expression identifies developmental trajectories in reprogramming
Geoffrey Schiebinger, Jian Shu, Marcin Tabaka, Brian Cleary, Vidya Subramanian, Aryeh Solomon, Joshua Gould, Siyan Liu, Stacie Lin, Peter Berube, et al · 2019
Later among the works it cites.
Sliced gromov-wasserstein
Titouan Vayer, Rémi Flamary, Romain Tavenard, Laetitia Chapel, and Nicolas Courty · 2019
Later among the works it cites.
Scalable gromov-wasserstein learning for graph partitioning and matching
Hongteng Xu, Dixin Luo, and Lawrence Carin · 2019
Later among the works it cites.
Hierarchical optimal transport for document representation
Mikhail Yurochkin, Sebastian Claici, Edward Chien, Farzaneh Mirzazadeh, and Justin M. Solomon · 2019
Later among the works it cites.
Multi-subject meg/eeg source imaging with sparse multi-task regression
Hicham Janati, Thomas Bazeille, Bertrand Thirion, Marco Cuturi, and Alexandre Gramfort · 2020
Closest in time.
Predicting cell lineages using autoencoders and optimal transport
Karren Dai Yang, Karthik Damodaran, Saradha Venkatachalapathy, Ali C Soylemezoglu, GV Shivashankar, and Caroline Uhler · 2020
Closest in time.