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. 2101.05380
25
26

A Dimension-free Computational Upper-bound for Smooth Optimal Transport Estimation

13 January 2021
A. Vacher
Boris Muzellec
Alessandro Rudi
Francis R. Bach
François-Xavier Vialard
    OT
ArXivPDFHTML
Abstract

It is well-known that plug-in statistical estimation of optimal transport suffers from the curse of dimensionality. Despite recent efforts to improve the rate of estimation with the smoothness of the problem, the computational complexity of these recently proposed methods still degrades exponentially with the dimension. In this paper, thanks to an infinite-dimensional sum-of-squares representation, we derive a statistical estimator of smooth optimal transport which achieves a precision ε\varepsilonε from O~(ε−2)\tilde{O}(\varepsilon^{-2})O~(ε−2) independent and identically distributed samples from the distributions, for a computational cost of O~(ε−4)\tilde{O}(\varepsilon^{-4})O~(ε−4) when the smoothness increases, hence yielding dimension-free statistical and computational rates, with potentially exponentially dimension-dependent constants.

View on arXiv
Comments on this paper