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

2468 · Nov 201919922001200920172026
48 results for CelebA

Soft Truncation improves diffusion model performance by balancing loss scales across diffusion times.

problem Inverse correlation between density estimation and sample generation in diffusion models.
method Introduces Soft Truncation, a training technique that softens the truncation hyperparameter.
result Soft Truncation achieves state-of-the-art performance on various datasets.

In this paper, we introduce the Fairness GAN, an approach for generating a dataset that is plausibly similar to a given multimedia dataset, but is more fair with respect to protected attributes in allocative decision making. We propose a novel auxiliary classifier GAN that strives for demographic parity or equality of …

2018-05-24abs ↗pdf ↗

Generative models with an encoding component such as autoencoders currently receive great interest. However, training of autoencoders is typically complicated by the need to train a separate encoder and decoder model that have to be enforced to be reciprocal to each other. To overcome this problem, by-design reversible…

2018-06-05abs ↗pdf ↗

NVAE improves VAE performance on large image datasets.

problem Improving variational autoencoder performance for large image datasets.
method Deep hierarchical VAE with depth-wise separable convolutions and batch normalization, residual parameterization of Normal distributions, and spectral regularization.
result NVAE achieves state-of-the-art results on MNIST, CIFAR-10, CelebA 64, and CelebA HQ datasets.

We propose a novel hierarchical generative model with a simple Markovian structure and a corresponding inference model. Both the generative and inference model are trained using the adversarial learning paradigm. We demonstrate that the hierarchical structure supports the learning of progressively more abstract represe…

2018-02-04abs ↗pdf ↗

IntroVAC learns interpretable latent subspaces for better image quality.

problem Difficulties in interpreting latent spaces and limitations in image generation.
method Introspective Variational Classifier (IntroVAC) using additional labels and adversarial training.
result Improved image quality and meaningful latent directions for fine-grained manipulation.

We examine two different techniques for parameter averaging in GAN training. Moving Average (MA) computes the time-average of parameters, whereas Exponential Moving Average (EMA) computes an exponentially discounted sum. Whilst MA is known to lead to convergence in bilinear settings, we provide the -- to our knowledge …

2018-06-12abs ↗pdf ↗

We propose a novel approach for estimating the difficulty and transferability of supervised classification tasks. Unlike previous work, our approach is solution agnostic and does not require or assume trained models. Instead, we estimate these values using an information theoretic approach: treating training labels as …

2019-08-21abs ↗pdf ↗

New method learns sparse distributions by thresholding samples, improving performance and efficiency.

problem Sparse coding optimization in high-dimensional problems is computationally expensive and inefficient.
method Proposes a new variational sparse coding approach that learns sparse distributions by thresholding samples.
result Shows superior performance, statistical efficiency, and gradient estimation compared to other sparse distributions.

