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

Trend · papers per month

146292438584 · Jun 202019922001200920172026
48 results for variational lower bound

Paper establishes lower bounds for non-stationary kernelized bandits.

problem Optimizing functions with noisy observations in non-stationary scenarios.
method Develops algorithm-independent lower bounds for time-varying functions under total variation constraints.
result First algorithm-independent lower bounds for time-varying kernelized bandits.

Variational inference is a powerful tool for approximate inference. However, it mainly focuses on the evidence lower bound as variational objective and the development of other measures for variational inference is a promising area of research. This paper proposes a robust modification of evidence and a lower bound for…

2016-11-28abs ↗pdf ↗

Mean-field variational inference is a method for approximate Bayesian posterior inference. It approximates a full posterior distribution with a factorized set of distributions by maximizing a lower bound on the marginal likelihood. This requires the ability to integrate a sum of terms in the log joint likelihood using …

2012-06-27abs ↗pdf ↗

Sharp lower bounds on shallow neural networks' approximation rates are derived.

problem The efficiency of shallow neural networks in approximating functions.
method Lower bounding the L2L^2-metric entropy and Kolmogorov nn-widths of the convex hull of neural network basis functions.
result Sharp lower bounds on the approximation rates for shallow neural networks are provided.

We investigate the use of alternative divergences to Kullback-Leibler (KL) in variational inference(VI), based on the Variational Dropout \cite{kingma2015}. Stochastic gradient variational Bayes (SGVB) \cite{aevb} is a general framework for estimating the evidence lower bound (ELBO) in Variational Bayes. In this work, …

2017-11-12abs ↗pdf ↗

Study finds lower bounds for energy on fibred manifolds using fiberwise symmetrization.

problem Finding lower bounds for energy functionals on fibred manifolds.
method Established a framework for fiberwise symmetrization to find lower bounds.
result Proved a comparison theorem for the first eigenvalue of the Laplacian on warped product manifolds.

The standard interpretation of importance-weighted autoencoders is that they maximize a tighter lower bound on the marginal likelihood than the standard evidence lower bound. We give an alternate interpretation of this procedure: that it optimizes the standard variational lower bound, but using a more complex distribut…

2017-04-10abs ↗pdf ↗

Semi-implicit variational inference (SIVI) is introduced to expand the commonly used analytic variational distribution family, by mixing the variational parameter with a flexible distribution. This mixing distribution can assume any density function, explicit or not, as long as independent random samples can be generat…

2018-05-28abs ↗pdf ↗

Deep Gaussian processes provide a flexible approach to probabilistic modelling of data using either supervised or unsupervised learning. For tractable inference approximations to the marginal likelihood of the model must be made. The original approach to approximate inference in these models used variational compressio…

2014-12-03abs ↗pdf ↗

Variational Inference is a powerful tool in the Bayesian modeling toolkit, however, its effectiveness is determined by the expressivity of the utilized variational distributions in terms of their ability to match the true posterior distribution. In turn, the expressivity of the variational family is largely limited by …

2019-05-08abs ↗pdf ↗

We introduce the thermodynamic variational objective (TVO) for learning in both continuous and discrete deep generative models. The TVO arises from a key connection between variational inference and thermodynamic integration that results in a tighter lower bound to the log marginal likelihood than the standard variatio…

2019-06-28abs ↗pdf ↗

A new method for multi-objective Bayesian optimization using entropy search and variational lower bound maximization.

problem Efficiently optimizing multiple objectives in continuous domains.
method Approximates the Pareto-frontier using a mixture distribution and optimizes the balance through variational lower bound maximization.
result Demonstrated effectiveness especially with many objective functions.

Estimating and optimizing Mutual Information (MI) is core to many problems in machine learning; however, bounding MI in high dimensions is challenging. To establish tractable and scalable objectives, recent work has turned to variational bounds parameterized by neural networks, but the relationships and tradeoffs betwe…

2019-05-16abs ↗pdf ↗

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 ↗

TADDAA improves accuracy diagnostics for variational approximations.

problem Challenges in evaluating the accuracy of variational approximations.
method Uses many short parallel MCMC chains to obtain lower bounds on the error of each posterior functional of interest.
result Validates the practical utility and computational efficiency of TADDAA on various models.

