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. 1802.04307
  4. Cited By
A Fast Proximal Point Method for Computing Exact Wasserstein Distance

A Fast Proximal Point Method for Computing Exact Wasserstein Distance

12 February 2018
Yujia Xie
Xiangfeng Wang
Ruijia Wang
H. Zha
ArXivPDFHTML

Papers citing "A Fast Proximal Point Method for Computing Exact Wasserstein Distance"

4 / 4 papers shown
Title
Near-linear time approximation algorithms for optimal transport via
  Sinkhorn iteration
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
Jason M. Altschuler
Jonathan Niles-Weed
Philippe Rigollet
OT
66
590
0
26 May 2017
Fast Discrete Distribution Clustering Using Wasserstein Barycenter with
  Sparse Support
Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support
Jianbo Ye
Panruo Wu
Jianmin Wang
Jia Li
40
132
0
30 Sep 2015
Fast Computation of Wasserstein Barycenters
Fast Computation of Wasserstein Barycenters
Marco Cuturi
Arnaud Doucet
OT
86
740
0
16 Oct 2013
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation
  Distances
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances
Marco Cuturi
OT
199
4,251
0
04 Jun 2013
1