In adversarial learning, discriminator often fails to guide the generator successfully since it distinguishes between real and generated images using silly or non-robust features. To alleviate this problem, this brief presents a simple but effective way that improves the performance of generative adversarial network (G…

2019-11-19abs ↗pdf ↗

WS diffusion models handle anisotropic Gaussian noise better than conventional methods.

problem Handling anisotropic Gaussian noise in imaging inverse problems.
method Whitened Score (WS) diffusion models based on stochastic differential equations.
result WS DMs outperform conventional DMs on anisotropic Gaussian noise.

CausalVAE learns causal relationships in VAE models for better data disentanglement.

problem Learning disentanglement of independent factors from observational data.
method CausalVAE framework with a Causal Layer to transform exogenous factors into causal endogenous ones.
result CausalVAE learns semantically interpretable causal representations and accurately identifies their DAG structure.

Faster reconstruction of compressed signals using conditional GAN and NPGD.

problem Recovering compressed signals from measurements.
method Network-based projected gradient descent (NPGD) combined with measurement-conditional generative adversarial networks (GANs/BEGANs).
result Significant speed-up in reconstruction (up to 140-175 times faster).

Study on shortcuts in deep networks, revealing their layer-wise distribution and impact.

problem Understudied impact of shortcuts on feature representations in deep networks.
method Layer-wise localization through counterfactual training on clean and skewed datasets.
result Shortcuts are distributed throughout the network, not localized in specific layers.

We propose a new method to evaluate GANs, namely EvalGAN. EvalGAN relies on a test set to directly measure the reconstruction quality in the original sample space (no auxiliary networks are necessary), and it also computes the (log)likelihood for the reconstructed samples in the test set. Further, EvalGAN is agnostic t…

2019-01-28abs ↗pdf ↗

We propose a simple, tractable lower bound on the mutual information contained in the joint generative density of any latent variable generative model: the GILBO (Generative Information Lower BOund). It offers a data-independent measure of the complexity of the learned latent variable description, giving the log of the…

2018-02-13abs ↗pdf ↗

In this work, we propose an introspection technique for deep neural networks that relies on a generative model to instigate salient editing of the input image for model interpretation. Such modification provides the fundamental interventional operation that allows us to obtain answers to counterfactual inquiries, i.e.,…

2019-07-06abs ↗pdf ↗

New method learns identity-preserving transformations on data manifolds without labels.

problem Learning identity-preserving transformations on natural variations without supervision.
method Introduces a learning strategy that does not require transformation labels and learns local regions for operators.
result Trains on MNIST and Fashion MNIST, and CelebA, learning transformations without labels.

Semantic inpainting is the task of inferring missing pixels in an image given surrounding pixels and high level image semantics. Most semantic inpainting algorithms are deterministic: given an image with missing regions, a single inpainted image is generated. However, there are often several plausible inpaintings for a…

2018-10-08abs ↗pdf ↗

LSGM trains SGMs in latent space for faster sampling.

problem Efficiently generating high-quality samples from complex distributions.
method LSGM trains SGMs in latent space using a variational autoencoder framework, introducing new score-matching objectives and parameterizations.
result LSGM achieves state-of-the-art FID score of 2.10 on CIFAR-10 and outperforms previous SGMs in sampling time.

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…

2018-05-29abs ↗pdf ↗

We introduce a novel framework for adversarial training where the target distribution is annealed between the uniform distribution and the data distribution. We posited a conjecture that learning under continuous annealing in the nonparametric regime is stable irrespective of the divergence measures in the objective fu…

2017-05-21abs ↗pdf ↗

Conventional out-of-distribution (OOD) detection schemes based on variational autoencoder or Random Network Distillation (RND) have been observed to assign lower uncertainty to the OOD than the target distribution. In this work, we discover that such conventional novelty detection schemes are also vulnerable to the blu…

2019-11-27abs ↗pdf ↗

Bidirectional VAE reduces parameters and improves image tasks.

problem Improving image reconstruction, classification, interpolation, and generation.
method Uses a single neural network for both encoding and decoding in both forward and backward directions.
result Bidirectional VAEs reduce parameters by almost 50% and slightly outperform unidirectional VAEs.

We introduce the Metropolis-Hastings generative adversarial network (MH-GAN), which combines aspects of Markov chain Monte Carlo and GANs. The MH-GAN draws samples from the distribution implicitly defined by a GAN's discriminator-generator pair, as opposed to standard GANs which draw samples from the distribution defin…

2018-11-28abs ↗pdf ↗

We describe a simple, low-level approach for embedding probabilistic programming in a deep learning ecosystem. In particular, we distill probabilistic programming down to a single abstraction---the random variable. Our lightweight implementation in TensorFlow enables numerous applications: a model-parallel variational …

2018-11-05abs ↗pdf ↗

We propose a novel training procedure for improving the performance of generative adversarial networks (GANs), especially to bidirectional GANs. First, we enforce that the empirical distribution of the inverse inference network matches the prior distribution, which favors the generator network reproducibility on the se…

2019-11-04abs ↗pdf ↗

The increasingly photorealistic sample quality of generative image models suggests their feasibility in applications beyond image generation. We present the Neural Photo Editor, an interface that leverages the power of generative neural networks to make large, semantically coherent changes to existing images. To tackle…

2016-09-22abs ↗pdf ↗

Generative adversarial networks (GANs) can implicitly learn rich distributions over images, audio, and data which are hard to model with an explicit likelihood. We present a practical Bayesian formulation for unsupervised and semi-supervised learning with GANs. Within this framework, we use stochastic gradient Hamilton…

2017-05-26abs ↗pdf ↗

Variational autoencoders (VAEs) are widely used deep generative models capable of learning unsupervised latent representations of data. Such representations are often difficult to interpret or control. We consider the problem of unsupervised learning of features correlated to specific labels in a dataset. We propose a …

2018-12-14abs ↗pdf ↗

DALI improves inference for GANs by matching prior and conditional distributions.

problem Effective inference for generative adversarial models (GANs).
method Explicitly matches prior and conditional distributions in data and code spaces, constraining dependency structure.
result Significantly improves reconstruction and generation compared to other GAN inference models.

We introduce a new framework for training deep generative models for high-dimensional conditional density estimation. The Bottleneck Conditional Density Estimator (BCDE) is a variant of the conditional variational autoencoder (CVAE) that employs layer(s) of stochastic variables as the bottleneck between the input xx a…

2016-11-25abs ↗pdf ↗