Training Implicit Generative Models via an Invariant Statistical Loss
Not on the map. Why?
Abstract (arXiv)
Implicit generative models have the capability to learn arbitrary complex data distributions. On the downside, training requires telling apart real data from artificially-generated ones using adversarial discriminators, leading to unstable training and mode-dropping issues. As reported by Zahee et al. (2017), even in the one-dimensional (1D) case, training a generative adversarial network (GAN) is challenging and often suboptimal. In this work, we develop a discriminator-free method for training one-dimensional (1D) generative implicit models and subsequently expand this method to accommodate multivariate cases. Our loss function is a discrepancy measure between a suitably chosen transformation of the model samples and a uniform distribution; hence, it is invariant with respect to the true distribution of the data. We first formulate our method for 1D random variables, providing an effective solution for approximate reparameterization of arbitrary complex distributions. Then, we consider the temporal setting (both univariate and multivariate), in which we model the conditional distribution of each sample given the history of the process. We demonstrate through numerical simulations that this new method yields promising results, successfully learning true distributions in a variety of scenarios and mitigating some of the well-known problems that state-of-the-art implicit methods present.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 24 of its 49 references that are in the map. First posted on arXiv 26 Feb 2024.
Builds on
24 of 49 references.
References · 24
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Improved Techniques for Training GANscited by 2,938
- 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,141
- 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
- 2017DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networkscited by 1,004
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 504
- 2021Autoregressive Denoising Diffusion Models for Multivariate Probabilistic Time Series Forecastingcited by 332
- 2015Generative Moment Matching Networkscited by 252
- 2017MMD GAN: Towards Deeper Understanding of Moment Matching Networkcited by 251
- 2017Generalization and Equilibrium in Generative Adversarial Nets (GANs)cited by 165
12 more
- 2015Training generative neural networks via Maximum Mean Discrepancy optimizationcited by 149
- 2020Multivariate Probabilistic Time Series Forecasting via Conditioned Normalizing Flowscited by 142
- 2016Learning in Implicit Generative Modelscited by 124
- 2018Generative Modeling using the Sliced Wasserstein Distancecited by 108
- 2017Adversarial Variational Bayes: Unifying Variational Autoencoders and Generative Adversarial Networkscited by 107
- 2017Do GANs actually learn the distribution? An empirical studycited by 23
- 2019Nonparametric Density Estimation & Convergence Rates for GANs under Besov IPM Lossescited by 22
- 2019Learning Implicit Generative Models by Matching Perceptual Featurescited by 18
- 2021Probabilistic Time Series Forecasting with Implicit Quantile Networkscited by 17
- 2021Function-space Inference with Sparse Implicit Processescited by 13
- 2021Deep Autoregressive Models with Spectral Attentioncited by 9
- 2023Understanding and contextualising diffusion modelscited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.
- 2024Robust training of implicit generative models for multivariate and heavy-tailed distributions with an invariant statistical losscited by 2
- 2025Explicit Density Approximation for Neural Implicit Samplers Using a Bernstein-Based Convex Divergencecited by 1
- 2026Approximating f-Divergences with Rank Statisticscited by 0
- 2026Approximating f-Divergences with Rank Statistics30 Jan 2026
- 2025Explicit Density Approximation for Neural Implicit Samplers Using a Bernstein-Based Convex Divergence5 Jun 2025
- 2024Robust training of implicit generative models for multivariate and heavy-tailed distributions with an invariant statistical loss29 Oct 2024