Orthogonal Wasserstein GANs improve image quality without gradient norm regularization.
problem Wasserstein-GANs' gradient norm regularization limits the distribution's fidelity.
method Substituted gradient norm regularization with orthogonality constraints on weight matrices.
result Orthogonal Wasserstein GANs achieve better image quality and generalization.
The paper introduces a new Wasserstein distance for approximating posteriors in inverse problems.
problem Approximating posterior measures in inverse problems using conditional Wasserstein distances.
method Introduces a conditional Wasserstein distance with restricted couplings and derives its dual.
result Shows that conditional Wasserstein GANs can yield favorable properties for posterior sampling.
Generative models create paintings that match training data.
problem Creating realistic paintings using machine learning.
method Used Spectral Normalization GAN (SN-GAN) and SN-GAN with Gradient Penalty to generate paintings.
result SN-GAN produced paintings most comparable to the training dataset.
GANICE improves GAN-based causal inference by minimizing averaged Wasserstein risk.
problem Estimating interventional outcome distributions and quantiles in causal inference.
method GANICE uses extended Wasserstein distance and a cellwise critic to minimize averaged Wasserstein risk.
result GANICE achieves minimax optimality and consistently outperforms existing methods.
Paper relaxes the Lipschitz constraint in WGANs to improve performance.
problem WGANs do not always outperform other GAN variants due to imperfect implementation of the Lipschitz condition.
method Proposes a new dual form of Wasserstein distance (Sobolev duality) that relaxes the Lipschitz constraint but maintains gradient property.
result SWGAN, based on Sobolev duality, outperforms existing methods in experiments.
Wasserstein GANs fail to approximate Wasserstein distance, leading to their success.
problem Approximating Wasserstein distance in deep generative models.
method Analysis of differences between theoretical setup and training reality.
result Wasserstein GANs' success is due to their failure to approximate Wasserstein distance.
Proposes Sig-Wasserstein GANs for generating time series with temporal dependence.
problem Challenges in generating time series with temporal dependence and high-dimensional data.
method Integrates Wasserstein-GANs with signature feature extraction for conditional time series generation.
result Consistently outperforms state-of-the-art benchmarks in similarity and predictive ability.
Vanilla GANs are connected to Wasserstein distance for better understanding.
problem Understanding the statistical properties of Vanilla GANs.
method Connecting Vanilla GANs to Wasserstein distance and proving an oracle inequality.
result An oracle inequality for Vanilla GANs in Wasserstein distance is obtained.
Lipschitz GANs solve gradient uninformativeness in GANs.
problem Gradient uninformativeness in GANs.
method Introduce Lipschitz constraint on the discriminative function space.
result Lipschitz GANs eliminate gradient uninformativeness and generate better quality samples.
In this paper, we investigate the underlying factor that leads to failure and success in the training of GANs. We study the property of the optimal discriminative function and show that in many GANs, the gradient from the optimal discriminative function is not reliable, which turns out to be the fundamental cause of fa…
HW2MP-GAN tackles ancient handwritten text recognition.
problem Automatic text recognition from ancient handwritten records.
method Conditional Generative Adversarial Network (HW2MP-GAN) with Sliced Wasserstein distance and U-Net architectures.
result HW2MP-GAN outperforms state-of-the-art models in image-to-image translation and handwritten recognition.
Paper bridges f-GANs and WGANs for better image generation.
problem Learning high-dimensional distributions using GANs.
method List constraints, minimize Lagrangian relaxation, propose KL-Wasserstein GAN.
result Empirical success on synthetic and real-world image generation benchmarks.
Wasserstein GANs are shown to have hidden convexity, enabling exact solutions with convex optimization.
problem Non-convex and non-concave optimization in GANs.
method Convex duality analysis of Wasserstein GANs with two-layer neural network discriminators.
result Wasserstein GANs can be solved exactly with convex optimization under certain conditions.
Wasserstein GANs use different p-metrics to improve model performance.
problem Improving stability and performance of Wasserstein GANs.
method Introduce (q,p)-Wasserstein GANs using various p-metrics. result Different p-metrics can notably improve GAN performance. Generative adversarial networks (GANs) have received a tremendous amount of attention in the past few years, and have inspired applications addressing a wide range of problems. Despite its great potential, GANs are difficult to train. Recently, a series of papers (Arjovsky & Bottou, 2017a; Arjovsky et al. 2017b; and Gu…
Generative Adversarial Networks improve credit card fraud detection.
problem Detecting fraudulent credit card transactions accurately.
method Using GANs to generate synthetic data for oversampling.
result Wasserstein-GAN produces more realistic fraudulent transactions.
Wasserstein distance improves GANs by reducing training difficulties.
problem Training difficulties and arbitrary hyperparameters in GANs.
method Estimating Wasserstein distance for generative modeling.
result Various ways to estimate Wasserstein distance for generative models.
Improved GAN performance using higher-order Wasserstein moments.
problem Stabilizing and enhancing GANs for better mode coverage and stability.
method Deriving and training a GAN with a modified Wasserstein distance using higher-order moments.
result Training a GAN with higher-order Wasserstein moments improves performance, even with increased computational cost.
Wasserstein GAN improves anomaly detection on time series data.
problem Anomaly detection in time series datasets.
method Wasserstein GAN for learning normal data distribution and anomaly detection using a stacked encoder.
result W-GAN with encoder achieves state-of-the-art anomaly detection scores on MNIST and multi-variate time series.
Max-sliced Wasserstein distance improves GAN training on high-dimensional images.
problem Improving GAN training on high-dimensional distributions with reduced hyper-parameters and training time.
method Developed max-sliced Wasserstein distance to reduce projection complexity and sample complexity.
result Trains GANs on high-dimensional images up to 256x256 resolution.
WGAN uses a smoother metric to train GANs better.
problem Difficulty in training GANs.
method Introducing Wasserstein GAN to improve GAN training.
result Wasserstein GAN improves training stability and effectiveness.
Adversarial Lipschitz Regularization improves Wasserstein GANs without gradient norm penalties.
problem Training stability and sample quality issues in Wasserstein GANs.
method Explicit Lipschitz penalty using adversarial training.
result Explicit Lipschitz penalty leads to competitive performance in Wasserstein GANs.
New findings suggest minimax optimality doesn't guarantee distribution learning for GANs.
problem Understanding when GANs can truly learn the underlying distribution.
method Using cryptographic assumptions and ReLU network generators, the paper shows that achieving minimax optimality is insufficient for distribution learning.
result Achieving minimax optimality is insufficient for distribution learning in the usual statistical sense.
DAT-CGAN improves time series generation for better decision support.
problem Generating accurate time series data for decision support.
method DAT-CGAN uses multi-Wasserstein loss and overlapped block-sampling for improved sample efficiency.
result DAT-CGAN outperforms GAN-based baselines in generating data relevant to decision processes.
The study improves PAC-Bayesian bounds for adversarial generative models.
problem Improving generalization bounds for adversarial generative models.
method Extending PAC-Bayesian theory to generative models, developing bounds for Wasserstein and total variation distances.
result New training objectives for Wasserstein and Energy-Based GANs.
Wasserstein GAN can approach PCA solution for linear Gaussian data.
problem Understanding GANs' optimality and their relation to PCA.
method Linear-generator Gaussian-data setting, theoretical analysis of GANs and PCA.
result Wasserstein GAN can approach PCA solution in the limit of sample size.
Paper proposes robust estimators for GANs under Wasserstein contamination.
problem Robust estimation of distributions under contamination.
method Wasserstein GAN-based estimators for location, covariance, and regression.
result Proposed estimators are minimax optimal in many scenarios.
Generates realistic stock market order streams using GANs.
problem Creating high-fidelity stock market data.
method Conditional Wasserstein GAN with auction mechanism and order-book augmentation.
result Generated data is close to real market data.
A GAN method for stochastic boundary conditions in fast dynamics.
problem Uncertainty quantification in fast dynamics and wave propagation.
method Physics-informed GANs for stochastic boundary conditions.
result Improved convergence and better stochastic boundary conditions.
The paper explores multidimensional critic output in GANs, improving convergence and diversity.
problem Underexplored in GANs literature, multidimensional critic output.
method Generalized Wasserstein GAN framework, SRVT block, maximal p-centrality discrepancy.
result High-dimensional critic output improves GAN performance in convergence and diversity.
We investigate the training and performance of generative adversarial networks using the Maximum Mean Discrepancy (MMD) as critic, termed MMD GANs. As our main theoretical contribution, we clarify the situation with bias in GAN loss functions raised by recent work: we show that gradient estimators used in the optimizat…
The study provides statistical theory for WGANs in time series forecasting.
problem Statistical analysis of WGANs for time series forecasting.
method Statistical theory and upper bounds for excess Bayes risk, weak convergence, and confidence intervals.
result Developed confidence intervals for time series forecasting using WGANs.
Generative Adversarial Networks (GANs) produce systematically better quality samples when class label information is provided., i.e. in the conditional GAN setup. This is still observed for the recently proposed Wasserstein GAN formulation which stabilized adversarial training and allows considering high capacity netwo…
Neural SDEs improve time series generation efficiency.
problem High memory and computational costs in GANs for time series.
method Conditional Neural Stochastic Differential Equations (SDEs).
result More memory efficient and faster than traditional methods.
iWGAN improves GANs by stabilizing training and preventing mode collapse.
problem Stable and effective training of GANs with mode collapse.
method iWGAN combines auto-encoders and WGANs using iterative primal dual optimization.
result iWGAN provides a clear stopping criterion and mitigates mode collapse.
New time series generation models improve accuracy and correlation identification.
problem Generating accurate and correlated time series from limited data.
method Conditional Euler Generator (CEGEN) using Euler discretization of SDEs and Wasserstein metrics.
result CEGEN outperforms state-of-the-art models on various metrics and real-world datasets.
MonoFlow rethinks GANs using Wasserstein gradient flows.
problem Inconsistencies between GAN theory and practice.
method Unified generative modeling framework based on Wasserstein gradient flows.
result Adversarial training can be seen as particle flow optimization.
MWGAN tackles multi-marginal matching problem with Wasserstein GAN.
problem Learning mappings to match a source domain to multiple target domains with cross-domain correlations.
method Develops a novel Multi-marginal Wasserstein GAN (MWGAN) with inner- and inter-domain constraints to minimize Wasserstein distance.
result Theoretical and empirical evaluations show MWGAN's effectiveness on balanced and imbalanced translation tasks.
SGD finds global optima in WGANs for 1-layer generators.
problem Training GANs with WGANs requires global optimality, which is hard.
method Used SGD to train 1-layer generator networks in WGANs.
result SGD converges to global solution in polynomial time and sample complexity.
Survey of GANs and autoencoders, addressing mode collapse and likelihood issues.
problem Addressing mode collapse and likelihood issues in GANs and autoencoders.
method Explains various GAN and autoencoder variants, their applications, and methods to resolve issues.
result Various methods to resolve mode collapse and improve likelihood in GANs and autoencoders.
Simplified GAN model shows how discriminator improves generalization.
problem Understanding GAN's generalization ability and avoiding memorization.
method Analyzing a simplified GAN model with early stopping and Wasserstein metric.
result Generalization error escapes from curse of dimensionality with early stopping.
Optimal transport relaxations improve Wasserstein GAN training efficiency.
problem Training inefficiency in Wasserstein GANs.
method Optimal transport relaxations with a minimization step over a small region.
result Running time improvements with no performance degradation.
Despite the growing prominence of generative adversarial networks (GANs), optimization in GANs is still a poorly understood topic. In this paper, we analyze the "gradient descent" form of GAN optimization i.e., the natural setting where we simultaneously take small gradient steps in both generator and discriminator par…
Paper introduces a new method to improve GANs by leveraging the discriminator's energy.
problem Improving the quality of generated samples in GANs.
method Discriminator Contrastive Divergence (DCD) method.
result Significant improvement in generation quality on synthetic and real-world data.
GANs simulate realistic galaxy images.
problem Simulate complex astronomical images efficiently.
method Progressive GANs with Wasserstein cost function.
result Generates naturalistic galaxy images.
The paper introduces a new ODE approach to improve Wasserstein GANs.
problem Improving Wasserstein GANs for better training results.
method Derives an ODE representing the gradient flow of Wasserstein-1 loss and proposes a new model W1-FE.
result W1-FE outperforms WGAN in training experiments across various dimensions.
Paper optimizes WGAN parameters for non-Gaussian data.
problem Optimizing parameters for non-Gaussian data in WGAN.
method Characterization of optimal solutions for population WGAN beyond LQG setting, using sliced Wasserstein framework.
result Closed-form optimal parameters for non-linear activation functions and non-Gaussian data derived.
Method identifies mixed Nash equilibria in high dimensions for training mixtures of GANs.
problem Finding Nash equilibria in two-player zero-sum continuous games, especially in high dimensions.
method Parametrizing mixed strategies as mixtures of particles, updating their positions and weights using gradient descent-ascent.
result Global convergence to an approximate equilibrium for the related Langevin gradient-ascent dynamic.