ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1705.09634
  4. Cited By
Near-linear time approximation algorithms for optimal transport via
  Sinkhorn iteration
v1v2 (latest)

Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration

26 May 2017
Jason M. Altschuler
Jonathan Niles-Weed
Philippe Rigollet
    OT
ArXiv (abs)PDFHTML

Papers citing "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration"

50 / 305 papers shown
Approximating Optimal Transport via Low-rank and Sparse Factorization
Approximating Optimal Transport via Low-rank and Sparse Factorization
Weijie Liu
Chao Zhang
Nenggan Zheng
Hui Qian
OT
79
3
0
12 Nov 2021
Nearly Tight Convergence Bounds for Semi-discrete Entropic Optimal
  Transport
Nearly Tight Convergence Bounds for Semi-discrete Entropic Optimal TransportInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2021
Shin Kamada
181
17
0
25 Oct 2021
A Fast and Accurate Splitting Method for Optimal Transport: Analysis and
  Implementation
A Fast and Accurate Splitting Method for Optimal Transport: Analysis and ImplementationInternational Conference on Learning Representations (ICLR), 2021
Vien V. Mai
Jacob Lindbäck
M. Johansson
OT
140
11
0
22 Oct 2021
Order Constraints in Optimal Transport
Order Constraints in Optimal Transport
Fabian Lim
L. Wynter
Shiau Hong Lim
OT
233
4
0
14 Oct 2021
On the complexity of the optimal transport problem with graph-structured
  cost
On the complexity of the optimal transport problem with graph-structured cost
JiaoJiao Fan
Isabel Haasler
Johan Karlsson
Yongxin Chen
OT
250
23
0
01 Oct 2021
On the Convergence of Projected Alternating Maximization for Equitable
  and Optimal Transport
On the Convergence of Projected Alternating Maximization for Equitable and Optimal Transport
Minhui Huang
Shiqian Ma
Lifeng Lai
150
5
0
29 Sep 2021
Entropic estimation of optimal transport maps
Entropic estimation of optimal transport maps
Aram-Alexandre Pooladian
Jonathan Niles-Weed
OT
263
128
0
24 Sep 2021
Sinkhorn Distributionally Robust Optimization
Sinkhorn Distributionally Robust OptimizationOperational Research (OR), 2021
Jie Wang
Rui Gao
Yao Xie
537
47
0
24 Sep 2021
Optimal transport weights for causal inference
Optimal transport weights for causal inference
Eric A. Dunipace
CMLOT
291
11
0
05 Sep 2021
Entropic Gromov-Wasserstein between Gaussian Distributions
Entropic Gromov-Wasserstein between Gaussian DistributionsInternational Conference on Machine Learning (ICML), 2021
Khang Le
Dung D. Le
Huy Nguyen
Dat Do
Tung Pham
Nhat Ho
OT
178
20
0
24 Aug 2021
Quantitative Uniform Stability of the Iterative Proportional Fitting
  Procedure
Quantitative Uniform Stability of the Iterative Proportional Fitting Procedure
George Deligiannidis
Valentin De Bortoli
Arnaud Doucet
236
23
0
18 Aug 2021
On Multimarginal Partial Optimal Transport: Equivalent Forms and
  Computational Complexity
On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity
Khang Le
Huy Nguyen
Tung Pham
Nhat Ho
OT
190
9
0
18 Aug 2021
An Optimal Transport Approach to Estimating Causal Effects via Nonlinear
  Difference-in-Differences
An Optimal Transport Approach to Estimating Causal Effects via Nonlinear Difference-in-DifferencesJournal of Causal Inference (JCI), 2021
William Torous
F. Gunsilius
Philippe Rigollet
OT
252
21
0
12 Aug 2021
Deep graph matching meets mixed-integer linear programming: Relax at
  your own risk ?
Deep graph matching meets mixed-integer linear programming: Relax at your own risk ?
Zhoubo Xu
Puqing Chen
R. Raveaux
Xin Yang
Huadong Liu
266
5
0
01 Aug 2021
Limit Distribution Theory for the Smooth 1-Wasserstein Distance with
  Applications
Limit Distribution Theory for the Smooth 1-Wasserstein Distance with Applications
Ritwik Sadhu
Ziv Goldfeld
Kengo Kato
285
9
0
28 Jul 2021
Estimation of Stationary Optimal Transport Plans
Estimation of Stationary Optimal Transport PlansInformation and Inference A Journal of the IMA (JIII), 2021
Kevin O'Connor
K. Mcgoff
A. Nobel
OT
195
3
0
25 Jul 2021
A stochastic Gauss-Newton algorithm for regularized semi-discrete
  optimal transport
