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,181 papers · 148 categories

Trend · papers per month

173345518690 · Jun 202019922001200920182026
48 results for Stochastic Gradient Variational Bayes

This research explores using Alpha-Divergences in variational dropout for better inference.

problem Improving variational inference methods using alternative divergences.
method Extending the Stochastic Gradient Variational Bayes (SGVB) framework with Alpha-Divergences.
result The αα-divergence with αightarrow1α ightarrow 1 yields the lowest training error and optimizes the ELBO.

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…

2016-05-20abs ↗pdf ↗

We present a family of expectation-maximization (EM) algorithms for binary and negative-binomial logistic regression, drawing a sharp connection with the variational-Bayes algorithm of Jaakkola and Jordan (2000). Indeed, our results allow a version of this variational-Bayes approach to be re-interpreted as a true EM al…

2013-05-31abs ↗pdf ↗

Paper proposes MMD-Bayes for robust Bayesian estimation in misspecified models.

problem Inconsistent estimates in Bayesian statistics due to model misspecification.
method Uses Maximum Mean Discrepancy (MMD) to create a robust pseudo-likelihood.
result MMD-Bayes posterior is consistent and robust to model misspecification.

Backprop-Q extends standard backpropagation for stochastic computation graphs.

problem Applying standard backpropagation to stochastic computation graphs is challenging.
method Construct Q-functions for each stochastic node and use them to train the SCG with standard backpropagation.
result Generalized backpropagation for stochastic computation graphs is feasible and extends learning signals beyond gradients.

Neural GARCH models financial time series with time-varying coefficients.

problem Modeling conditional heteroskedasticity in financial time series.
method Neural network adaptation of GARCH and BEKK models with time-varying coefficients parameterized by a recurrent neural network.
result Neural Students t model consistently outperforms other models on financial time series.

Meta-learning framework improves model performance on few-shot classification tasks.

problem Improving model performance on few-shot classification tasks.
method Empirical Bayes formulation with synthetic gradients for transductive meta-learning.
result Meta-learning framework outperforms previous state-of-the-art methods on benchmarks.

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.

A new optimization algorithm for Gaussian Variational Inference on precision matrices.

problem Complex models with positive definite constraints on covariance matrices.
method Manifold Gaussian Variational Bayes (MGVBP) with natural gradient updates.
result Empirically validated as a feasible and efficient solution for VI in complex models.

Gradient-based optimization improves variational empirical Bayes regression.

problem Sparse, large-scale multiple regression models.
method Gradient-based optimization (GradVI) for variational empirical Bayes (VEB) regression.
result GradVI produces similar predictive performance to CAVI but converges faster and is faster in certain settings.

Draft proposes adapting neural networks to match naive Bayes classifiers.

problem Bridge between neural networks and naive Bayes classifiers.
method Class-conditional compression and disentanglement using variational bounds.
result Latent representations enable naive Bayes classifier performance.

Bayesian method approximates intractable stochastic programs with chance constraints.

problem Designing systems with stochastic constraints and chance constraints.
method Variational Bayesian approach to approximate posterior predictive integral.
result The solution set converges to the true solution set as the number of observations increases.

A new method improves likelihood-free Bayesian inference by transforming summary statistics and using efficient Variational Bayes.

problem Incorrectly assuming normally distributed summary statistics in likelihood-free Bayesian inference.
method Wasserstein Gaussianization transformation combined with robust BSL and efficient Variational Bayes.
result Highly efficient and reliable approximate Bayesian inference for likelihood-free problems.

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 ↗

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.

We present SDA-Bayes, a framework for (S)treaming, (D)istributed, (A)synchronous computation of a Bayesian posterior. The framework makes streaming updates to the estimated posterior according to a user-specified approximation batch primitive. We demonstrate the usefulness of our framework, with variational Bayes (VB) …

2013-07-25abs ↗pdf ↗

Flexible Bayesian approach for generalized linear models, especially for sparse logistic regression.

problem Sparse logistic regression challenges in machine learning.
method Empirical Bayes approach with mean-field variational inference, tuning-free and scalable.
result Superior predictive performance in sparse logistic regression compared to existing methods.

Bayesian surrogate models reduce uncertainty in high-dimensional design optimisation problems.

problem Uncertainty in high-dimensional inputs for complex computational models.
method Variational Bayesian inference for constructing statistical surrogates with Gaussian process priors and KL divergence for approximation.
result The RDVGP surrogate provides accurate and versatile approximations for robust structural optimisation.

SMI uses mixture models to improve SVGD's performance in Bayesian inference.

problem Variance collapse in SVGD for Bayesian inference, especially with small models.
method Generalizes SVGD to Stein mixture models, optimizing an ELBO lower bound.
result SMI avoids variance collapse and accurately estimates uncertainty for small BNNs.

New research shows existing information-theoretic methods can't establish minimax rates for gradient descent in stochastic convex optimization.

problem Establishing minimax rates for gradient descent in stochastic convex optimization using information-theoretic methods.
method Examined several information-theoretic frameworks including input-output mutual information bounds, conditional mutual information bounds, PAC-Bayes bounds, and their variants.
result Proved that none of the examined information-theoretic frameworks can establish minimax rates for gradient descent in stochastic convex optimization.

Proposes a new RNN for language generation capturing long-range dependencies.

problem Capturing long-range word dependencies and sentence order in text corpora.
method Recurrent Hierarchical Topic-Guided RNN with dynamic deep topic model.
result Outperforms larger-context RNN-based language models and learns interpretable topics.

Black-box alpha (BB-αα) is a new approximate inference method based on the minimization of αα-divergences. BB-αα scales to large datasets because it can be implemented using stochastic gradient descent. BB-αα can be applied to complex probabilistic models with little effort since it only requires as input the likel…

2015-11-10abs ↗pdf ↗

New method improves training stochastic neural networks with tighter guarantees.

problem Training stochastic neural networks with provable guarantees.
method Developed partially-aggregated estimators and reformulated PAC-Bayesian bounds.
result Derives a differentiable objective leading to tighter generalisation guarantees.

Variational inference approximates the posterior distribution of a probabilistic model with a parameterized density by maximizing a lower bound for the model evidence. Modern solutions fit a flexible approximation with stochastic gradient descent, using Monte Carlo approximation for the gradients. This enables variatio…

2017-04-19abs ↗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.