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
Screening Sinkhorn Algorithm for Regularized Optimal Transport
Screening Sinkhorn Algorithm for Regularized Optimal TransportNeural Information Processing Systems (NeurIPS), 2019
Mokhtar Z. Alaya
Maxime Bérar
Gilles Gasso
A. Rakotomamonjy
OT
199
38
0
20 Jun 2019
Interpretable ICD Code Embeddings with Self- and Mutual-Attention
  Mechanisms
Interpretable ICD Code Embeddings with Self- and Mutual-Attention Mechanisms
Dixin Luo
Hongteng Xu
Lawrence Carin
101
5
0
13 Jun 2019
On a Combination of Alternating Minimization and Nesterov's Momentum
On a Combination of Alternating Minimization and Nesterov's MomentumInternational Conference on Machine Learning (ICML), 2019
Sergey Guminov
Pavel Dvurechensky
N. Tupitsa
Alexander Gasnikov
ODL
472
49
0
09 Jun 2019
Wasserstein Weisfeiler-Lehman Graph Kernels
Wasserstein Weisfeiler-Lehman Graph KernelsNeural Information Processing Systems (NeurIPS), 2019
Matteo Togninalli
M. Ghisu
Felipe Llinares-López
Bastian Rieck
Karsten Borgwardt
287
221
0
04 Jun 2019
A Direct $\tilde{O}(1/ε)$ Iteration Parallel Algorithm for
  Optimal Transport
A Direct O~(1/ε)\tilde{O}(1/ε)O~(1/ε) Iteration Parallel Algorithm for Optimal Transport
A. Jambulapati
Aaron Sidford
Kevin Tian
OT
158
20
0
03 Jun 2019
A scalable optimal-transport based local particle filter
A scalable optimal-transport based local particle filter
Matthew M. Graham
Alexandre Hoang Thiery
OT
134
3
0
03 Jun 2019
Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter
  Problem
Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter ProblemNeural Information Processing Systems (NeurIPS), 2019
Dongdong Ge
Haoyue Wang
Zikai Xiong
Yinyu Ye
181
29
0
30 May 2019
Statistical bounds for entropic optimal transport: sample complexity and
  the central limit theorem
Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremNeural Information Processing Systems (NeurIPS), 2019
Gonzalo E. Mena
Jonathan Niles-Weed
OT
289
186
0
28 May 2019
A Graph Theoretic Additive Approximation of Optimal Transport
A Graph Theoretic Additive Approximation of Optimal TransportNeural Information Processing Systems (NeurIPS), 2019
Nathaniel Lahn
Deepika Mulchandani
S. Raghvendra
OT
171
30
0
28 May 2019
Polynomial Tensor Sketch for Element-wise Function of Low-Rank Matrix
Polynomial Tensor Sketch for Element-wise Function of Low-Rank MatrixInternational Conference on Machine Learning (ICML), 2019
Insu Han
H. Avron
Jinwoo Shin
139
12
0
28 May 2019
Fast Algorithms for Computational Optimal Transport and Wasserstein
  Barycenter
Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter
Wenshuo Guo
Nhat Ho
Sai Li
OT
224
5
0
23 May 2019
Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
Scalable Gromov-Wasserstein Learning for Graph Partitioning and MatchingNeural Information Processing Systems (NeurIPS), 2019
Hongteng Xu
Dixin Luo
Lawrence Carin
468
222
0
18 May 2019
Minimax estimation of smooth optimal transport maps
Minimax estimation of smooth optimal transport maps
Jan-Christian Hütter
Philippe Rigollet
OT
267
29
0
14 May 2019
Wasserstein-Fisher-Rao Document Distance
Wasserstein-Fisher-Rao Document Distance
Zihao Wang
Datong P. Zhou
Yong Zhang
Hao Wu
Chenglong Bao
127
5
0
23 Apr 2019
Wasserstein Adversarial Regularization (WAR) on label noise
Wasserstein Adversarial Regularization (WAR) on label noise
Kilian Fatras
B. Bushan
Sylvain Lobry
Rémi Flamary
D. Tuia
Nicolas Courty
255
29
0
08 Apr 2019
Recovery Bounds on Class-Based Optimal Transport: A Sum-of-Norms
  Regularization Framework