A stochastic Gauss-Newton algorithm for regularized semi-discrete optimal transport
Bernard Bercu
Jérémie Bigot
S. Gadat
Emilia Siviero
261
7
0
12 Jul 2021
Data-driven mapping between functional connectomes using optimal
  transport
Data-driven mapping between functional connectomes using optimal transport
J. Dadashkarimi
Amin Karbasi
D. Scheinost
OT
69
3
0
02 Jul 2021
Asymptotics for semi-discrete entropic optimal transport
Asymptotics for semi-discrete entropic optimal transportSIAM Journal on Mathematical Analysis (SIAM J. Math. Anal.), 2021
Jason M. Altschuler
Jonathan Niles-Weed
Austin J. Stromme
117
34
0
22 Jun 2021
Averaging on the Bures-Wasserstein manifold: dimension-free convergence
  of gradient descent
Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent
Jason M. Altschuler
Sinho Chewi
P. Gerber
Austin J. Stromme
338
43
0
16 Jun 2021
Neural Monge Map estimation and its applications
Neural Monge Map estimation and its applications
JiaoJiao Fan
Shu Liu
Shaojun Ma
Haomin Zhou
Yongxin Chen
OT
349
32
0
07 Jun 2021
Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and
  Costs
Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and CostsInternational Conference on Machine Learning (ICML), 2021
M. Scetbon
Gabriel Peyré
Marco Cuturi
OT
209
69
0
02 Jun 2021
Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and
  Practical Solutions
Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical SolutionsInternational Conference on Learning Representations (ICLR), 2021
Leslie O’Bray
Max Horn
Bastian Rieck
Karsten Borgwardt
369
48
0
02 Jun 2021
Optimal transport with $f$-divergence regularization and generalized
  Sinkhorn algorithm
Optimal transport with fff-divergence regularization and generalized Sinkhorn algorithmInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2021
Dávid Terjék
Diego González-Sánchez
OT
200
9
0
29 May 2021
Efficient Optimal Transport Algorithm by Accelerated Gradient descent
Efficient Optimal Transport Algorithm by Accelerated Gradient descent
Dongsheng An
Na Lei
Xianfeng Gu
OT
208
0
0
12 Apr 2021
Biwhitening Reveals the Rank of a Count Matrix
Biwhitening Reveals the Rank of a Count MatrixSIAM Journal on Mathematics of Data Science (SIMODS), 2021
Boris Landa
Thomas T. Zhang
Y. Kluger
351
25
0
25 Mar 2021
Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical
  Solution
Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical SolutionMathematical programming (Math. Program.), 2021
Bahar Taşkesen
Soroosh Shafieezadeh-Abadeh
Daniel Kuhn
OT
238
35
0
10 Mar 2021
Fast block-coordinate Frank-Wolfe algorithm for semi-relaxed optimal
  transport
Fast block-coordinate Frank-Wolfe algorithm for semi-relaxed optimal transport
Takumi Fukunaga
Hiroyuki Kasai
OT
192
6
0
10 Mar 2021
Low-Rank Sinkhorn Factorization
Low-Rank Sinkhorn FactorizationInternational Conference on Machine Learning (ICML), 2021
M. Scetbon
Marco Cuturi
Gabriel Peyré
179
67
0
08 Mar 2021
Improving Approximate Optimal Transport Distances using Quantization
Improving Approximate Optimal Transport Distances using QuantizationConference on Uncertainty in Artificial Intelligence (UAI), 2021
Gaspard Beugnot
Aude Genevay
Kristjan Greenewald
Justin Solomon
OTMQ
579
11
0
25 Feb 2021
Sinkhorn Label Allocation: Semi-Supervised Classification via Annealed
  Self-Training
Sinkhorn Label Allocation: Semi-Supervised Classification via Annealed Self-TrainingInternational Conference on Machine Learning (ICML), 2021
Kai Sheng Tai
Peter Bailis
Gregory Valiant
OT
150
52
0
17 Feb 2021
Differentiable Particle Filtering via Entropy-Regularized Optimal
  Transport
Differentiable Particle Filtering via Entropy-Regularized Optimal TransportInternational Conference on Machine Learning (ICML), 2021
Adrien Corenflos
James Thornton
George Deligiannidis
Arnaud Doucet
OT
233
87
0
15 Feb 2021
On Robust Optimal Transport: Computational Complexity and Barycenter
  Computation
