Pareto GAN: Extending the Representational Power of GANs to Heavy-Tailed Distributions
Generative adversarial networks (GANs) are often billed as "universal distribution learners", but precisely what distributions they can represent and learn is still an open question. Heavy-tailed distributions are prevalent in many different domains such as financial risk-assessment, physics, and epidemiology. We observe that existing GAN architectures do a poor job of matching the asymptotic behavior of heavy-tailed distributions, a problem that we show stems from their construction. Additionally, when faced with the infinite moments and large distances between outlier points that are characteristic of heavy-tailed distributions, common loss functions produce unstable or near-zero gradients. We address these problems with the Pareto GAN. A Pareto GAN leverages extreme value theory and the functional properties of neural networks to learn a distribution that matches the asymptotic behavior of the marginal distributions of the features. We identify issues with standard loss functions and propose the use of alternative metric spaces that enable stable and efficient learning. Finally, we evaluate our proposed approach on a variety of heavy-tailed datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
EpidemiologyOpen-Ended Question AnsweringSimilar Papers 제목 키워드 기반
Diversification for infinite-mean Pareto models without risk aversion
We study stochastic dominance between portfolios of independent and identically distributed (iid) extremely heavy-tailed (i.e., infinite-mean) Pareto random variables. With the notion of majorization order, we show that …
Risk exchange under infinite-mean Pareto models
We study the optimal decisions of agents who aim to minimize their risks by allocating their positions over extremely heavy-tailed (i.e., infinite-mean) and possibly dependent losses. The loss distributions of our focus …
Robust training of implicit generative models for multivariate and heavy-tailed distributions with an invariant statistical loss
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 discriminato…
Tail Annealing for Heavy-Tailed Flow Matching
Standard generative models struggle with heavy-tailed data: Lipschitz architectures cannot produce power-law tails from Gaussian noise, and interpolating between heavy-tailed data and Gaussians is ill-posed. We propose a…
Gaussian Splatting Decoder for 3D-aware Generative Adversarial Networks
NeRF-based 3D-aware Generative Adversarial Networks (GANs) like EG3D or GIRAFFE have shown very high rendering quality under large representational variety. However, rendering with Neural Radiance Fields poses challenges…
3DGSDecoderDiversityNeRF