Fetching the paper…
Reading the bibliography…
We study minimax convergence rates of nonparametric density estimation under a large class of loss functions called "adversarial losses", which, besides classical $\mathcal{L}^p$ losses, includes maximum mean discrepancy (MMD), Wasserstein distance, and total variation distance.
Sulla determinazione empirica di una lgge di distribuzione
Andrey Kolmogorov · 1933
Earlier work this paper cites.
Table for estimating the goodness of fit of empirical distributions
Nickolay Smirnov · 1948
Earlier work this paper cites.
Theory of reproducing kernels
Nachman Aronszajn · 1950
Earlier work this paper cites.
On a space of completely additive functions
Leonid Vasilevich Kantorovich and Gennady S Rubinstein · 1958
Earlier work this paper cites.
Speeds of metric probability convergence
RM Dudley · 1972
Earlier work this paper cites.
Monte Carlo methods of inference for implicit statistical models
Peter J Diggle and Richard J Gratton · 1984
Earlier work this paper cites.
Empirical processes: theory and applications
David Pollard · 1990
Earlier work this paper cites.
Two-sample test statistics for measuring discrepancies between two multivariate probability density functions using kernel-based density estimates
Niall H Anderson, Peter Hall, and D Michael Titterington · 1994
Earlier work this paper cites.
Understanding the Metropolis-Hastings algorithm
Siddhartha Chib and Edward Greenberg · 1995
Earlier work this paper cites.
Density estimation by wavelet thresholding
David L Donoho, Iain M Johnstone, Gérard Kerkyacharian, and Dominique Picard · 1996
Earlier work this paper cites.
Scale-sensitive dimensions, uniform convergence, and learnability
Noga Alon, Shai Ben-David, Nicolo Cesa-Bianchi, and David Haussler · 1997
Earlier work this paper cites.
Integral probability metrics and their generating classes of functions
Alfred Müller · 1997
Earlier work this paper cites.
Asymptotic nonequivalence of nonparametric experiments when the smoothness index is 1 / 2 1/2
Lawrence D Brown, Cun-Hui Zhang, et al · 1998
Earlier work this paper cites.
Learnability in hilbert spaces with reproducing kernels
Shahar Mendelson · 2002
Earlier work this paper cites.
A new metric for probability distributions
Dominik Maria Endres and Johannes E Schindelin · 2003
Earlier work this paper cites.
Monte Carlo methods
Christian P Robert · 2004
Earlier work this paper cites.
Scattered data approximation , volume 17
Holger Wendland · 2004
Earlier work this paper cites.
All of Nonparametric Statistics
Larry Wasserman · 2006
Earlier work this paper cites.
Concentration inequalities and model selection , volume 6
Pascal Massart · 2007
Earlier work this paper cites.
Practical signal processing
Mark Owen · 2007
Earlier work this paper cites.
Measuring and testing dependence by correlation of distances
Gábor J Székely, Maria L Rizzo, Nail K Bakirov, et al · 2007
Earlier work this paper cites.
Optimal transport: old and new , volume 338
Cédric Villani · 2008
Earlier work this paper cites.
Neural network learning: Theoretical foundations
Martin Anthony and Peter L Bartlett · 2009
Earlier work this paper cites.
Distribution matching for transduction
Novi Quadrianto, James Petterson, and Alex J Smola · 2009
Cited alongside, same era.
Introduction to nonparametric estimation
Alexandre B Tsybakov · 2009
Cited alongside, same era.
Orthogonal series density estimation
Sam Efromovich · 2010
Cited alongside, same era.
Non-parametric estimation of integral probability metrics
Bharath K Sriperumbudur, Kenji Fukumizu, Arthur Gretton, Bernhard Schölkopf, and Gert RG Lanckriet · 2010
Cited alongside, same era.
Reproducing kernel Hilbert spaces in probability and statistics
Alain Berlinet and Christine Thomas-Agnan · 2011
Cited alongside, same era.
Learning probability measures with respect to optimal transport metrics
Guillermo Canas and Lorenzo Rosasco · 2012
Cited alongside, same era.
Wasserstein generative adversarial networks
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Later among the works it cites.
Generalization and equilibrium in generative adversarial nets (GANs)
Sanjeev Arora, Rong Ge, Yingyu Liang, Tengyu Ma, and Yi Zhang · 2017
Later among the works it cites.
Geometrical insights for implicit generative modeling
Leon Bottou, Martin Arjovsky, David Lopez-Paz, and Maxime Oquab · 2017
Later among the works it cites.
Hypothesis transfer learning via transformation functions
Simon S Du, Jayanth Koushik, Aarti Singh, and Barnabás Póczos · 2017
Later among the works it cites.
Improved training of Wasserstein GANs
Ishaan Gulrajani, Faruk Ahmed, Martin Arjovsky, Vincent Dumoulin, and Aaron C Courville · 2017
Later among the works it cites.
A first course in Sobolev spaces
Giovanni Leoni · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A kernel two-sample test
Arthur Gretton, Karsten M Borgwardt, Malte J Rasch, Bernhard Schölkopf, and Alexander Smola · 2012
Cited alongside, same era.
On the empirical estimation of integral probability metrics
Bharath K Sriperumbudur, Kenji Fukumizu, Arthur Gretton, Bernhard Schölkopf, Gert RG Lanckriet, et al · 2012
Cited alongside, same era.
Adaptivity to local smoothness and dimension in kernel regression
Samory Kpotufe and Vikas Garg · 2013
Cited alongside, same era.
On adaptive minimax density estimation on R d R^{d}
Alexander Goldenshluger and Oleg Lepski · 2014
Cited alongside, same era.
Generative adversarial nets
Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio · 2014
Cited alongside, same era.
Auto-encoding variational bayes
Diederik P Kingma and Max Welling · 2014
Cited alongside, same era.
Later among the works it cites.
MMD GAN: Towards deeper understanding of moment matching network
Chun-Liang Li, Wei-Cheng Chang, Yu Cheng, Yiming Yang, and Barnabás Póczos · 2017
Later among the works it cites.
How well can generative adversarial networks (GAN) learn densities: A nonparametric view
Tengyuan Liang · 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.
Youssef Mroueh, Chun-Liang Li, Tom Sercu, Anant Raj, and Yu Cheng · 2017
Later among the works it cites.
Gradient descent GAN optimization is locally stable
Vaishnavh Nagarajan and J Zico Kolter · 2017
Later among the works it cites.
On wasserstein two-sample testing and related families of nonparametric tests
Aaditya Ramdas, Nicolás García Trillos, and Marco Cuturi · 2017
Later among the works it cites.
Density estimation in infinite dimensional exponential families
Bharath Sriperumbudur, Kenji Fukumizu, Arthur Gretton, Aapo Hyvärinen, and Revant Kumar · 2017
Later among the works it cites.
Generative models and model criticism via optimized maximum mean discrepancy
D. Sutherland, H-Y Tung, H. Strathmann, S. De, A. Ramdas, A. Smola, and A. Gretton · 2017
Later among the works it cites.
Minimax estimation of kernel mean embeddings
Ilya Tolstikhin, Bharath K Sriperumbudur, and Krikamol Muandet · 2017
Later among the works it cites.
Jonathan Weed and Francis Bach · 2017
Later among the works it cites.
Error bounds for approximations with deep ReLU networks
Dmitry Yarotsky · 2017
Later among the works it cites.
Deep lipschitz networks and dudley GANs, 2018
Ehsan Abbasnejad, Javen Shi, and Anton van den Hengel · 2018
Closest in time.
Jing Lei · 2018
Closest in time.
Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks
Tengyuan Liang and James Stokes · 2018
Closest in time.
Minimax distribution estimation in Wasserstein distance
Shashank Singh and Barnabás Póczos · 2018
Closest in time.
Minimax estimation of quadratic Fourier functionals
Shashank Singh, Bharath K Sriperumbudur, and Barnabás Póczos · 2018
Closest in time.