Improved Gaussian process regression with tighter log marginal likelihood bounds.

problem Improving predictive performance in Gaussian process regression models.
method Lower bound on log marginal likelihood using conjugate gradients.
result Improved predictive performance compared to other conjugate gradient based approaches.

We extend the existing framework of semi-implicit variational inference (SIVI) and introduce doubly semi-implicit variational inference (DSIVI), a way to perform variational inference and learning when both the approximate posterior and the prior distribution are semi-implicit. In other words, DSIVI performs inference …

2018-10-05abs ↗pdf ↗

Kernel SIVI improves variational inference by avoiding lower-level optimization.

problem Intractable densities in semi-implicit variational distributions.
method Kernel SIVI-SM uses a minimax formulation and kernel tricks to avoid lower-level optimization.
result Kernel Stein discrepancy (KSD) objective is computable and leads to convergence guarantees.

We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture the effect of unary potentials. A ground state of the resulting approximation can…

2011-04-06abs ↗pdf ↗

New lower bounds improve logistic log-likelihood optimization and inference.

problem Designing computationally tractable lower bounds for logistic log-likelihoods.
method Developed a piece-wise quadratic lower bound that uniformly improves tangent quadratic minorizers.
result Improves the speed of convergence and accuracy of variational Bayes approximations.

Variational inference methods for latent variable statistical models have gained popularity because they are relatively fast, can handle large data sets, and have deterministic convergence guarantees. However, in practice it is unclear whether the fixed point identified by the variational inference algorithm is a local…

2017-03-21abs ↗pdf ↗

Computing the partition function ZZ of a discrete graphical model is a fundamental inference challenge. Since this is computationally intractable, variational approximations are often used in practice. Recently, so-called gauge transformations were used to improve variational lower bounds on ZZ. In this paper, we pro…

2018-01-05abs ↗pdf ↗

We introduce the Variational Holder (VH) bound as an alternative to Variational Bayes (VB) for approximate Bayesian inference. Unlike VB which typically involves maximization of a non-convex lower bound with respect to the variational parameters, the VH bound involves minimization of a convex upper bound to the intract…

2015-06-19abs ↗pdf ↗

Importance weighted variational inference (Burda et al., 2015) uses multiple i.i.d. samples to have a tighter variational lower bound. We believe a joint proposal has the potential of reducing the number of redundant samples, and introduce a hierarchical structure to induce correlation. The hope is that the proposals w…

2019-05-13abs ↗pdf ↗

This paper introduces the variational Rényi bound (VR) that extends traditional variational inference to Rényi's alpha-divergences. This new family of variational methods unifies a number of existing approaches, and enables a smooth interpolation from the evidence lower-bound to the log (marginal) likelihood that is co…

2016-02-06abs ↗pdf ↗

Kernel semi-implicit variational inference improves variational inference without additional optimization.

problem Intractability of hierarchical semi-implicit distributions in variational inference.
method Kernel semi-implicit variational inference (KSIVI) using kernel methods to eliminate lower-level optimization.
result KSIVI reduces variational inference to kernel Stein discrepancy (KSD) optimization, improving expressiveness and tractability.

Clarifies EM algorithm and variational Bayesian inference concepts.

problem Gaps in AI literature understanding of EM and variational concepts.
method Tutorial presentation of EM algorithm, variational Bayesian inference, and autoencoded variational Bayes.
result Establishes clear links between EM and variational methods.

New RL algorithm tackles nonstationary MDPs with linear approximations and varying rewards.

problem Nonstationary reinforcement learning with evolving reward and state transition functions.
method Developed a new algorithm LSVI-UCB-Restart with periodic restart, and parameter-free Ada-LSVI-UCB-Restart for unknown variation budgets.
result First minimax dynamic regret lower bound for nonstationary linear MDPs and linear MDPs lower bound.

We present a general method for deriving collapsed variational inference algo- rithms for probabilistic models in the conjugate exponential family. Our method unifies many existing approaches to collapsed variational inference. Our collapsed variational inference leads to a new lower bound on the marginal likelihood. W…

2012-06-22abs ↗pdf ↗