Conditional GANs are at the forefront of natural image synthesis. The main drawback of such models is the necessity for labeled data. In this work we exploit two popular unsupervised learning techniques, adversarial training and self-supervision, and take a step towards bridging the gap between conditional and uncondit…
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,742 papers · 148 categories
Trend · papers per month
48 results for “Unconditional GANs”
This paper explores using SSIM for better image generation in generative models.
problem Improving perceptual quality in generated images using norm.
method Theoretical discussion and practical implementation of SSIM in generative models and autoencoders.
result SSIM can be used in generative models and autoencoders to generate better images.
Paper proposes method to generate images from text using GANs trained on uncaptioned images.
problem Limited captioned image datasets for text-to-image synthesis.
method Conditional GANs trained on uncaptioned images with an Image Captioning Module.
result Promising preliminary results compared to unconditional GANs.
GANs involve training two networks in an adversarial game, where each network's task depends on its adversary. Recently, several works have framed GAN training as an online or continual learning problem. We focus on the discriminator, which must perform classification under an (adversarially) shifting data distribution…
Generative model creates realistic scenes from pixel-wise labels.
problem Creating photo-realistic scenes from pixel-wise labels.
method Semantic bottleneck GAN model combining conditional and unconditional generation networks.
result Model outperforms state-of-the-art models in unsupervised image synthesis.
S2cGAN uses fewer labels to train cGANs effectively.
problem Training conditional GANs requires expensive labelled data.
method Semi-supervised training with sparse labels and unsupervised data.
result S2cGAN learns conditional mapping with sparse labels and unconditional distribution with unsupervised data.
Simple fine-tuning of GANs with frozen discriminator outperforms existing methods.
problem Fine-tuning GANs requires numerous data and heavy computation.
method Freeze lower layers of the discriminator for fine-tuning.
result FreezeD significantly outperforms previous techniques on various datasets.
Enhances GANs by improving consistency regularization.
problem Improving the artifacts introduced by consistency regularization in GANs.
method Proposed modifications to consistency regularization to fix artifacts and improve performance.
result Significant improvement in FID scores on various GAN architectures.
DiffWave generates high-fidelity audio waveforms efficiently.
problem Conditional and unconditional audio waveform generation.
method Non-autoregressive diffusion model using Markov chain synthesis.
result DiffWave produces high-quality audios in various tasks.
A new training method for GANs improves image generation quality.
problem Training GANs is challenging and unstable.
method Consistency regularization to stabilize GAN training.
result CR-GAN achieves best FID scores for unconditional image generation.
We propose a principled method for gradient-based regularization of the critic of GAN-like models trained by adversarially optimizing the kernel of a Maximum Mean Discrepancy (MMD). We show that controlling the gradient of the critic is vital to having a sensible loss function, and devise a method to enforce exact, ana…
Unconditional image generation has recently been dominated by generative adversarial networks (GANs). GAN methods train a generator which regresses images from random noise vectors, as well as a discriminator that attempts to differentiate between the generated images and a training set of real images. GANs have shown …
Geostatistical modeling of petrophysical properties is a key step in modern integrated oil and gas reservoir studies. Recently, generative adversarial networks (GAN) have been shown to be a successful method for generating unconditional simulations of pore- and reservoir-scale models. This contribution leverages the di…
TR0N turns pre-trained models into conditional ones with minimal training.
problem Creating conditional models from pre-trained unconditional models.
method Lightweight stochastic mapping between conditions and latent space, improved through Langevin dynamics.
result Achieves zero-shot FID of 10.9 on MS-COCO, outperforming alternatives.
Adversarially trained generative models (GANs) have recently achieved compelling image synthesis results. But despite early successes in using GANs for unsupervised representation learning, they have since been superseded by approaches based on self-supervision. In this work we show that progress in image generation qu…
Diffusion models outperform GANs in image synthesis quality.
problem Improving image synthesis quality using generative models.
method Developed and optimized diffusion models, and introduced classifier guidance for conditional synthesis.
result Achieved superior image synthesis quality with diffusion models, matching or exceeding GANs in FID scores.
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.
We propose a novel procedure which adds "content-addressability" to any given unconditional implicit model e.g., a generative adversarial network (GAN). The procedure allows users to control the generative process by specifying a set (arbitrary size) of desired examples based on which similar samples are generated from…
Your GAN is Secretly an Energy-based Model and You Should use Discriminator Driven Latent Samplingcs.LG
Improves GANs by sampling from an energy-based model induced by discriminator scores.
problem Improving the quality of images generated by GANs.
method DDLS (Discriminator Driven Latent Sampling) using the sum of latent prior log-density and discriminator output score.
result Significantly improves Inception Score on CIFAR-10 dataset.
Efficient Subsampling of Realistic Images From GANs Conditional on a Class or a Continuous Variablecs.CV
This work introduces an efficient method to sample high-quality images from conditional GANs.
problem Efficient subsampling of images from conditional GANs (cGANs) is challenging.
method Developed a novel conditional density ratio estimation method (cDRE-F-cSP) and rejection sampling scheme (cDR-RS).
result cDR-RS outperforms state-of-the-art methods in both effectiveness and efficiency.
Although Generative Adversarial Networks (GANs) have shown remarkable success in various tasks, they still face challenges in generating high quality images. In this paper, we propose Stacked Generative Adversarial Networks (StackGAN) aiming at generating high-resolution photo-realistic images. First, we propose a two-…
Improved StyleGAN model enhances image quality and invertibility.
problem Characteristics artifacts in StyleGAN's image quality.
method Redesigned generator normalization, revisited progressive growing, and introduced a capacity problem.
result Improved image quality and easier inversion of generated images.
A method to generate multi-label data from single positive annotations.
problem Generating multi-label datasets is costly and impractical.
method Single-to-multi-label (S2M) sampling using Markov chain Monte Carlo.
result S2M sampling enables high-quality multi-label data with minimal annotation cost.
Training-image based geostatistical inversion using a spatial generative adversarial neural networkstat.ML
Probabilistic inversion within a multiple-point statistics framework is often computationally prohibitive for high-dimensional problems. To partly address this, we introduce and evaluate a new training-image based inversion approach for complex geologic media. Our approach relies on a deep neural network of the generat…
Autoregressive state transitions, where predictions are conditioned on past predictions, are the predominant choice for both deterministic and stochastic sequential models. However, autoregressive feedback exposes the evolution of the hidden state trajectory to potential biases from well-known train-test discrepancies.…
Improved GANs model geological facies with diversity and unbiased distribution.
problem Generating unbiased and representative geological models from training images.
method Info-WGAN combining InfoGAN, Wasserstein distance, and Gradient Penalty.
result Generated samples have equal probability distribution as training data.
One of the main motivations for training high quality image generative models is their potential use as tools for image manipulation. Recently, generative adversarial networks (GANs) have been able to generate images of remarkable quality. Unfortunately, adversarially-trained unconditional generator networks have not b…
Neural text generation models are often autoregressive language models or seq2seq models. These models generate text by sampling words sequentially, with each word conditioned on the previous word, and are state-of-the-art for several machine translation and summarization benchmarks. These benchmarks are often defined …
Inspired by the tremendous success of deep generative models on generating continuous data like image and audio, in the most recent year, few deep graph generative models have been proposed to generate discrete data such as graphs. They are typically unconditioned generative models which has no control on modes of the …
Characterizes Bayesian networks up to unconditional equivalence.
problem Characterizing Bayesian networks up to unconditional equivalence.
method Transformational characterization via undirected graphs and specified moves.
result Two DAGs are in the same UEC if and only if one can be transformed into the other via a finite sequence of moves.
Generative model for inferring graph from time series data.
problem Generating graphs conditioned on multivariate time series data.
method Time Series Conditioned Graph Generation-Generative Adversarial Networks (TSGG-GAN).
result Demonstrates effectiveness and generalizability of TSGG-GAN on synthetic and real-world datasets.
Accurate forecasting of risk is the key to successful risk management techniques. Using the largest stock index futures from twelve European bourses, this paper presents VaR measures based on their unconditional and conditional distributions for single and multi-period settings. These measures underpinned by extreme va…
Develops method to assess feature importance in black-box models for unconditional distribution.
problem Lack of methods to analyze feature importance in black-box models for unconditional distribution.
method Approximation method to compute feature importance curves for unconditional distribution.
result Produces sparse and faithful results, computationally efficient.
A new method trains and samples from energy-based models using diffusion recovery likelihood.
problem Training and sampling high-dimensional datasets with energy-based models is challenging.
method Trains EBMs with a diffusion recovery likelihood method, maximizing conditional probabilities of data at different noise levels.
result Generates high-fidelity images with low FID and inception scores, and accurately estimates normalized data density.
New benchmarks measure image generation models' ability to generalize beyond training data.
problem Trivially memorizing training data yields better scores than state-of-the-art models on current benchmarks.
method Developed neural network divergences (NNDs) as evaluation metrics requiring large samples.
result Implemented and validated a black-box metric that measures diversity, sample quality, and generalization.
From Conditional to Unconditional Independence: Testing Conditional Independence via Transport Mapsstat.ML
A new method tests conditional independence by transforming it into an unconditional problem using transport maps.
problem Testing conditional independence between two random vectors given a third.
method Constructing transport maps to transform conditional independence into unconditional independence, estimating these maps from data using conditional continuous normalizing flow models.
result The proposed method is validated through simulations and real-data analysis, demonstrating practical effectiveness.
Combinatorial and algebraic perspectives on the marginal independence structure of Bayesian networksstat.ME
Estimates marginal independence structure of Bayesian networks from data.
problem Learning the marginal independence structure of Bayesian networks from observational data.
method Using Gröbner basis and MCMC method (GrUES) to connect and recover the true structure.
result GrUES recovers the true marginal independence structure at a higher rate than simple independence tests.
The study addresses exposure bias in generative models, proposing unconditional generation as a solution.
problem Exposure bias in autoregressive generative models using ground-truth contexts at training and generated ones at test.
method Combining latent variable modeling with reinforcement learning exploration, the study proposes unconditional generation as a benchmark for generalization.
result The model demonstrates improved generalization capability on language modeling and variational sentence auto-encoding tasks.
UCoS avoids forward model evaluations in sampling for large-scale linear inverse problems.
problem Efficient sampling from posterior distributions in large-scale linear inverse problems.
method UCoS approach that learns a task-dependent score function offline and uses affine transformations to derive the conditional score.
result UCoS eliminates the need for forward model evaluations during sampling, making it more efficient.
Clarifies confusion on feature relevance quantification in explainable AI.
problem Confusion between observational and interventional conditional probabilities in feature relevance quantification.
method Uses Shapley values and clarifies the distinction between observational and interventional conditional probabilities based on Pearl's causality theory.
result Unconditional expectations are the right notion for dropping features, contradicting theoretical justification of SHAP.
The Law of Total Oddsmath.PR
The law of total probability may be deployed in binary classification exercises to estimate the unconditional class probabilities if the class proportions in the training set are not representative of the population class proportions. We argue that this is not a conceptually sound approach and suggest an alternative ba…
We analyze the (unconditional) distribution of a linear predictor that is constructed after a data-driven model selection step in a linear regression model. First, we derive the exact finite-sample cumulative distribution function (cdf) of the linear predictor, and a simple approximation to this (complicated) cdf. We t…
Generates synthetic ECGs conditioned on clinical statements.
problem Privacy issues with sensitive health data.
method Combines diffusion models and structured state space models.
result SSSD-ECG outperforms GAN-based competitors in synthetic data quality.
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.
LOB-Bench benchmarks generative AI for financial data, outperforming traditional models.
problem Lack of consensus on evaluating generative AI models for financial data.
method Python-based benchmark with LOB statistics and market impact metrics.
result Generative autoregressive models outperform traditional models in LOB data.
Deep generative neural networks have proven effective at both conditional and unconditional modeling of complex data distributions. Conditional generation enables interactive control, but creating new controls often requires expensive retraining. In this paper, we develop a method to condition generation without retrai…
The paper proves new inequalities for convex hypersurfaces using centro-affine geometry.
problem Proving inequalities for convex hypersurfaces.
method Introducing a flat logarithmic centro-affine geometry and using Bochner formulas.
result Established new Poincaré and Brunn-Minkowski inequalities.
Given a nonlinear model, a probabilistic forecast may be obtained by Monte Carlo simulations. At a given forecast horizon, Monte Carlo simulations yield sets of discrete forecasts, which can be converted to density forecasts. The resulting density forecasts will inevitably be downgraded by model mis-specification. In o…