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. 2306.06581
  4. Cited By
Importance Sparsification for Sinkhorn Algorithm

Importance Sparsification for Sinkhorn Algorithm

11 June 2023
Mengyun Li
Jun Yu
Tao Li
Cheng Meng
    OT
ArXiv (abs)PDFHTML

Papers citing "Importance Sparsification for Sinkhorn Algorithm"

25 / 25 papers shown
Title
Regularized Optimal Transport Layers for Generalized Global Pooling
  Operations
Regularized Optimal Transport Layers for Generalized Global Pooling Operations
Hongteng Xu
Minjie Cheng
77
4
0
13 Dec 2022
Hierarchical Sliced Wasserstein Distance
Hierarchical Sliced Wasserstein Distance
Khai Nguyen
Zhaolin Ren
Huy Nguyen
Litu Rout
T. Nguyen
Nhat Ho
79
22
0
27 Sep 2022
Efficient Approximation of Gromov-Wasserstein Distance Using Importance
  Sparsification
Efficient Approximation of Gromov-Wasserstein Distance Using Importance Sparsification
Mengyu Li
Jun Yu
Hongteng Xu
Cheng Meng
72
15
0
26 May 2022
Scalable Optimal Transport in High Dimensions for Graph Distances,
  Embedding Alignment, and More
Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, and More
Johannes Klicpera
Marten Lienen
Stephan Günnemann
OT
76
13
0
14 Jul 2021
Large-scale optimal transport map estimation using projection pursuit
Large-scale optimal transport map estimation using projection pursuit
Cheng Meng
Y. Ke
Jingyi Zhang
Mengrui Zhang
Wenxuan Zhong
Ping Ma
OT
49
38
0
09 Jun 2021
Low-Rank Sinkhorn Factorization
Low-Rank Sinkhorn Factorization
M. Scetbon
Marco Cuturi
Gabriel Peyré
71
59
0
08 Mar 2021
On Robust Optimal Transport: Computational Complexity and Barycenter
  Computation
On Robust Optimal Transport: Computational Complexity and Barycenter Computation
Khang Le
Huy Le Nguyen
Quang H. Nguyen
Tung Pham
Hung Bui
Nhat Ho
OT
69
38
0
13 Feb 2021
Robust Optimal Transport with Applications in Generative Modeling and
  Domain Adaptation
Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptation
Yogesh Balaji
Ramalingam Chellappa
Soheil Feizi
OT
161
105
0
12 Oct 2020
Linear Time Sinkhorn Divergences using Positive Features
Linear Time Sinkhorn Divergences using Positive Features
M. Scetbon
Marco Cuturi
101
26
0
12 Jun 2020
Optimal Distributed Subsampling for Maximum Quasi-Likelihood Estimators
  with Massive Data
Optimal Distributed Subsampling for Maximum Quasi-Likelihood Estimators with Massive Data
Jun Yu
Haiying Wang
Mingyao Ai
Huiming Zhang
47
116
0
21 May 2020
Missing Data Imputation using Optimal Transport
Missing Data Imputation using Optimal Transport
Boris Muzellec
Julie Josse
Claire Boyer
Marco Cuturi
OT
66
126
0
10 Feb 2020
On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm
On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm
Khiem Pham
Khang Le
Nhat Ho
Tung Pham
Hung Bui
OT
96
84
0
09 Feb 2020
Max-Sliced Wasserstein Distance and its use for GANs
Max-Sliced Wasserstein Distance and its use for GANs
Ishani Deshpande
Yuan-Ting Hu
Ruoyu Sun
A. Pyrros
Nasir Siddiqui
Oluwasanmi Koyejo
Zhizhen Zhao
David A. Forsyth
Alex Schwing
GAN
56
201
0
11 Apr 2019
Learning with Batch-wise Optimal Transport Loss for 3D Shape Recognition
Learning with Batch-wise Optimal Transport Loss for 3D Shape Recognition
Lin Xu
Han Sun
Yuai Liu
3DPC
20
26
0
21 Mar 2019
Semi-dual Regularized Optimal Transport
Semi-dual Regularized Optimal Transport
Marco Cuturi
Gabriel Peyré
OT
152
51
0
13 Nov 2018
Interpolating between Optimal Transport and MMD using Sinkhorn
  Divergences
Interpolating between Optimal Transport and MMD using Sinkhorn Divergences
Jean Feydy
Thibault Séjourné
François-Xavier Vialard
S. Amari
A. Trouvé
Gabriel Peyré
OT
70
532
0
18 Oct 2018
Entropic optimal transport is maximum-likelihood deconvolution
Entropic optimal transport is maximum-likelihood deconvolution
Philippe Rigollet
Jonathan Niles-Weed
OT
75
78
0
14 Sep 2018
Learning Generative Models with Sinkhorn Divergences
Learning Generative Models with Sinkhorn Divergences
Aude Genevay
Gabriel Peyré
Marco Cuturi
OT
202
632
0
01 Jun 2017
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
78
595
0
26 May 2017
Multi-scale Orderless Pooling of Deep Convolutional Activation Features
Multi-scale Orderless Pooling of Deep Convolutional Activation Features
Yunchao Gong
Liwei Wang
Ruiqi Guo
Svetlana Lazebnik
184
1,090
0
07 Mar 2014
Stochastic Optimization with Importance Sampling
Stochastic Optimization with Importance Sampling
P. Zhao
Tong Zhang
117
346
0
13 Jan 2014
Near-Optimal Entrywise Sampling for Data Matrices
Near-Optimal Entrywise Sampling for Data Matrices
D. Achlioptas
Zohar Karnin
Edo Liberty
63
42
0
19 Nov 2013
Fast Computation of Wasserstein Barycenters
Fast Computation of Wasserstein Barycenters
Marco Cuturi
Arnaud Doucet
OT
126
743
0
16 Oct 2013
Completing Any Low-rank Matrix, Provably
Completing Any Low-rank Matrix, Provably
Yudong Chen
Srinadh Bhojanapalli
Sujay Sanghavi
Rachel A. Ward
125
116
0
12 Jun 2013
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation
  Distances
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances
Marco Cuturi
OT
222
4,294
0
04 Jun 2013
1