ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 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

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

26 May 2017
Jason M. Altschuler
Jonathan Niles-Weed
Philippe Rigollet
    OT
ArXivPDFHTML

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

12 / 112 papers shown
Title
Unsupervised Hyperalignment for Multilingual Word Embeddings
Unsupervised Hyperalignment for Multilingual Word Embeddings
J. Alaux
Edouard Grave
Marco Cuturi
Armand Joulin
30
70
0
02 Nov 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
15
106
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
44
59
0
23 Oct 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
MedIm
FedML
35
84
0
12 Sep 2018
Towards Optimal Transport with Global Invariances
Towards Optimal Transport with Global Invariances
David Alvarez-Melis
Stefanie Jegelka
Tommi Jaakkola
OT
29
71
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
33
69
0
19 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
31
47
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
24
130
0
30 May 2018
Unsupervised Alignment of Embeddings with Wasserstein Procrustes
Unsupervised Alignment of Embeddings with Wasserstein Procrustes
Edouard Grave
Armand Joulin
Quentin Berthet
17
198
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
27
266
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
19
70
0
22 May 2018
Wasserstein Dictionary Learning: Optimal Transport-based unsupervised
  non-linear dictionary learning
Wasserstein Dictionary Learning: Optimal Transport-based unsupervised non-linear dictionary learning
M. Schmitz
Matthieu Heitz
Nicolas Bonneel
Fred-Maurice Ngole-Mboula
D. Coeurjolly
Marco Cuturi
Gabriel Peyré
Jean-Luc Starck
OT
41
135
0
07 Aug 2017
Previous
123