Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1705.09634
Cited By
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
26 May 2017
Jason M. Altschuler
Jonathan Niles-Weed
Philippe Rigollet
OT
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration"
50 / 112 papers shown
Title
Approximate Policy Iteration with Bisimulation Metrics
Mete Kemertas
Allan D. Jepson
40
7
0
06 Feb 2022
GLAN: A Graph-based Linear Assignment Network
He Liu
Tao Wang
Congyan Lang
Songhe Feng
Yi Jin
Yidong Li
31
5
0
05 Jan 2022
Bounding Wasserstein distance with couplings
N. Biswas
Lester W. Mackey
32
8
0
06 Dec 2021
Convergence of Batch Greenkhorn for Regularized Multimarginal Optimal Transport
Vladimir Kostic
Saverio Salzo
Massimilano Pontil
OT
25
0
0
01 Dec 2021
A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementation
Vien V. Mai
Jacob Lindbäck
M. Johansson
OT
18
7
0
22 Oct 2021
Order Constraints in Optimal Transport
Fabian Lim
L. Wynter
Shiau Hong Lim
OT
39
4
0
14 Oct 2021
On the complexity of the optimal transport problem with graph-structured cost
JiaoJiao Fan
Isabel Haasler
Johan Karlsson
Yongxin Chen
OT
56
21
0
01 Oct 2021
On the Convergence of Projected Alternating Maximization for Equitable and Optimal Transport
Minhui Huang
Shiqian Ma
Lifeng Lai
35
3
0
29 Sep 2021
Sinkhorn Distributionally Robust Optimization
Jie Wang
Rui Gao
Yao Xie
48
35
0
24 Sep 2021
Optimal transport weights for causal inference
Eric A. Dunipace
CML
OT
28
9
0
05 Sep 2021
Entropic Gromov-Wasserstein between Gaussian Distributions
Khang Le
Dung D. Le
Huy Nguyen
Dat Do
Tung Pham
Nhat Ho
OT
29
18
0
24 Aug 2021
On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity
Khang Le
Huy Nguyen
Tung Pham
Nhat Ho
OT
32
8
0
18 Aug 2021
An Optimal Transport Approach to Estimating Causal Effects via Nonlinear Difference-in-Differences
William Torous
F. Gunsilius
Philippe Rigollet
OT
60
15
0
12 Aug 2021
Estimation of Stationary Optimal Transport Plans
Kevin O'Connor
K. Mcgoff
A. Nobel
OT
37
3
0
25 Jul 2021
Asymptotics for semi-discrete entropic optimal transport
Jason M. Altschuler
Jonathan Niles-Weed
Austin J. Stromme
19
27
0
22 Jun 2021
Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent
Jason M. Altschuler
Sinho Chewi
P. Gerber
Austin J. Stromme
25
36
0
16 Jun 2021
Low-Rank Sinkhorn Factorization
M. Scetbon
Marco Cuturi
Gabriel Peyré
28
59
0
08 Mar 2021
Improving Approximate Optimal Transport Distances using Quantization
Gaspard Beugnot
Aude Genevay
Kristjan Greenewald
Justin Solomon
OT
MQ
220
9
0
25 Feb 2021
Differentiable Particle Filtering via Entropy-Regularized Optimal Transport
Adrien Corenflos
James Thornton
George Deligiannidis
Arnaud Doucet
OT
48
66
0
15 Feb 2021
On Robust Optimal Transport: Computational Complexity and Barycenter Computation
Khang Le
Huy Le Nguyen
Quang H. Nguyen
Tung Pham
Hung Bui
Nhat Ho
OT
33
37
0
13 Feb 2021
Smooth
p
p
p
-Wasserstein Distance: Structure, Empirical Approximation, and Statistical Applications
Sloan Nietert
Ziv Goldfeld
Kengo Kato
46
30
0
11 Jan 2021
Minibatch optimal transport distances; analysis and applications
Kilian Fatras
Younes Zine
Szymon Majewski
Rémi Flamary
Rémi Gribonval
Nicolas Courty
OT
79
54
0
05 Jan 2021
Making transport more robust and interpretable by moving data through a small number of anchor points
Chi-Heng Lin
Mehdi Azabou
Eva L. Dyer
OT
OOD
44
22
0
21 Dec 2020
Entropy-regularized optimal transport on multivariate normal and q-normal distributions
Qijun Tong
Kei Kobayashi
OT
23
7
0
19 Dec 2020
Learning Graphons via Structured Gromov-Wasserstein Barycenters
Hongteng Xu
Dixin Luo
Lawrence Carin
H. Zha
59
29
0
10 Dec 2020
A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance
Minhui Huang
Shiqian Ma
Lifeng Lai
26
42
0
09 Dec 2020
Permutation invariant networks to learn Wasserstein metrics
Arijit Sehanobish
N. Ravindra
David van Dijk
OOD
22
2
0
12 Oct 2020
Multi-marginal optimal transport and probabilistic graphical models
Isabel Haasler
Rahul Singh
Qinsheng Zhang
Johan Karlsson
Yongxin Chen
OT
25
41
0
25 Jun 2020
A Study of Performance of Optimal Transport
Yihe Dong
Yu Gao
Richard Peng
Ilya P. Razenshteyn
Saurabh Sawlani
OT
24
17
0
03 May 2020
Statistical and Topological Properties of Sliced Probability Divergences
Kimia Nadjahi
Alain Durmus
Lénaïc Chizat
Soheil Kolouri
Shahin Shahrampour
Umut Simsekli
26
81
0
12 Mar 2020
CO-Optimal Transport
Ivegen Redko
Titouan Vayer
Rémi Flamary
Nicolas Courty
OT
18
64
0
10 Feb 2020
On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm
Khiem Pham
Khang Le
Nhat Ho
Tung Pham
Hung Bui
OT
65
82
0
09 Feb 2020
Geometric Dataset Distances via Optimal Transport
David Alvarez-Melis
Nicolò Fusi
OT
90
195
0
07 Feb 2020
Gaussian-Smooth Optimal Transport: Metric Structure and Statistical Efficiency
Ziv Goldfeld
Kristjan Greenewald
OT
33
39
0
24 Jan 2020
Balancing Gaussian vectors in high dimension
Paxton Turner
Raghu Meka
Philippe Rigollet
31
25
0
30 Oct 2019
Model Fusion via Optimal Transport
Sidak Pal Singh
Martin Jaggi
MoMe
FedML
32
225
0
12 Oct 2019
Learning transport cost from subset correspondence
Ruishan Liu
Akshay Balsubramani
James Zou
OT
24
14
0
29 Sep 2019
Sinkhorn Algorithm as a Special Case of Stochastic Mirror Descent
Konstantin Mishchenko
9
15
0
16 Sep 2019
Statistical data analysis in the Wasserstein space
Jérémie Bigot
27
29
0
19 Jul 2019
FlipTest: Fairness Testing via Optimal Transport
Emily Black
Samuel Yeom
Matt Fredrikson
30
94
0
21 Jun 2019
On a Combination of Alternating Minimization and Nesterov's Momentum
Sergey Guminov
Pavel Dvurechensky
N. Tupitsa
Alexander Gasnikov
ODL
16
45
0
09 Jun 2019
Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem
Gonzalo E. Mena
Jonathan Niles-Weed
OT
13
163
0
28 May 2019
Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter
Wenshuo Guo
Nhat Ho
Michael I. Jordan
OT
27
5
0
23 May 2019
Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
Hongteng Xu
Dixin Luo
Lawrence Carin
23
191
0
18 May 2019
Minimax estimation of smooth optimal transport maps
Jan-Christian Hütter
Philippe Rigollet
OT
29
28
0
14 May 2019
Wasserstein Adversarial Regularization (WAR) on label noise
Kilian Fatras
B. Bushan
Sylvain Lobry
Rémi Flamary
D. Tuia
Nicolas Courty
21
24
0
08 Apr 2019
Wasserstein Adversarial Examples via Projected Sinkhorn Iterations
Eric Wong
Frank R. Schmidt
J. Zico Kolter
AAML
36
210
0
21 Feb 2019
Gromov-Wasserstein Learning for Graph Matching and Node Embedding
Hongteng Xu
Dixin Luo
H. Zha
Lawrence Carin
30
255
0
17 Jan 2019
Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures
Bernard Bercu
Jérémie Bigot
26
19
0
21 Dec 2018
Deep Geometric Prior for Surface Reconstruction
Francis Williams
T. Schneider
Claudio Silva
Denis Zorin
Joan Bruna
Daniele Panozzo
3DPC
22
190
0
27 Nov 2018
Previous
1
2
3
Next