On Robust Optimal Transport: Computational Complexity and Barycenter ComputationNeural Information Processing Systems (NeurIPS), 2021
Khang Le
Huy Le Nguyen
Quang H. Nguyen
Tung Pham
Hung Bui
Nhat Ho
OT
207
41
0
13 Feb 2021
Unsupervised Ground Metric Learning using Wasserstein Singular Vectors
Unsupervised Ground Metric Learning using Wasserstein Singular VectorsInternational Conference on Machine Learning (ICML), 2021
Geert-Jan Huizing
Laura Cantini
Gabriel Peyré
SSLOT
210
8
0
11 Feb 2021
On Transportation of Mini-batches: A Hierarchical Approach
On Transportation of Mini-batches: A Hierarchical ApproachInternational Conference on Machine Learning (ICML), 2021
Khai Nguyen
Dang Nguyen
Quoc Nguyen
Tung Pham
Hung Bui
Dinh Q. Phung
Trung Le
Nhat Ho
OT
224
19
0
11 Feb 2021
Projection Robust Wasserstein Barycenters
Projection Robust Wasserstein BarycentersInternational Conference on Machine Learning (ICML), 2021
Minhui Huang
Shiqian Ma
Lifeng Lai
214
14
0
05 Feb 2021
Learning High Dimensional Wasserstein Geodesics
Learning High Dimensional Wasserstein Geodesics
Shu Liu
Shaojun Ma
Yongxin Chen
H. Zha
Haomin Zhou
357
11
0
05 Feb 2021
Hawkes Processes on Graphons
Hawkes Processes on Graphons
Hongteng Xu
Dixin Luo
H. Zha
178
1
0
04 Feb 2021
Complementary Composite Minimization, Small Gradients in General Norms,
  and Applications
Complementary Composite Minimization, Small Gradients in General Norms, and ApplicationsMathematical programming (Math. Program.), 2021
Jelena Diakonikolas
Cristóbal Guzmán
129
14
0
26 Jan 2021
Smooth $p$-Wasserstein Distance: Structure, Empirical Approximation, and
  Statistical Applications
Smooth ppp-Wasserstein Distance: Structure, Empirical Approximation, and Statistical ApplicationsInternational Conference on Machine Learning (ICML), 2021
Sloan Nietert
Ziv Goldfeld
Kengo Kato
222
38
0
11 Jan 2021
Minibatch optimal transport distances; analysis and applications
Minibatch optimal transport distances; analysis and applications
Kilian Fatras
Younes Zine
Szymon Majewski
Rémi Flamary
Rémi Gribonval
Nicolas Courty
OT
216
67
0
05 Jan 2021
Making transport more robust and interpretable by moving data through a
  small number of anchor points
Making transport more robust and interpretable by moving data through a small number of anchor pointsInternational Conference on Machine Learning (ICML), 2020
Chi-Heng Lin
Mehdi Azabou
Eva L. Dyer
OTOOD
389
24
0
21 Dec 2020
Entropy-regularized optimal transport on multivariate normal and
  q-normal distributions
Entropy-regularized optimal transport on multivariate normal and q-normal distributions
Qijun Tong
Kei Kobayashi
OT
181
7
0
19 Dec 2020
Randomised Wasserstein Barycenter Computation: Resampling with
  Statistical Guarantees
Randomised Wasserstein Barycenter Computation: Resampling with Statistical Guarantees
F. Heinemann
Axel Munk
Y. Zemel
189
19
0
11 Dec 2020
Learning Graphons via Structured Gromov-Wasserstein Barycenters
Learning Graphons via Structured Gromov-Wasserstein BarycentersAAAI Conference on Artificial Intelligence (AAAI), 2020
Hongteng Xu
Dixin Luo
Lawrence Carin
H. Zha
313
39
0
10 Dec 2020
A Riemannian Block Coordinate Descent Method for Computing the
  Projection Robust Wasserstein Distance
A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein DistanceInternational Conference on Machine Learning (ICML), 2020
Minhui Huang
Shiqian Ma
Lifeng Lai
488
44
0
09 Dec 2020
Model Compression Using Optimal Transport
Model Compression Using Optimal Transport
Suhas Lohit
Michael J. Jones
234
9
0
07 Dec 2020
A contribution to Optimal Transport on incomparable spaces
A contribution to Optimal Transport on incomparable spaces
Titouan Vayer
OT
306
22
0
09 Nov 2020
Fast and Smooth Interpolation on Wasserstein Space
Fast and Smooth Interpolation on Wasserstein Space
Sinho Chewi
Julien Clancy
Thibaut Le Gouic
Philippe Rigollet
George Stepaniants
Austin J. Stromme
169
32
0
22 Oct 2020
Towards Listening to 10 People Simultaneously: An Efficient Permutation
  Invariant Training of Audio Source Separation Using Sinkhorn's Algorithm
Towards Listening to 10 People Simultaneously: An Efficient Permutation Invariant Training of Audio Source Separation Using Sinkhorn's Algorithm
Hideyuki Tachibana
256
15
0
22 Oct 2020
Previous
1234567
Next
Page 4 of 7