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.

169,051 papers · 148 categories

Trend · papers per month

2595187771,036 · Jun 202019922001200920182026
48 results for neural variational inference

Variational inference improves neural network matrix factorization for stochastic blockmodels.

problem Improving predictive performance of neural network matrix factorization for stochastic blockmodels.
method Construct Bayesian neural networks and fit with variational inference.
result Variational inference can achieve equivalent performance to neural networks on Movielens data.

Paper proposes Walsh-Hadamard Variational Inference for efficient approximate inference in large models.

problem Over-regularization in variational inference for large models.
method Walsh-Hadamard factorization strategies to reduce parameterization, accelerate computations, and increase posterior expressiveness.
result Efficient approximate inference achieved in over-parameterized models.

New method estimates uncertainty in knowledge graph embeddings using neural variational inference.

problem Estimating uncertainty in knowledge graph embeddings.
method Constructs an inference network conditioned on symbolic representations of entities and relation types in a Knowledge Graph.
result Improved predictive uncertainty estimates during link prediction.

Combines neural networks with variational inference for better uncertainty quantification.

problem Overconfident predictions from traditional neural networks and time-consuming Bayesian optimization.
method VIFO (Variational Inference on the Final-Layer Output) using neural networks to learn mean and variance.
result VIFO provides a good tradeoff in run time and uncertainty quantification, especially for out of distribution data.

SFSVI uses Gaussian mixtures to approximate neural network outputs for continual learning.

problem Learning new tasks without forgetting old ones in neural networks.
method Sequential function-space variational inference with Gaussian mixture approximation.
result Gaussian mixture SFSVI outperforms other methods in continual learning.

Recent advances in neural variational inference have spawned a renaissance in deep latent variable models. In this paper we introduce a generic variational inference framework for generative and conditional models of text. While traditional variational methods derive an analytic approximation for the intractable distri…

2015-11-19abs ↗pdf ↗

GWI combines deep neural networks with Gaussian processes for better predictive performance and uncertainty quantification.

problem Combining deep learning with Gaussian process uncertainty quantification.
method Gaussian Wasserstein inference (GWI) using Wasserstein distance between Gaussian measures.
result GWI achieves state-of-the-art performance on benchmark datasets.

Develops inference combinators for probabilistic programs using neural networks.

problem Creating efficient proposals for probabilistic program inference.
method Inference combinators using neural network parameterization of proposals.
result Correct by construction variational methods tailored to specific models.

BBNN improves neural network accuracy and uncertainty quantification.

problem Overfitting and lack of interpretability in probabilistic neural networks.
method Boosted Bayesian Neural Networks (BBNN) using Boosting Variational Inference (BVI).
result BBNN achieves ~5% higher accuracy and superior uncertainty quantification.

We develop a variational framework for SDEs driven by fractional noise.

problem Capturing long-term dependencies in SDEs driven by fractional noise.
method Markov approximation of fractional Brownian motion, variational inference, neural networks.
result Efficient variational inference of posterior path measures for neural-SDEs.

TM-VI uses flexible transformation models to approximate complex posteriors in Bayesian models.

problem Approximating complex posteriors in Bayesian models with limited flexibility.
method Transformation models for variational inference (TM-VI).
result TM-VI allows accurate approximation of complex posteriors in models with one parameter and works in a mean-field fashion for multi-parameter models.

fBNNs use stochastic processes for variational inference in neural networks.

problem Difficulties in specifying priors and posteriors in high-dimensional weight spaces.
method Maximize Evidence Lower Bound (ELBO) on stochastic processes, using spectral Stein gradient estimator.
result fBNNs provide reliable uncertainty estimates and extrapolate well with structured priors.

Improved state estimation in nonlinear models using amortized backward variational inference.

problem State estimation in general state-space models.
method Amortized backward variational inference with neural network parameters.
result Linear growth of variational approximation error in number of observations.

The paper connects neural network ensembles to Bayesian inference using variational methods.

problem Explaining the behavior of ensemble methods in neural networks.
method Deriving conditions for ensemble optimization to reduce divergence to the posterior distribution.
result Ensemble methods can be a valid alternative to approximate Bayesian inference.

Neural moving average model speeds up state space model inference for time series data.

problem Efficiently scaling approximate Bayesian inference for time series data.
method Proposes a novel generative model (neural moving average model) for latent temporal states in state space models.
result Achieves accurate parameter estimation in a short time for various models.

Compact parameterization improves Bayesian neural network performance.

