Variational Autoencoders are powerful models for unsupervised learning. However deep models with several layers of dependent stochastic variables are difficult to train which limits the improvements obtained using these highly expressive models. We propose a new inference model, the Ladder Variational Autoencoder, that…
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 “variational ladder autoencoder”
VLAC clusters data hierarchically, outperforming GMM.
problem Clustering with multiple attributes or hierarchies.
method Disentangled latent representations for hierarchical clustering.
result VLAC outperforms Gaussian Mixture Models in clustering accuracy.
MFCVAE clusters data over multiple facets, improving disentanglement and generation.
problem Clustering high-dimensional data like images over multiple characteristics.
method Variational autoencoder with hierarchical latent variables and Mixture-of-Gaussians priors.
result MFCVAE learns and clusters over multiple aspects of data in a disentangled manner.
The paper explores Finsler-type objects and their variational problems on spacetimes.
problem Generalizing Einstein equations to the Finsler setting.
method Study of the ladder of Finsler-type objects and their variational problems.
result Application of the ladder structure to variational proposals for Finsler spacetimes.
Mack's estimator improves chain ladder prediction for large exposure insurance models.
problem Uncertainty quantification in compound Poisson loss models.
method Large exposure asymptotics applied to Mack's estimator.
result Chain ladder prediction uncertainty can be quantified without model assumptions.
Characterizes quasiconformally homogeneous ladder surfaces.
problem Characterize quasiconformally homogeneous Riemann surfaces.
method Breaks the problem into four cases and proves one case.
result Every quasiconformally homogeneous ladder surface is quasiconformally equivalent to a regular cover of a closed surface.
A method for analysing the risk of taking a too low reserve level by use of Chain Ladder method is developed. We give an answer to the question of how much safety loading in terms of the Chain Ladder standard error has to be added to the Chain Ladder reserve in order to reach a specified security level in loss reservin…
We examine spaces of connected tri-/univalent graphs subject to local relations which are motivated by the theory of Vassiliev invariants. It is shown that the behaviour of ladder-like subgraphs is strongly related to the parity of the number of rungs: there are similar relations for ladders of even and odd lengths, re…
Study gluing of Lorentzian length spaces and their causal ladder properties.
problem Compatibility of Lorentzian amalgamation with length space properties.
method Conditions for gluing Lorentzian length spaces and criteria for causal ladder preservation.
result Gluing of Lorentzian length spaces yields again a Lorentzian length space under certain conditions.
Talked about the Veech group of a specific surface.
problem Identifying the Veech group of a translation surface of infinite type.
method Analyzing the golden ladder surface.
result Answered a question posed by Hooper and Treviño.
We used the Ladder Network [Rasmus et al. (2015)] to perform Hyperspectral Image Classification in a semi-supervised setting. The Ladder Network distinguishes itself from other semi-supervised methods by jointly optimizing a supervised and unsupervised cost. In many settings this has proven to be more successful than o…
Variational autoencoders provide a principled framework for learning deep latent-variable models and corresponding inference models. In this work, we provide an introduction to variational autoencoders and some important extensions.
We classify all groups which can occur as the orientation preserving topological symmetry group of some embedding of a Möbius ladder graph in .
Parallel transport is an important step in many discrete algorithms for statistical computing on manifolds. Numerical methods based on Jacobi fields or geodesics parallelograms are currently used in geometric data processing. In this last class, pole ladder is a simplification of Schild's ladder for the parallel transp…
Semi-supervised learning (SSL) partially circumvents the high cost of labeling data by augmenting a small labeled dataset with a large and relatively cheap unlabeled dataset drawn from the same distribution. This paper offers a novel interpretation of two deep learning-based SSL approaches, ladder networks and virtual …
New ladder methods improve numerical accuracy in parallel transport on manifolds.
problem Lack of convergence analysis for ladder schemes on manifolds.
method Taylor approximations and iterative constructions of geodesic parallelograms.
result Ladder methods converge quadratically with quadratic speed.
A standard Variational Autoencoder, with a Euclidean latent space, is structurally incapable of capturing topological properties of certain datasets. To remove topological obstructions, we introduce Diffusion Variational Autoencoders with arbitrary manifolds as a latent space. A Diffusion Variational Autoencoder uses t…
We extend Stochastic Gradient Variational Bayes to perform posterior inference for the weights of Stick-Breaking processes. This development allows us to define a Stick-Breaking Variational Autoencoder (SB-VAE), a Bayesian nonparametric version of the variational autoencoder that has a latent representation with stocha…
The paper finds pseudo-Anosov-like maps on an infinite ladder surface.
problem Exploring dynamics on infinite surfaces.
method Lifts Penner-type pseudo-Anosov maps from a closed surface to an infinite ladder surface.
result Existence and properties of pseudo-Anosov-like maps on the infinite ladder surface.
Variational autoencoders model water Cherenkov detector data.
problem Modeling generative distribution of water Cherenkov detector data.
method Variational autoencoders and normalizing flows.
result Demonstrated capability of variational autoencoders for generative modelling.
Variational autoencoders often collapse, showing latent variables are non-identifiable.
problem Posterior collapse in variational autoencoders due to non-identifiable latent variables.
method Proves latent variable non-identifiability causes posterior collapse. Proposes latent-identifiable models using Brenier maps and input convex neural networks.
result Latent-identifiable models resolve posterior collapse and provide meaningful representations.
DAEs can generate images without additional loss terms, inheriting VAE properties.
problem Difficulty in using VAEs for practical generative modelling.
method Empirical exploration of DAEs for image generation without novel methods.
result DAEs can generate images successfully without additional loss terms.
Learning in the latent variable model is challenging in the presence of the complex data structure or the intractable latent variable. Previous variational autoencoders can be low effective due to the straightforward encoder-decoder structure. In this paper, we propose a variational composite autoencoder to sidestep th…
Study reveals the regularization effect of variational distributions in VAEs.
problem Understanding the regularization role of variational distributions in VAEs.
method Analyzed the role of variational family in VAEs and studied the regularization effect on local geometry.
result Uncovered the implicit regularizer in the -VAE objective and proposed a deterministic autoencoding objective.
Combines variational autoencoders with normalizing flows for faster training.
problem Training normalizing flow models like Glow is slow and requires deep architectures.
method Integrates Glow with a variational autoencoder to speed up training.
result The combined model achieves similar image quality and likelihood to Glow but trains faster.
The full causal ladder of spacetimes is constructed, and their updated main properties are developed. Old concepts and alternative definitions of each level of the ladder are revisited, with emphasis in minimum hypotheses. The implications of the recently solved ``folk questions on smoothability'', and alternative prop…
Paper proposes efficient multivariate spatial Fay-Herriot models using variational autoencoders.
problem Estimating population characteristics in small areas with limited data.
method Integrates multivariate spatial Fay-Herriot model with variational autoencoders to leverage spatial structure efficiently.
result Significant computational efficiency improvements for high-dimensional datasets.
In Bayesian machine learning, the posterior distribution is typically computationally intractable, hence variational inference is often required. In this approach, an evidence lower bound on the log likelihood of data is maximized during training. Variational Autoencoders (VAE) are one important example where variation…
We present two deep generative models based on Variational Autoencoders to improve the accuracy of drug response prediction. Our models, Perturbation Variational Autoencoder and its semi-supervised extension, Drug Response Variational Autoencoder (Dr.VAE), learn latent representation of the underlying gene states befor…
Method solves Gaussian graphical models on ladder graphs efficiently.
problem Solving Gaussian graphical models on ladder graphs efficiently.
method Proposes a method that depends on the position of zeros in local covariance matrices.
result Efficiently solves Gaussian graphical models on ladder graphs under certain conditions.
We propose a recurrent extension of the Ladder networks whose structure is motivated by the inference required in hierarchical latent variable models. We demonstrate that the recurrent Ladder is able to handle a wide variety of complex learning tasks that benefit from iterative inference and temporal modeling. The arch…
Proposes variational autoencoder for efficient MMSE estimation.
problem Efficient parameterized MMSE estimation for noisy observations.
method Variational autoencoder models data distribution, approximates MMSE.
result Proposed estimator performs well compared to state-of-the-art.
In recent years Variation Autoencoders have become one of the most popular unsupervised learning of complicated distributions.Variational Autoencoder (VAE) provides more efficient reconstructive performance over a traditional autoencoder. Variational auto enocders make better approximaiton than MCMC. The VAE defines a …
Batch norm with entropic regularization turns deterministic autoencoders into generative modelscs.LG
Batch normalization with regularization turns deterministic autoencoders into generative models.
problem Creating generative models from deterministic autoencoders.
method Using batch normalization as a source of non-determinism and adding entropic regularization.
result Deterministic autoencoders can be transformed into generative models with similar performance to variational autoencoders.
A new model for multiview data analysis using graph autoencoders.
problem Nonlinear multiview canonical correlation analysis for large datasets.
method Variational approach with graph convolutional neural networks.
result Competitive performance on classification, clustering, and recommendation tasks.
Variational autoencoders learn unsupervised data representations, but these models frequently converge to minima that fail to preserve meaningful semantic information. For example, variational autoencoders with autoregressive decoders often collapse into autodecoders, where they learn to ignore the encoder input. In th…
CGDL improves open set recognition by learning conditional Gaussian distributions.
problem Handling unknown samples in real-world recognition tasks.
method Conditional Gaussian Distribution Learning (CGDL) with probabilistic ladder architecture.
result CGDL significantly outperforms baseline methods on standard image datasets.
PRI-VAE learns disentangled representations by optimizing principle-of-relevant-information.
problem Learning disentangled representations under VAE framework remains unknown.
method Proposes PRI-VAE, a novel learning objective to optimize disentanglement.
result Demonstrates effectiveness of PRI-VAE on four benchmark datasets.
Score matching fails to train VAEs robustly, revealing autoencoding loss insights.
problem Catastrophic failure of variational score matching on VAE models.
method Analysis of existing variational score matching objectives and their equivalence to autoencoding losses.
result Score matching methods fail to produce robust VAE models, predicting poor performance.
We present a variation of the Autoencoder (AE) that explicitly maximizes the mutual information between the input data and the hidden representation. The proposed model, the InfoMax Autoencoder (IMAE), by construction is able to learn a robust representation and good prototypes of the data. IMAE is compared both theore…
New method learns disentangled discrete representations using categorical variational autoencoders.
problem Learning disentangled representations from discrete latent spaces.
method Replaced standard Gaussian VAE with a categorical VAE to mitigate rotational invariance.
result Categorical distributions improve learning of disentangled representations.
Lower bound for VAE training objective for binary data.
problem Finding a lower bound for the ELBO of Bernoulli VAE.
method Interpretable lower bound, modified initialization, faster training architecture, PCA for latent space dimension.
result Theoretical result and improved performance of new architecture.
In this paper, we provide an information-theoretic interpretation of the Vector Quantized-Variational Autoencoder (VQ-VAE). We show that the loss function of the original VQ-VAE can be derived from the variational deterministic information bottleneck (VDIB) principle. On the other hand, the VQ-VAE trained by the Expect…
VANO uses neural operators for unsupervised learning of functional data.
problem Learning operators between infinite dimensional spaces for functional data.
method Variational Autoencoding Neural Operators (VANO) approach.
result VANO can learn and reconstruct functional data without supervision.
The recognition network in deep latent variable models such as variational autoencoders (VAEs) relies on amortized inference for efficient posterior approximation that can scale up to large datasets. However, this technique has also been demonstrated to select suboptimal variational parameters, often resulting in consi…
A scalable factorized Gaussian process VAE for faster inference.
problem Inference bottlenecks in Gaussian process VAEs.
method Factorizes latent kernel across auxiliary features, leveraging independence.
result Significant speed-up in inference time (in theory and practice).
EVGAE improves VGAE's latent representation learning by mitigating over-pruning.
problem Over-pruning in VGAE limits latent variable capacity and diversity.
method EVGAE uses epitomic approach with multiple sparse VGAE models (epitomes) to increase active latent units and improve generative ability.
result EVGAE outperforms VGAE in generative ability and link prediction on citation networks.
Optimizes variational autoencoder for detecting missing data in Mars rover transmissions.
problem Detecting missing data in Mars rover transmissions to prevent volume loss and corruption.
method Applies derivative-free optimization to tune variational autoencoder.
result Improves variational autoencoder's ability to detect missing data, aiding GDSA team.