paper-with-me

홈 › Papers

Probabilistic Autoencoder

2020-06-09 · Under review 2020 6 · Vanessa Böhm, Uroš Seljak

Principal Component Analysis (PCA) minimizes the reconstruction error given a class of linear models of fixed component dimensionality. Probabilistic PCA adds a probabilistic structure by learning the probability distribution of the PCA latent space weights, thus creating a generative model. Autoencoders (AE) minimize the reconstruction error in a class of nonlinear models of fixed latent space dimensionality and outperform PCA at fixed dimensionality. Here, we introduce the Probabilistic Autoencoder (PAE) that learns the probability distribution of the AE latent space weights using a normalizing flow (NF). The PAE is fast and easy to train and achieves small reconstruction errors, high sample quality, and good performance in downstream tasks. We compare the PAE to Variational AE (VAE), showing that the PAE trains faster, reaches a lower reconstruction error, and produces good sample quality without requiring special tuning parameters or training procedures. We further demonstrate that the PAE is a powerful model for performing the downstream tasks of probabilistic image reconstruction in the context of Bayesian inference of inverse problems for inpainting and denoising applications. Finally, we identify latent space density from NF as a promising outlier detection metric.

📄 PDF Abstract BibTeX arXiv:2006.05479

Code (4)

VMBoehm/PAE 공식 구현 tf
vmboehm/pae-ablation 공식 구현 tf
AI-for-Ocean-Science/ulmo pytorch
chrvt/denoising-normalizing-flow pytorch

Tasks

Bayesian InferenceDenoisingImage GenerationImage ReconstructionOutlier DetectionOut-of-Distribution DetectionUnsupervised Anomaly Detection

Methods 이 논문이 사용한 방법론

USD Coin Customer Service Number +1-833-534-1729 설명 없음

Similar Papers 제목 키워드 기반

Disentangled Latent Spaces for Reduced Order Models using Deterministic Autoencoders

2025-02-20 · Henning Schwarz, Pyei Phyo Lin, Jens-Peter M. Zemke, Thomas Rung

Data-driven reduced-order models based on autoencoders generally lack interpretability compared to classical methods such as the proper orthogonal decomposition. More interpretability can be gained by disentangling the l…

Dimensionality Reduction

A Variational Autoencoder for Probabilistic Non-Negative Matrix Factorisation

2019-06-13 · ICLR 2019 5 · Steven Squires, Adam Prügel Bennett, Mahesan Niranjan

We introduce and demonstrate the variational autoencoder (VAE) for probabilistic non-negative matrix factorisation (PAE-NMF). We design a network which can perform non-negative matrix factorisation (NMF) and add in aspec…

Time SeriesTime Series Analysis

Doubly Stochastic Adversarial Autoencoder

2018-07-19 · ICLR 2018 1 · Mahdi Azarafrooz

Any autoencoder network can be turned into a generative model by imposing an arbitrary prior distribution on its hidden code vector. Variational Autoencoder (VAE) [2] uses a KL divergence penalty to impose the prior, whe…

continuous-controlContinuous Control

A probabilistic database approach to autoencoder-based data cleaning

2021-06-17 · R. R. Mauritz, F. P. J. Nijweide, J. Goseling, M. van Keulen

Data quality problems are a large threat in data science. In this paper, we propose a data-cleaning autoencoder capable of near-automatic data quality improvement. It learns the structure and dependencies in the data and…

Attribute

Multi-Domain Translation by Learning Uncoupled Autoencoders

2019-02-09 · Karren D. Yang, Caroline Uhler

Multi-domain translation seeks to learn a probabilistic coupling between marginal distributions that reflects the correspondence between different domains. We assume that data from different domains are generated from a …

Translation