Recovery Bounds on Class-Based Optimal Transport: A Sum-of-Norms Regularization Framework
Arman Rahbar
Ashkan Panahi
M. Chehreghani
Devdatt Dubhashi
Hamid Krim
326
0
0
09 Mar 2019
Wasserstein Adversarial Examples via Projected Sinkhorn Iterations
Wasserstein Adversarial Examples via Projected Sinkhorn Iterations
Eric Wong
Frank R. Schmidt
J. Zico Kolter
AAML
258
222
0
21 Feb 2019
Sinkhorn Divergence of Topological Signature Estimates for Time Series
  Classification
Sinkhorn Divergence of Topological Signature Estimates for Time Series Classification
C. Stephen
62
0
0
14 Feb 2019
Minimax estimation of smooth densities in Wasserstein distance
Minimax estimation of smooth densities in Wasserstein distance
Jonathan Niles-Weed
Quentin Berthet
OT
243
45
0
05 Feb 2019
Tree-Sliced Variants of Wasserstein Distances
Tree-Sliced Variants of Wasserstein DistancesNeural Information Processing Systems (NeurIPS), 2019
Tam Le
M. Yamada
Kenji Fukumizu
Marco Cuturi
OT
344
93
0
01 Feb 2019
Approximation of Wasserstein distance with Transshipment
Approximation of Wasserstein distance with Transshipment
Nicolas Papadakis
OT
391
1
0
27 Jan 2019
Gromov-Wasserstein Learning for Graph Matching and Node Embedding
Gromov-Wasserstein Learning for Graph Matching and Node Embedding
Hongteng Xu
Dixin Luo
H. Zha
Lawrence Carin
408
295
0
17 Jan 2019
Asymptotic distribution and convergence rates of stochastic algorithms
  for entropic optimal transportation between probability measures
Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures
Bernard Bercu
Jérémie Bigot
357
25
0
21 Dec 2018
Massively scalable Sinkhorn distances via the Nyström method
Massively scalable Sinkhorn distances via the Nyström method
Jason M. Altschuler
Francis R. Bach
Alessandro Rudi
Jonathan Niles-Weed
260
118
0
12 Dec 2018
Low-Complexity Data-Parallel Earth Mover's Distance Approximations
Low-Complexity Data-Parallel Earth Mover's Distance Approximations
Kubilay Atasu
T. Mittelholzer
111
0
0
05 Dec 2018
Deep Geometric Prior for Surface Reconstruction
Deep Geometric Prior for Surface Reconstruction
Francis Williams
T. Schneider
Claudio Silva
Denis Zorin
Joan Bruna
Daniele Panozzo
3DPC
309
210
0
27 Nov 2018
Unsupervised Hyperalignment for Multilingual Word Embeddings
Unsupervised Hyperalignment for Multilingual Word Embeddings
J. Alaux
Edouard Grave
Marco Cuturi
Armand Joulin
296
72
0
02 Nov 2018
Dimensionality Reduction has Quantifiable Imperfections: Two Geometric
  Bounds
Dimensionality Reduction has Quantifiable Imperfections: Two Geometric Bounds
Kry Yik-Chau Lui
G. Ding
Ruitong Huang
R. McCann
91
7
0
31 Oct 2018
Word Mover's Embedding: From Word2Vec to Document Embedding
Word Mover's Embedding: From Word2Vec to Document Embedding
Lingfei Wu
Ian En-Hsu Yen
Kun Xu
Fangli Xu
Avinash Balakrishnan
Pin-Yu Chen
Pradeep Ravikumar
Michael Witbrock
181
113
0
30 Oct 2018
Empirical Regularized Optimal Transport: Statistical Theory and
  Applications
Empirical Regularized Optimal Transport: Statistical Theory and Applications
M. Klatt
Carla Tameling
Axel Munk
OT
265
65
0
23 Oct 2018
Sinkhorn AutoEncoders
Sinkhorn AutoEncoders
Giorgio Patrini
Rianne van den Berg
Patrick Forré
M. Carioni
Samarth Bhargav
Max Welling
Tim Genewein
Frank Nielsen
DiffM
256
89
0
02 Oct 2018
Entropic optimal transport is maximum-likelihood deconvolution
Entropic optimal transport is maximum-likelihood deconvolution
Philippe Rigollet
Jonathan Niles-Weed
OT
248
82
0
14 Sep 2018
Distilled Wasserstein Learning for Word Embedding and Topic Modeling
Distilled Wasserstein Learning for Word Embedding and Topic Modeling
Hongteng Xu
Wenlin Wang
Wen Liu
Lawrence Carin
MedImFedML
213
88
0
12 Sep 2018
Context Mover's Distance & Barycenters: Optimal Transport of Contexts
  for Building Representations
