Logistic Variational Bayes Revisited
Michael Komodromos, Marina Evangelou, Sarah Filippi
TL;DR
The paper addresses scalable Bayesian inference for binary outcomes by deriving a new bound for the expectation $\mathbb{E}_{X}[\log(1+\exp(X))]$ with $X \sim \mathcal{N}(\vartheta, \tau^2)$, enabling tractable VI in logistic and GP classification. The bound, denoted $\eta_l(\vartheta, \tau)$, is tighter than the classic Jakkola bound and requires no additional variational parameters, becoming exact as $l \to \infty$. This yields VI-PER, a variational approach that closely matches Monte Carlo posterior quality while significantly reducing computation and improving uncertainty quantification over Polya-Gamma-based VI. Across simulations and real-world data (including soil liquefaction), VI-PER demonstrates competitive predictive performance and superior calibrated uncertainty, with an open-source PyTorch/gpytorch implementation available for broad use.
Abstract
Variational logistic regression is a popular method for approximate Bayesian inference seeing wide-spread use in many areas of machine learning including: Bayesian optimization, reinforcement learning and multi-instance learning to name a few. However, due to the intractability of the Evidence Lower Bound, authors have turned to the use of Monte Carlo, quadrature or bounds to perform inference, methods which are costly or give poor approximations to the true posterior. In this paper we introduce a new bound for the expectation of softplus function and subsequently show how this can be applied to variational logistic regression and Gaussian process classification. Unlike other bounds, our proposal does not rely on extending the variational family, or introducing additional parameters to ensure the bound is tight. In fact, we show that this bound is tighter than the state-of-the-art, and that the resulting variational posterior achieves state-of-the-art performance, whilst being significantly faster to compute than Monte-Carlo methods.
