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

12.5%25.0%37.5%50.0% · May 199419922001200920172026
48 results for auto-encoding variational Bayes

Improves decision-making in models fit with AEVB by using distinct approximate posteriors.

problem Bias in expected risk estimates due to variational distribution use.
method Use multiple approximate posteriors, including those distinct from variational, for decision-making.
result Proposed approach outperforms state-of-the-art methods in single-cell RNA sequencing.

Improved neural topic model for semi-supervised learning.

problem Representing textual data in an interpretable manner with limited labeled data.
method Label-Indexed Neural Topic Model (LI-NTM) that combines deep generative models with semi-supervised learning.
result LI-NTM outperforms existing models in document reconstruction and classifier performance.

This paper proposes a method to train energy-based models using variational auto-encoders for efficient sampling.

problem Training energy-based models by maximum likelihood is challenging due to intractable partition functions and difficult sampling from the model distribution.
method The authors propose using a variational auto-encoder to initialize finite-step MCMC sampling, specifically Langevin dynamics, to train the energy-based model.
result The proposed method enables training energy-based models using maximum likelihood, generating samples comparable to GANs and EBMs.

Parameterizing the approximate posterior of a generative model with neural networks has become a common theme in recent machine learning research. While providing appealing flexibility, this approach makes it difficult to impose or assess structural constraints such as conditional independence. We propose a framework f…

2018-05-22abs ↗pdf ↗

Enhances graph modeling with hyperbolic geometry and variational inference.

problem Challenges in modeling relational data with complex dependencies.
method Semi-implicit hierarchical variational Bayes with Poincaré embedding and mutual information regularization.
result Improves graph representation quality and flexibility in edge prediction and node classification.

This paper proposes a method to improve VAEs by extracting latent spaces from pre-trained diffusion models.

problem VAEs struggle with generating high-quality images due to unrealistic Gaussian assumptions.
method Optimizes an encoder to maximize marginal data log-likelihood and derives a decoder analytically.
result The method enhances VAE performance by discarding Gaussian assumptions and training a separate decoder network.

Proposes a new model for directed graphs combining deep learning and latent variable models.

problem Graph representation learning for directed graphs.
method Deep Latent Space Model (DLSM) integrating GCN encoder and stochastic decoder with hierarchical variational auto-encoder architecture.
result Achieves state-of-the-art performance on link prediction and community detection tasks.

How can we perform efficient inference and learning in directed probabilistic models, in the presence of continuous latent variables with intractable posterior distributions, and large datasets? We introduce a stochastic variational inference and learning algorithm that scales to large datasets and, under some mild dif…

2013-12-20abs ↗pdf ↗

Improves Active Learning by considering class imbalance and difficulty.

problem Active Learning's focus on individual samples ignores class distribution and difficulty.
method Proposes a method based on Bayes' rule to incorporate class imbalance, using a Variational Auto Encoder (VAE).
result Significantly outperforms state-of-the-art methods on datasets with heavy data imbalance.

DGA and DVGA learn disentangled graph representations to improve graph analysis.

problem Holistic graph auto-encoders fail to capture latent factors effectively.
method Design disentangled graph convolutional network and component-wise flow, impose independence constraints.
result Improved disentangled graph representations enhance graph analysis tasks.

Improved reliability of machine learning predictions using variational auto-encoders.

problem Individual unreliability of machine learning models.
method Modified variational auto-encoders to identify a low-dimensional space for reliable classification.
result Improved reliability of predictions and robust identification of adversarial samples.

We introduce the variational graph auto-encoder (VGAE), a framework for unsupervised learning on graph-structured data based on the variational auto-encoder (VAE). This model makes use of latent variables and is capable of learning interpretable latent representations for undirected graphs. We demonstrate this model us…

2016-11-21abs ↗pdf ↗

Adaptive variational Bayes framework improves inference adaptively.

problem Lack of general and computationally tractable variational Bayes method for adaptive inference.
method Proposes a novel adaptive variational Bayes framework combining variational posteriors over individual models.
result Adaptive variational Bayes achieves optimal contraction rates adaptively under general conditions.

Unbiased gradient estimation improves VAE performance.

problem Training VAEs via maximum likelihood is difficult due to intractable integrals.
method Introduced unbiased estimators of the log-likelihood gradient using coupled Markov chains.
result Unbiased estimators lead to better predictive performance in VAEs.

Variational Auto-Encoders (VAEs) have been widely applied for learning compact, low-dimensional latent representations of high-dimensional data. When the correlation structure among data points is available, previous work proposed Correlated Variational Auto-Encoders (CVAEs), which employ a structured mixture model as …

2019-06-14abs ↗pdf ↗

