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. 1909.06918
  4. Cited By
Sinkhorn Algorithm as a Special Case of Stochastic Mirror Descent

Sinkhorn Algorithm as a Special Case of Stochastic Mirror Descent

16 September 2019
Konstantin Mishchenko
ArXivPDFHTML

Papers citing "Sinkhorn Algorithm as a Special Case of Stochastic Mirror Descent"

3 / 3 papers shown
Title
Computational Optimal Transport
Computational Optimal Transport
Gabriel Peyré
Marco Cuturi
OT
140
2,133
0
01 Mar 2018
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
56
587
0
26 May 2017
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation
  Distances
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances
Marco Cuturi
OT
135
4,210
0
04 Jun 2013
1