The ability to align points across two related yet incomparable point clouds (e.g.
Reading the bibliography…
Scalable gromov-wasserstein learning for graph partitioning and matching
Hongteng Xu, Dixin Luo, and Lawrence Carin · 1905
Earlier work this paper cites.
Computational optimal transport
Gabriel Peyré and Marco Cuturi · 1935
Earlier work this paper cites.
A relationship between arbitrary positive matrices and doubly stochastic matrices
Richard Sinkhorn · 1964
Earlier work this paper cites.
Weak convergence of probabilities on nonseparable metric spaces and empirical measures on euclidean spaces
Richard Mansfield Dudley et al · 1966
Earlier work this paper cites.
Maximization of a convex quadratic function under linear constraints
Hiroshi Konno · 1976
Earlier work this paper cites.
Softassign versus softmax: Benchmarks in combinatorial optimization
Steven Gold and Anand Rangarajan · 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.
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.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Earlier work this paper cites.
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization, 2013
Saeed Ghadimi, Guanghui Lan, and Hongchao Zhang · 2013
Earlier work this paper cites.
Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
Justin Solomon, Fernando De Goes, Gabriel Peyré, Marco Cuturi, Adrian Butscher, Andy Nguyen, Tao Du, and Leonidas Guibas · 2015
Earlier work this paper cites.
Gromov-wasserstein averaging of kernel and distance matrices
Gabriel Peyré, Marco Cuturi, and Justin Solomon · 2016
Earlier work this paper cites.
Entropic metric alignment for correspondence problems
Justin Solomon, Gabriel Peyré, Vladimir G Kim, and Suvrit Sra · 2016
Earlier work this paper cites.
Near-linear time approximation algorithms for optimal transport via sinkhorn iteration
Jason Altschuler, Jonathan Weed, and Philippe Rigollet · 2017
Cited alongside, same era.
Gwcnn: A metric alignment layer for deep shape analysis
Danielle Ezuz, Justin Solomon, Vladimir G Kim, and Mirela Ben-Chen · 2017
Cited alongside, same era.
Relatively-smooth convex optimization by first-order methods, and applications, 2017
Haihao Lu, Robert M. Freund, and Yurii Nesterov · 2017
Cited alongside, same era.
Splatter: simulation of single-cell rna sequencing data
Luke Zappia, Belinda Phipson, and Alicia Oshlack · 2017
Cited alongside, same era.
Massively parallel digital transcriptional profiling of single cells
Grace XY Zheng, Jessica M Terry, Phillip Belgrader, Paul Ryvkin, Zachary W Bent, Ryan Wilson, Solongo B Ziraldo, Tobias D Wheeler, Geoff P McDermott, Junjie Zhu, et al · 2017
Cited alongside, same era.
Sublinear time low-rank approximation of distance matrices, 2018
Ainesh Bakshi and David P. Woodruff · 2018
Cited alongside, same era.
Integrative single-cell analysis of transcriptional and epigenetic states in the human adult brain
Blue B Lake, Song Chen, Brandon C Sos, Jean Fan, Gwendolyn E Kaeser, Yun C Yung, Thu E Duong, Derek Gao, Jerold Chun, Peter V Kharchenko, et al · 2018
Cited alongside, same era.
Titouan Vayer, Laetita Chapel, Rémi Flamary, Romain Tavenard, and Nicolas Courty · 2018
Cited alongside, same era.
Scanpy: large-scale single-cell gene expression data analysis
F Alexander Wolf, Philipp Angerer, and Fabian J Theis · 2018
Cited alongside, same era.
Learning generative models across incomparable spaces
Charlotte Bunne, David Alvarez-Melis, Andreas Krause, and Stefanie Jegelka · 2019
Cited alongside, same era.
High-throughput sequencing of the transcriptome and chromatin accessibility in the same cell
Song Chen, Blue B Lake, and Kun Zhang · 2019
Cited alongside, same era.
Statistical optimal transport via factored couplings
Aden Forrow, Jan-Christian Hütter, Mor Nitzan, Philippe Rigollet, Geoffrey Schiebinger, and Jonathan Weed · 2019
Cited alongside, same era.
On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms
Tianyi Lin, Nhat Ho, and Michael Jordan · 2019
Later among the works it cites.
Jointly embedding multiple single-cell omics measurements
Jie Liu, Yuanhao Huang, Ritambhara Singh, Jean-Philippe Vert, and William Stafford Noble · 2019
Later among the works it cites.
Titouan Vayer, Rémi Flamary, Romain Tavenard, Laetitia Chapel, and Nicolas Courty · 2019
Later among the works it cites.
Sharp asymptotic and finite-sample rates of convergence of empirical measures in wasserstein distance
Jonathan Weed and Francis Bach · 2019
Later among the works it cites.
Andrew J Blumberg, Mathieu Carriere, Michael A Mandell, Raul Rabadan, and Soledad Villar · 2020
Later among the works it cites.
Partial optimal transport with applications on positive-unlabeled learning
Laetitia Chapel, Mokhtar Alaya, and Gilles Gasso · 2020
Later among the works it cites.
Gromov-wasserstein optimal transport to align single-cell multi-omics data
Pinar Demetci, Rebecca Santorella, Björn Sandstede, William Stafford Noble, and Ritambhara Singh · 2020
Later among the works it cites.
Fast and robust comparison of probability measures in heterogeneous spaces
Ryoma Sato, Marco Cuturi, Makoto Yamada, and Hisashi Kashima · 2020
Later among the works it cites.
Linear time sinkhorn divergences using positive features, 2020
Meyer Scetbon and Marco Cuturi · 2020
Later among the works it cites.
Wasserstein control of mirror langevin monte carlo, 2020
Kelvin Shuangjian Zhang, Gabriel Peyré, Jalal Fadili, and Marcelo Pereyra · 2020
Later among the works it cites.
Samir Chowdhury, David Miller, and Tom Needham · 2021
Closest in time.
Flow-based alignment approaches for probability measures in different spaces
Tam Le, Nhat Ho, and Makoto Yamada · 2021
Closest in time.
Low-rank sinkhorn factorization, 2021
Meyer Scetbon, Marco Cuturi, and Gabriel Peyré · 2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…