Context Mover's Distance & Barycenters: Optimal Transport of Contexts for Building Representations
Sidak Pal Singh
Andreas Hug
Hadrien Hendrikx
Martin Jaggi
OT
338
27
0
29 Aug 2018
Uncoupled isotonic regression via minimum Wasserstein deconvolution
Uncoupled isotonic regression via minimum Wasserstein deconvolutionInformation and Inference A Journal of the IMA (JIII), 2018
Philippe Rigollet
Jonathan Niles-Weed
181
70
0
27 Jun 2018
Towards Optimal Transport with Global Invariances
Towards Optimal Transport with Global Invariances
David Alvarez-Melis
Stefanie Jegelka
Tommi Jaakkola
OT
197
78
0
25 Jun 2018
Statistical Optimal Transport via Factored Couplings
Statistical Optimal Transport via Factored Couplings
Aden Forrow
Jan-Christian Hütter
Mor Nitzan
Philippe Rigollet
Geoffrey Schiebinger
Jonathan Niles-Weed
OT
312
76
0
19 Jun 2018
Convergence rates for empirical barycenters in metric spaces: curvature,
  convexity and extendible geodesics
Convergence rates for empirical barycenters in metric spaces: curvature, convexity and extendible geodesics
A. Ahidar-Coutrix
Thibaut Le Gouic
Q. Paris
314
57
0
07 Jun 2018
An explicit analysis of the entropic penalty in linear programming
An explicit analysis of the entropic penalty in linear programming
Jonathan Niles-Weed
294
51
0
05 Jun 2018
Differential Properties of Sinkhorn Approximation for Learning with
  Wasserstein Distance
Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distance
Giulia Luise
Alessandro Rudi
Massimiliano Pontil
C. Ciliberto
OT
192
140
0
30 May 2018
Unsupervised Alignment of Embeddings with Wasserstein Procrustes
Unsupervised Alignment of Embeddings with Wasserstein Procrustes
Edouard Grave
Armand Joulin
Quentin Berthet
327
213
0
29 May 2018
Optimal Transport for structured data with application on graphs
Optimal Transport for structured data with application on graphs
Titouan Vayer
Laetitia Chapel
Rémi Flamary
R. Tavenard
Nicolas Courty
OT
266
313
0
23 May 2018
Large Scale computation of Means and Clusters for Persistence Diagrams
  using Optimal Transport
Large Scale computation of Means and Clusters for Persistence Diagrams using Optimal Transport
Théo Lacombe
Marco Cuturi
S. Oudot
214
77
0
22 May 2018
Computing Kantorovich-Wasserstein Distances on $d$-dimensional
  histograms using $(d+1)$-partite graphs
Computing Kantorovich-Wasserstein Distances on ddd-dimensional histograms using (d+1)(d+1)(d+1)-partite graphs
Gennaro Auricchio
F. Bassetti
Stefano Gualandi
Marco Veneroni
174
25
0
18 May 2018
On the Computation of Kantorovich-Wasserstein Distances between
  2D-Histograms by Uncapacitated Minimum Cost Flows
On the Computation of Kantorovich-Wasserstein Distances between 2D-Histograms by Uncapacitated Minimum Cost Flows
F. Bassetti
Stefano Gualandi
Marco Veneroni
211
12
0
02 Apr 2018
Greedy stochastic algorithms for entropy-regularized optimal transport
  problems
Greedy stochastic algorithms for entropy-regularized optimal transport problems
Brahim Khalil Abid
Robert Mansel Gower
OT
82
27
0
04 Mar 2018
Computational Optimal Transport
Computational Optimal Transport
Gabriel Peyré
Marco Cuturi
OT
1.4K
2,438
0
01 Mar 2018
On the Convergence and Robustness of Training GANs with Regularized
  Optimal Transport
On the Convergence and Robustness of Training GANs with Regularized Optimal Transport
Maziar Sanjabi
Jimmy Ba
Meisam Razaviyayn
Jason D. Lee
GAN
244
144
0
22 Feb 2018
Optimal Transport: Fast Probabilistic Approximation with Exact Solvers
Optimal Transport: Fast Probabilistic Approximation with Exact Solvers
Max Sommerfeld
Jörn Schrieber
Y. Zemel
Axel Munk
OT
256
60
0
14 Feb 2018
A Fast Proximal Point Method for Computing Exact Wasserstein Distance
A Fast Proximal Point Method for Computing Exact Wasserstein Distance
Yujia Xie
Xiangfeng Wang
Ruijia Wang
H. Zha
263
18
0
12 Feb 2018
Previous
1234567
Next
Page 6 of 7