problem Improving performance of Bayesian neural networks using variational methods.
method Restricting variational distribution to a k-tied Normal distribution with low-rank factorization.
result Compact parameterization improves signal-to-noise ratio and convergence speed.

The paper develops scalable variational inference for Bayesian neural networks under model and parameter uncertainty.

problem Combining structural and parameter uncertainties in scalable Bayesian neural networks.
method Adapted variational inference with reparametrization for model space constraints.
result Comparable accuracy with sparse inference compared to ordinary BNNs.

Variational Laplace improves Bayesian neural network performance without sampling.

problem Improving Bayesian neural network performance and calibration.
method Develops a new variational Laplace method for BNNs, exploiting curvature of likelihood.
result Variational Laplace outperforms standard VI methods in test performance and calibration.

DMVI uses diffusion models for efficient probabilistic inference in PPLs.

problem Efficient probabilistic inference in complex probabilistic programming languages.
method DMVI employs diffusion models as variational approximations to the posterior distribution, optimizing a bound on the marginal likelihood.
result DMVI produces more accurate posterior inferences than existing methods in PPLs with similar computational cost and less manual tuning.

Paper develops efficient variational inference for sparse deep learning with theoretical guarantees.

problem Sparse deep learning's challenge of huge storage consumption and sparse structure recovery.
method Bayesian treatment with spike-and-slab priors and continuous relaxation of Bernoulli distribution for computationally efficient variational inferences.
result Provides variational posterior contraction rate, justifying consistency of the proposed method.

Improved neural spike inference from calcium imaging data.

problem Neural spike inference from calcium imaging data.
method Importance weighted adversarial variational autoencoders (IWAE) with adversarial training.
result Adversarial IWAE methods outperform VAEs in inferring neural spikes.

cvHM framework speeds up GP inference for neural spike train analysis.

problem Scalability issue in approximate inference for latent GP models.
method cvHM framework using Hida-Matérn kernels and conjugate computation variational inference (CVI).
result Linear time inference for latent neural trajectories.

WNVI solves inverse problems without forward models using neural networks.

problem Solving high-dimensional Bayesian inverse problems based on PDEs.
method WNVI uses weighted residuals and SVI with neural networks to infer state variables and unknowns.
result WNVI is more accurate and efficient than traditional methods and handles ill-posed problems.

Inspired by the seminal work on Stein Variational Inference and Stein Variational Policy Gradient, we derived a method to generate samples from the posterior variational parameter distribution by \textit{explicitly} minimizing the KL divergence to match the target distribution in an amortize fashion. Consequently, we a…

2018-02-21abs ↗pdf ↗

Variational inference struggles with weight symmetries in neural networks, leading to biased posteriors.

problem Weight space symmetries in neural networks cause multimodal posteriors, challenging variational inference.
method Developed a symmetrization mechanism to create permutation invariant variational posteriors.
result Symmetrized variational posteriors have a better fit to the true posterior and improved predictive performance.

The paper proposes a method for better uncertainty estimation in neural networks.

problem Estimating predictive uncertainty in neural networks is crucial but challenging.
method The paper proposes a function-space variational inference method to infer a posterior distribution over functions.
result The proposed method leads to state-of-the-art uncertainty estimation and predictive performance.

Paper shows variational inference works well for sparse deep learning models.

problem Generalization of sparse deep learning models using variational inference.
method Theoretical analysis linking variational inference to Bayesian and nonparametric regression.
result Near-minimax rates of convergence for Hölder smooth functions in sparse deep learning.

Meta-learn Bayesian inference for task-specific BNNs using amortised inference.

problem Efficiently learning Bayesian inference for small-scale probabilistic meta-learning.
method Replace global inducing points with actual data to create a set of approximate likelihoods, train a meta-model to learn these parameters across related datasets.
result Meta-learned inference can be applied to task-specific BNNs, improving efficiency and scalability.

Batch normalisation doesn't affect variational inference but fails for larger batch sizes.

problem Failure of Monte Carlo Batch Normalisation (MCBN) for capturing epistemic uncertainty in larger batch sizes.
method Investigated MCBN as an approximate inference technique for Bayesian neural networks, showing its limitations and providing insights for improvement.
result For larger batch sizes, MCBN fails to capture epistemic uncertainty, requiring the batch size to be a variational parameter.

Deep Bayesian neural nets can use simpler weight approximations without sacrificing performance.

problem The need for complex weight posterior approximations in deep Bayesian neural networks.
method Theoretical and empirical analysis of mean-field variational inference in deep networks.
result Mean-field variational weight posteriors in deep networks can induce similar function-space distributions as complex approximations in shallower networks.