Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

306191121 · Jun 202019922001200920172026
48 results for Model-Based GANs

New GAN design uses conditional independence graphs to improve model-based GANs.

problem Designing model-based GANs using additional information about underlying distribution.
method Study subadditivity properties of probability divergences to design model-based GANs.
result Model-based GANs using neighborhood discriminators provide significant statistical and computational benefits.

Generative Adversarial Networks (GANs) are a powerful class of generative models. Despite their successes, the most appropriate choice of a GAN network architecture is still not well understood. GAN models for image synthesis have adopted a deep convolutional network architecture, which eliminates or minimizes the use …

2019-05-07abs ↗pdf ↗

Geometric models improve feature extraction and equivariance in image generation.

problem Improving feature extraction at multiscale levels and reducing network complexity.
method Proposes a geometric generative model based on morphological PDEs and GANs, incorporating equivariance for geometric interpretability.
result Preliminary results show GM-GAN outperforms classical GANs on MNIST data.

Deep generative models are attracting great attention as a new promising approach for molecular design. All models reported so far are based on either variational autoencoder (VAE) or generative adversarial network (GAN). Here we propose a new type model based on an adversarially regularized autoencoder (ARAE). It basi…

2019-11-13abs ↗pdf ↗

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.

Generative Adversarial Networks (GANs) have become a popular method to learn a probability model from data. In this paper, we aim to provide an understanding of some of the basic issues surrounding GANs including their formulation, generalization and stability on a simple benchmark where the data has a high-dimensional…

2017-10-30abs ↗pdf ↗

PlanGAN uses GANs to plan efficient trajectories for multi-goal tasks in sparse reward environments.

problem Learning with sparse rewards in multi-goal environments.
method PlanGAN combines GANs to generate trajectories leading to specified goals, then combines these into a planning algorithm.
result PlanGAN achieves comparable performance to model-free RL but is 4-8 times more sample efficient.

Generative adversarial networks (GANs) are capable of producing high quality image samples. However, unlike variational autoencoders (VAEs), GANs lack encoders that provide the inverse mapping for the generators, i.e., encode images back to the latent space. In this work, we consider adversarially learned generative mo…

2018-12-19abs ↗pdf ↗

In recent years, neural network approaches have been widely adopted for machine learning tasks, with applications in computer vision. More recently, unsupervised generative models based on neural networks have been successfully applied to model data distributions via low-dimensional latent spaces. In this paper, we use…

2018-02-05abs ↗pdf ↗

Generative adversarial networks (GANs) are pow- erful generative models based on providing feed- back to a generative network via a discriminator network. However, the discriminator usually as- sesses individual samples. This prevents the dis- criminator from accessing global distributional statistics of generated samp…

2018-06-19abs ↗pdf ↗

This project report compares some known GAN and VAE models proposed prior to 2017. There has been significant progress after we finished this report. We upload this report as an introduction to generative models and provide some personal interpretations supported by empirical evidence. Both generative adversarial netwo…

2018-12-13abs ↗pdf ↗

Adaptive framework for learning latent space dimensions in GANs.

problem Inadequate latent space dimensions lead to poor generative models for complex data.
method Proposes a novel framework (LWGAN) that adaptively learns latent dimensions of data manifolds.
result Proves that the estimated intrinsic dimension is a consistent estimate of the true data manifold dimension.

Compressed sensing (CS) provides an elegant framework for recovering sparse signals from compressed measurements. For example, CS can exploit the structure of natural images and recover an image from only a few random measurements. CS is flexible and data efficient, but its application has been restricted by the strong…

2019-05-16abs ↗pdf ↗

In this paper, we investigate the problem of learning disentangled representations. Given a pair of images sharing some attributes, we aim to create a low-dimensional representation which is split into two parts: a shared representation that captures the common information between the images and an exclusive representa…

2019-12-09abs ↗pdf ↗

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.

Study develops a new algorithm for assessing clinical trial abstracts.

problem Limited tools for assessing qualitative statements in clinical research.
method Developed a three-class sentiment classification algorithm using BERT model.
result Algorithm achieved 91.3% classification accuracy and 0.92 macro F1-Score.

Framework learns to transform majority to minority samples for balanced classification.

problem Imbalanced classification leading to biased predictions.
method Minimizes MMD and uses triplet loss for global alignment and boundary awareness.
result Consistent improvements over classical and generative baselines in AUROC, G-mean, F1-score, and MCC.

Generative adversarial networks (GANs) have enjoyed much success in learning high-dimensional distributions. Learning objectives approximately minimize an ff-divergence (ff-GANs) or an integral probability metric (Wasserstein GANs) between the model and the data distribution using a discriminator. Wasserstein GANs en…

2019-10-22abs ↗pdf ↗

xAI-GAN improves GANs by providing richer feedback, enhancing image quality.

problem Challenges in GAN training, especially resource-intensive and data-intensive.
method Integrates xAI systems to provide richer corrective feedback from discriminators to generators.
result Improves image quality by up to 23.18% on MNIST and FMNIST datasets.

Generative Adversarial Networks (GANs) are powerful models for learning complex distributions. Stable training of GANs has been addressed in many recent works which explore different metrics between distributions. In this paper we introduce Fisher GAN which fits within the Integral Probability Metrics (IPM) framework f…

2017-05-26abs ↗pdf ↗

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…

2018-01-04abs ↗pdf ↗