paper-with-me

홈 › Papers

Training Implicit Generative Models via an Invariant Statistical Loss

2024-02-26 · José Manuel de Frutos, Pablo M. Olmos, Manuel A. Vázquez, Joaquín Míguez

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.

📄 PDF Abstract BibTeX arXiv:2402.16435

Code (1)

josemanuel22/isl 공식 구현

Tasks

Generative Adversarial Network

Similar Papers 제목 키워드 기반

Robust training of implicit generative models for multivariate and heavy-tailed distributions with an invariant statistical loss

2024-10-29 · José Manuel de Frutos, Manuel A. Vázquez, Pablo Olmos, Joaquín Míguez

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…

Explicit Density Approximation for Neural Implicit Samplers Using a Bernstein-Based Convex Divergence

2025-06-05 · José Manuel de Frutos, Manuel A. Vázquez, Pablo M. Olmos, Joaquín Míguez

Rank-based statistical metrics, such as the invariant statistical loss (ISL), have recently emerged as robust and practically effective tools for training implicit generative models. In this work, we introduce dual-ISL, …

Nonparametric Density Estimation under Adversarial Losses

2018-05-22 · NeurIPS 2018 12 · Shashank Singh, Ananya Uppal, Boyue Li, Chun-Liang Li 외

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…

Density Estimation

Training neural operators to preserve invariant measures of chaotic attractors

2023-06-01 · NeurIPS 2023 11 · Ruoxi Jiang, Peter Y. Lu, Elena Orlova, Rebecca Willett

Chaotic systems make long-horizon forecasts difficult because small perturbations in initial conditions cause trajectories to diverge at an exponential rate. In this setting, neural operators trained to minimize squared …

Contrastive Learning

Statistical Guarantees of Group-Invariant GANs

2023-05-22 · Ziyu Chen, Markos A. Katsoulakis, Luc Rey-Bellet, Wei Zhu

Group-invariant generative adversarial networks (GANs) are a type of GANs in which the generators and discriminators are hardwired with group symmetries. Empirical studies have shown that these networks are capable of le…

Data Augmentation