Robust training of implicit generative models for multivariate and heavy-tailed distributions with an invariant statistical loss
Not on the map. Why?
Abstract (arXiv)
Traditional implicit generative models are capable of learning highly complex data distributions. However, their training involves distinguishing real data from synthetically generated data using adversarial discriminators, which can lead to unstable training dynamics and mode dropping issues. In this work, we build on the textitinvariant statistical loss (ISL) method introduced in citede2024training, and extend it to handle heavy-tailed and multivariate data distributions. The data generated by many real-world phenomena can only be properly characterised using heavy-tailed probability distributions, and traditional implicit methods struggle to effectively capture their asymptotic behavior. To address this problem, we introduce a generator trained with ISL, that uses input noise from a generalised Pareto distribution (GPD). We refer to this generative scheme as Pareto-ISL for conciseness. Our experiments demonstrate that Pareto-ISL accurately models the tails of the distributions while still effectively capturing their central characteristics. The original ISL function was conceived for 1D data sets. When the actual data is n-dimensional, a straightforward extension of the method was obtained by targeting the n marginal distributions of the data. This approach is computationally infeasible and ineffective in high-dimensional spaces. To overcome this, we extend the 1D approach using random projections and define a new loss function suited for multivariate data, keeping problems tractable by adjusting the number of projections. We assess its performance in multidimensional generative modeling and explore its potential as a pretraining technique for generative adversarial networks (GANs) to prevent mode collapse, reporting promising results and highlighting its robustness across various hyperparameter settings.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 46 of its 79 references that are in the map. First posted on arXiv 29 Oct 2024.
Builds on
46 of 79 references.
References · 46
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
- 2019Analyzing and Improving the Image Quality of StyleGANcited by 3,580
- 2018Large Scale GAN Training for High Fidelity Natural Image Synthesiscited by 2,609
- 2017Improved Training of Wasserstein GANscited by 2,223
- 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,141
- 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
- 2016Density estimation using Real NVPcited by 2,029
- 2021Autoformer: Decomposition Transformers with Auto-Correlation for Long-Term Series Forecastingcited by 1,654
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
- 2022Are Transformers Effective for Time Series Forecasting?cited by 1,400
34 more
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
- 2020Training Generative Adversarial Networks with Limited Datacited by 1,184
- 2021Alias-Free Generative Adversarial Networkscited by 1,181
- 2016Least Squares Generative Adversarial Networkscited by 1,000
- 2019An Introduction to Variational Autoencoderscited by 997
- 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
- 2018Which Training Methods for GANs do actually Converge?cited by 672
- 2017Towards Principled Methods for Training Generative Adversarial Networkscited by 460
- 2018Assessing Generative Models via Precision and Recallcited by 401
- 2016Understanding Deep Neural Networks with Rectified Linear Unitscited by 253
- 2017MMD GAN: Towards Deeper Understanding of Moment Matching Networkcited by 251
- 2016Unrolled Generative Adversarial Networkscited by 208
- 2019Generalized Sliced Wasserstein Distancescited by 205
- 2017VEEGAN: Reducing Mode Collapse in GANs using Implicit Variational Learningcited by 199
- 2021Not All Images are Worth 16x16 Words: Dynamic Transformers for Efficient Image Recognitioncited by 143
- 2016Learning in Implicit Generative Modelscited by 124
- 2019Max-Sliced Wasserstein Distance and its use for GANscited by 118
- 2017The Cramer Distance as a Solution to Biased Wasserstein Gradientscited by 116
- 2018Generative Modeling using the Sliced Wasserstein Distancecited by 108
- 2019Subspace Robust Wasserstein Distancescited by 89
- 2020Statistical and Topological Properties of Sliced Probability Divergencescited by 83
- 2018Sliced-Wasserstein Flows: Nonparametric Generative Modeling via Optimal Transport and Diffusionscited by 77
- 2016Generative Multi-Adversarial Networkscited by 60
- 2023normflows: A PyTorch Package for Normalizing Flowscited by 56
- 2018Blessing of dimensionality: mathematical foundations of the statistical physics of datacited by 55
- 2021Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projectionscited by 33
- 2017Bayesian GANcited by 31
- 2020ExGAN: Adversarial Generation of Extreme Samplescited by 28
- 2018BourGAN: Generative Networks with Metric Embeddingscited by 22
- 2021Pareto GAN: Extending the Representational Power of GANs to Heavy-Tailed Distributionscited by 22
- 2019Copula & Marginal Flows: Disentangling the Marginal from its Jointcited by 17
- 2023Sample Complexity of Probability Divergences under Group Symmetrycited by 13
- 2021MCL-GAN: Generative Adversarial Networks with Multiple Specialized Discriminatorscited by 11
- 2024Training Implicit Generative Models via an Invariant Statistical Losscited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.