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. 2008.10249
  4. Cited By
Information Constrained Optimal Transport: From Talagrand, to Marton, to
  Cover

Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover

24 August 2020
Yikun Bai
Xiugang Wu
Ayfer Özgür
    OT
ArXivPDFHTML

Papers citing "Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover"

5 / 5 papers shown
Title
Sinkhorn Distributionally Robust Optimization
Sinkhorn Distributionally Robust Optimization
Jie Wang
Rui Gao
Yao Xie
87
37
0
24 Sep 2021
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 theorem
Gonzalo E. Mena
Jonathan Niles-Weed
OT
48
166
0
28 May 2019
Sample Complexity of Sinkhorn divergences
Sample Complexity of Sinkhorn divergences
Aude Genevay
Lénaïc Chizat
Francis R. Bach
Marco Cuturi
Gabriel Peyré
OT
75
288
0
05 Oct 2018
Optimal Transport for Domain Adaptation
Optimal Transport for Domain Adaptation
Nicolas Courty
Rémi Flamary
D. Tuia
A. Rakotomamonjy
OT
OOD
130
1,119
0
02 Jul 2015
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation
  Distances
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances
Marco Cuturi
OT
203
4,258
0
04 Jun 2013
1