Variational Auto-Encoders (VAEs) are capable of learning latent representations for high dimensional data. However, due to the i.i.d. assumption, VAEs only optimize the singleton variational distributions and fail to account for the correlations between data points, which might be crucial for learning latent representa…

2019-05-14abs ↗pdf ↗

Semi-implicit graph variational auto-encoder (SIG-VAE) is proposed to expand the flexibility of variational graph auto-encoders (VGAE) to model graph data. SIG-VAE employs a hierarchical variational framework to enable neighboring node sharing for better generative modeling of graph dependency structure, together with …

2019-08-19abs ↗pdf ↗

The paper evaluates variational auto-encoders using model criticism methods.

problem Evaluating the quality of variational auto-encoders (VAEs).
method Statistical model criticism, focusing on reproducing statistics of unknown data generating processes.
result The proposed framework offers possibilities for model selection beyond intrinsic metrics.

We would like to learn latent representations that are low-dimensional and highly interpretable. A model that has these characteristics is the Gaussian Process Latent Variable Model. The benefits and negative of the GP-LVM are complementary to the Variational Autoencoder, the former provides interpretable low-dimension…

2017-12-18abs ↗pdf ↗

We provide theoretical and empirical evidence that using tighter evidence lower bounds (ELBOs) can be detrimental to the process of learning an inference network by reducing the signal-to-noise ratio of the gradient estimator. Our results call into question common implicit assumptions that tighter ELBOs are better vari…

2018-02-13abs ↗pdf ↗

Paper formalizes and analyzes a new bound for variational inference.

problem Lack of theoretical guarantees in variational algorithms.
method Introduces VR-IWAE bound, a generalization of IWAE.
result VR-IWAE bound leads to unbiased gradient estimators.

Generative source separation methods such as non-negative matrix factorization (NMF) or auto-encoders, rely on the assumption of an output probability density. Generative Adversarial Networks (GANs) can learn data distributions without needing a parametric assumption on the output density. We show on a speech source se…

2017-10-30abs ↗pdf ↗

A new method combines Laplace and Variational Bayes for scalable inference.

problem Complex models and large datasets make exact inference infeasible.
method Low-Rank Variational Bayes Correction (VBC) using Laplace method and Variational Bayes correction in a lower dimension.
result The method ensures scalability in both model complexity and data size.

Unified empirical and variational Bayes for unnormalized densities.

problem Approximating unnormalized densities using latent variable models.
method Formulate a latent variable model for Y=X+N(0,σ2Id)Y=X+N(0,σ^2 I_d), use ELBO as parametrization of YY's energy function, and estimate XX with empirical Bayes least-squares.
result UVB has higher capacity to approximate energy functions than MLPs in DEEN.

This paper presents studies on a deterministic annealing algorithm based on quantum annealing for variational Bayes (QAVB) inference, which can be seen as an extension of the simulated annealing for variational Bayes (SAVB) inference. QAVB is as easy as SAVB to implement. Experiments revealed QAVB finds a better local …

2014-08-09abs ↗pdf ↗

The (variational) graph auto-encoder and its variants have been popularly used for representation learning on graph-structured data. While the encoder is often a powerful graph convolutional network, the decoder reconstructs the graph structure by only considering two nodes at a time, thus ignoring possible interaction…

2019-11-26abs ↗pdf ↗

DIVA clusters dynamic data without needing cluster count, outperforming baselines.

problem Clustering complex, dynamic data without prior knowledge of cluster count.
method Nonparametric Dirichlet Process Mixtures with memoized online variational inference.
result DIVA outperforms state-of-the-art in classifying complex data with changing features.

We propose the Wasserstein Auto-Encoder (WAE)---a new algorithm for building a generative model of the data distribution. WAE minimizes a penalized form of the Wasserstein distance between the model distribution and the target distribution, which leads to a different regularizer than the one used by the Variational Aut…

2017-11-05abs ↗pdf ↗

A framework uses variational Bayes for solving inverse problems efficiently.

problem Solving inverse problems in various dimensions with flexibility and accuracy.
method Variational Bayes approximations with message passing and factor graph approach.
result Efficient algorithm updates for higher dimensions and computational advantage over MCMC.

Generative models improve causal effect estimation from observational data.

problem Estimating causal effects from observational data, especially when confounding factors are present.
method Proposes a progressive sequence of Variational Auto-Encoder models to learn underlying factors and causal effects.
result Empirical results show superior performance compared to state-of-the-art approaches.

Variational auto-encoders (VAE) are scalable and powerful generative models. However, the choice of the variational posterior determines tractability and flexibility of the VAE. Commonly, latent variables are modeled using the normal distribution with a diagonal covariance matrix. This results in computational efficien…

2016-11-29abs ↗pdf ↗