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. 1911.00730
  4. Cited By
Estimating Certain Integral Probability Metric (IPM) is as Hard as
  Estimating under the IPM

Estimating Certain Integral Probability Metric (IPM) is as Hard as Estimating under the IPM

2 November 2019
Tengyuan Liang
ArXiv (abs)PDFHTML

Papers citing "Estimating Certain Integral Probability Metric (IPM) is as Hard as Estimating under the IPM"

6 / 6 papers shown
Title
Computational Optimal Transport
Computational Optimal Transport
Gabriel Peyré
Marco Cuturi
OT
244
2,158
0
01 Mar 2018
Demystifying MMD GANs
Demystifying MMD GANs
Mikolaj Binkowski
Danica J. Sutherland
Michael Arbel
Arthur Gretton
EGVM
206
1,502
0
04 Jan 2018
Are GANs Created Equal? A Large-Scale Study
Are GANs Created Equal? A Large-Scale Study
Mario Lucic
Karol Kurach
Marcin Michalski
Sylvain Gelly
Olivier Bousquet
EGVM
122
1,013
0
28 Nov 2017
Sharp asymptotic and finite-sample rates of convergence of empirical
  measures in Wasserstein distance
Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
Jonathan Niles-Weed
Francis R. Bach
213
421
0
01 Jul 2017
Wasserstein GAN
Wasserstein GAN
Martín Arjovsky
Soumith Chintala
Léon Bottou
GAN
192
4,834
0
26 Jan 2017
Testing composite hypotheses, Hermite polynomials and optimal estimation
  of a nonsmooth functional
Testing composite hypotheses, Hermite polynomials and optimal estimation of a nonsmooth functional
T. Tony Cai
Mark G. Low
122
86
0
16 May 2011
1