Fetching the paper…
Reading the bibliography…
Minimum expected distance estimation (MEDE) algorithms have been widely used for probabilistic models with intractable likelihood functions and they have become increasingly popular due to their use in implicit generative modeling (e.g.
The minimum distance method
J. Wolfowitz · 1957
Earlier work this paper cites.
Measurable selections of extrema
L. D. Brown and R. Purves · 1973
Earlier work this paper cites.
The minimum distance method of testing
D. Pollard · 1980
Earlier work this paper cites.
Stable Non-Gaussian Random Processes: Stochastic Models with Infinite Variance
G. Samorodnitsky and M.S. Taqqu · 1994
Earlier work this paper cites.
Foundations of modern probability
O. Kallenberg · 1997
Earlier work this paper cites.
Mass transportation problems. Vol. I
S. T. Rachev and L. Rüschendorf · 1998
Earlier work this paper cites.
Convergence of probability measures
Patrick Billingsley · 1999
Earlier work this paper cites.
Central limit theorems for the wasserstein distance between the empirical and the true distributions
Eustasio del Barrio, Evarist Giné, and Carlos Matrán · 1999
Earlier work this paper cites.
Real analysis
G. B. Folland · 1999
Earlier work this paper cites.
Infinite Dimensional Analysis: A Hitchhiker’s Guide
C.D. Aliprantis, K.C. Border, and K.C. Border · 1999
Earlier work this paper cites.
On minimum kantorovich distance estimators
Federico Bassetti, Antonella Bodini, and Eugenio Regazzini · 2006
Earlier work this paper cites.
Measure Theory
V.I. Bogachev · 2007
Earlier work this paper cites.
Optimal Transport: Old and New
Cédric Villani · 2008
Earlier work this paper cites.
An empirical central limit theorem in l1 for stationary sequences
Sophie Dede · 2009
Earlier work this paper cites.
Variational Analysis
R.T. Rockafellar, M. Wets, and R.J.B. Wets · 2009
Earlier work this paper cites.
Statistical Inference: The Minimum Distance Approach
A. Basu, H. Shioya, and C. Park · 2011
Cited alongside, same era.
Wasserstein barycenter and its application to texture mixing
J. Rabin, G. Peyré, J. Delon, and M. Bernot · 2012
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Cited alongside, same era.
Unidimensional and Evolution Methods for Optimal Transportation
Nicolas Bonnotte · 2013
Cited alongside, same era.
Multivariate elliptically contoured stable distributions: theory and estimation
John P. Nolan · 2013
Cited alongside, same era.
Fractals and Scaling in Finance: Discontinuity, Concentration, Risk. Selecta Volume E
B. B. Mandelbrot · 2013
Cited alongside, same era.
From optimal transport to generative modeling: the vegan cookbook
Olivier Bousquet, Sylvain Gelly, Ilya Tolstikhin, Carl-Johann Simon-Gabriel, and Bernhard Schoelkopf · 2017
Later among the works it cites.
Approximation and convergence properties of generative adversarial learning
Shuang Liu, Olivier Bousquet, and Kamalika Chaudhuri · 2017
Later among the works it cites.
Alpha-stable multichannel audio source separation
Simon Leglaive, Umut Şimşekli, Antoine Liutkus, Roland Badeau, and Gaël Richard · 2017
Later among the works it cites.
Giorgio Patrini, Marcello Carioni, Patrick Forre, Samarth Bhargav, Max Welling, Rianne van den Berg, Tim Genewein, and Frank Nielsen · 2018
Later among the works it cites.
Banach Wasserstein GAN
Jonas Adler and Sebastian Lunz · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sliced and Radon Wasserstein barycenters of measures
N. Bonneel, J. Rabin, G. Peyré, and H. Pfister · 2015
Cited alongside, same era.
Alpha-stable matrix factorization
U. Şimşekli, A. Liutkus, and A. T. Cemgil · 2015
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P. Kingma and Jimmy Ba · 2015
Cited alongside, same era.
Sliced and Radon Wasserstein Barycenters of Measures
Nicolas Bonneel, Julien Rabin, Gabriel Peyré, and Hanspeter Pfister · 2015
Cited alongside, same era.
Wasserstein generative adversarial networks
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Cited alongside, same era.
Ilya Tolstikhin, Olivier Bousquet, Sylvain Gelly, and Bernhard Schoelkopf · 2017
Cited alongside, same era.
Generative modeling using the sliced Wasserstein distance
Ishan Deshpande, Ziyu Zhang, and Alexander G Schwing · 2018
Later among the works it cites.
On parameter estimation with the Wasserstein distance
E. Bernton, P. E. Jacob, M. Gerber, and C. P. Robert · 2019
Closest in time.
Sliced Wasserstein auto-encoders
Soheil Kolouri, Phillip E. Pope, Charles E. Martin, and Gustavo K. Rohde · 2019
Closest in time.
Sliced-Wasserstein flows: Nonparametric generative modeling via optimal transport and diffusions
Antoine Liutkus, Umut Şimşekli, Szymon Majewski, Alain Durmus, and Fabian-Robert Stoter · 2019
Closest in time.
Sliced wasserstein generative models
Jiqing Wu, Zhiwu Huang, Wen Li, Janine Thoma, and Luc Van Gool · 2019
Closest in time.
Max-Sliced Wasserstein distance and its use for GANs
Ishan Deshpande, Yuan-Ting Hu, Ruoyu Sun, Ayis Pyrros, Nasir Siddiqui, Sanmi Koyejo, Zhizhen Zhao, David Forsyth, and Alexander Schwing · 2019
Closest in time.
Computational optimal transport
G. Peyré, M. Cuturi, et al · 2019
Closest in time.
Subspace robust wasserstein distances
François-Pierre Paty and Marco Cuturi · 2019
Closest in time.
Generalized Sliced Wasserstein Distances
S. Kolouri, K. Nadjahi, U. Simsekli, R. Badeau, and G. K. Rohde · 2019
Closest in time.