Fetching the paper…
Reading the bibliography…
Comparing metric measure spaces (i.e.
Iterative procedures for nonlinear integral equations
Donald G Anderson · 1965
Earlier work this paper cites.
Maximization of a convex quadratic function under linear constraints
Hiroshi Konno · 1976
Earlier work this paper cites.
A graduated assignment algorithm for graph matching
Steven Gold and Anand Rangarajan · 1996
Earlier work this paper cites.
Softmax to softassign: Neural network algorithms for combinatorial optimization
Steven Gold, Anand Rangarajan, et al · 1996
Earlier work this paper cites.
The quadratic assignment problem
Rainer E Burkard, Eranda Cela, Panos M Pardalos, and Leonidas S Pitsoulis · 1998
Earlier work this paper cites.
A course in metric geometry , volume 33
Dmitri Burago, Iu D Burago, Yuri Burago, Sergei A Ivanov, and Sergei Ivanov · 2001
Earlier work this paper cites.
Convergence of a block coordinate descent method for nondifferentiable minimization
Paul Tseng · 2001
Earlier work this paper cites.
Topics in C. Transportation
Cedric Villani · 2003
Earlier work this paper cites.
Generalized multidimensional scaling: a framework for isometry-invariant partial surface matching
Alexander M Bronstein, Michael M Bronstein, and Ron Kimmel · 2006
Earlier work this paper cites.
On the geometry of metric measure spaces
Karl-Theodor Sturm et al · 2006
Earlier work this paper cites.
Caltech-256 object category dataset
Gregory Griffin, Alex Holub, and Pietro Perona · 2007
Earlier work this paper cites.
The optimal partial transport problem
Alessio Figalli · 2010
Earlier work this paper cites.
Adapting visual category models to new domains
Kate Saenko, Brian Kulis, Mario Fritz, and Trevor Darrell · 2010
Earlier work this paper cites.
Gromov–wasserstein distances and the metric approach to object matching
Facundo Mémoli · 2011
Earlier work this paper cites.
The space of spaces: curvature bounds and gradient flows on the space of metric measure spaces
Karl-Theodor Sturm · 2012
Earlier work this paper cites.
A game-theoretic approach to deformable shape matching
Emanuele Rodola, Alex M Bronstein, Andrea Albarelli, Filippo Bergamasco, and Andrea Torsello · 2012
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Earlier work this paper cites.
Domain adaptation with regularized optimal transport
Nicolas Courty, Rémi Flamary, and Devis Tuia · 2014
Earlier work this paper cites.
Decaf: A deep convolutional activation feature for generic visual recognition
Jeff Donahue, Yangqing Jia, Oriol Vinyals, Judy Hoffman, Ning Zhang, Eric Tzeng, and Trevor Darrell · 2014
Earlier work this paper cites.
Analysis of learning from positive and unlabeled data
Marthinus C Du Plessis, Gang Niu, and Masashi Sugiyama · 2014
Cited alongside, same era.
Optimal entropy-transport problems and a new hellinger–kantorovich distance between positive measures
Matthias Liero, Alexander Mielke, and Giuseppe Savaré · 2015
Cited alongside, same era.
Learning with a Wasserstein loss
Charlie Frogner, Chiyuan Zhang, Hossein Mobahi, Mauricio Araya, and Tomaso A Poggio · 2015
Cited alongside, same era.
Geodesic exponential kernels: When curvature and linearity conflict
Aasa Feragen, Francois Lauze, and Soren Hauberg · 2015
Cited alongside, same era.
Harmonic analysis on semigroups: theory of positive definite and related functions , volume 100
Christian Berg, Jens Peter Reus Christensen, and Paul Ressel · 2015
Cited alongside, same era.
Gromov-wasserstein averaging of kernel and distance matrices
Massively scalable Sinkhorn distances via the nystr \ \backslash " om method
Jason Altschuler, Francis Bach, Alessandro Rudi, and Jonathan Weed · 2018
Later among the works it cites.
Learning from positive and unlabeled data with a selection bias
Masahiro Kato, Takeshi Teshima, and Junya Honda · 2018
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.
Unsupervised alignment of embeddings with wasserstein procrustes
Edouard Grave, Armand Joulin, and Quentin Berthet · 2019
Later among the works it cites.
Parallel unbalanced optimal transport regularization for large scale imaging problems
John Lee, Nicholas P Bertrand, and Christopher J Rozell · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gabriel Peyré, Marco Cuturi, and Justin Solomon · 2016
Cited alongside, same era.
Shrec’16: Partial matching of deformable shapes
Luca Cosmo, Emanuele Rodolà, Michael M Bronstein, Andrea Torsello, Daniel Cremers, and Y Sahillioglu · 2016
Cited alongside, same era.
Entropic metric alignment for correspondence problems
J. Solomon, G. Peyré, V. Kim, and S. Sra · 2016
Cited alongside, same era.
Regularized nonlinear acceleration
Damien Scieur, Alexandre d’Aspremont, and Francis Bach · 2016
Cited alongside, same era.
Optimal transport in competition with reaction: The hellinger–kantorovich distance and geodesic curves
Matthias Liero, Alexander Mielke, and Giuseppe Savaré · 2016
Cited alongside, same era.
Neural message passing for quantum chemistry
Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl · 2017
Cited alongside, same era.
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Cited alongside, same era.
Grant Rotskoff, Samy Jelassi, Joan Bruna, and Eric Vanden-Eijnden · 2019
Later among the works it cites.
Sinkhorn divergences for unbalanced optimal transport
Thibault Séjourné, Jean Feydy, François-Xavier Vialard, Alain Trouvé, and Gabriel Peyré · 2019
Later among the works it cites.
Learning generative models across incomparable spaces
Charlotte Bunne, David Alvarez-Melis, Andreas Krause, and Stefanie Jegelka · 2019
Later among the works it cites.
Towards optimal transport with global invariances
David Alvarez-Melis, Stefanie Jegelka, and Tommi S Jaakkola · 2019
Later among the works it cites.
Metric properties of homogeneous and spatially inhomogeneous f f -divergences
Nicolò De Ponti · 2019
Later among the works it cites.
Classification from positive, unlabeled and biased negative data
Yu-Guan Hsieh, Gang Niu, and Masashi Sugiyama · 2019
Later among the works it cites.
Robust optimal transport with applications in generative modeling and domain adaptation
Yogesh Balaji, Rama Chellappa, and Soheil Feizi · 2020
Closest in time.
Learning autoencoders with relational regularization
Hongteng Xu, Dixin Luo, Ricardo Henao, Svati Shah, and Lawrence Carin · 2020
Closest in time.
Ivegen Redko, Titouan Vayer, Rémi Flamary, and Nicolas Courty · 2020
Closest in time.
Gromov-wasserstein averaging in a riemannian framework
Samir Chowdhury and Tom Needham · 2020
Closest in time.
Entropy-transport distances between unbalanced metric measure spaces
Nicoló De Ponti and Andrea Mondino · 2020
Closest in time.
Partial gromov-wasserstein with applications on positive-unlabeled learning
Laetitia Chapel, Mokhtar Z Alaya, and Gilles Gasso · 2020
Closest in time.
On unbalanced optimal transport: An analysis of sinkhorn algorithm
Khiem Pham, Khang Le, Nhat Ho, Tung Pham, and Hung Bui · 2020
Closest in time.