The paper introduces a new variational inference framework that uses tangent transformations to handle strongly super‑Gaussian likelihoods across a wide range of probability models. By constructing tangent minorants of the log‑likelihood through convex duality, the method achieves conjugacy with Gaussian priors, enabling tractable inference where traditional approaches struggle. The authors provide algorithmic convergence guarantees and near‑parametric risk bounds, and demonstrate superior scalability and accuracy on both simulated and real‑world datasets compared to existing variational algorithms.
By Somjit Roy, Pritam Dey, Debdeep Pati, Bani K. Mallick
arXiv:2610.28256v1 Announce Type: cross
Abstract: Sparse variational Gaussian processes (SVGPs) are a widely used, principled approach to scalable Gaussian process modelling. Their success stems from...
By Matteo Hoxha
arXiv:2406. 12659v3 Announce Type: replace-cross Abstract: We propose a scalable variational Bayes method for statistical inference for a single or pre-specified low-dimensional subset of the coordinates of a high-dimensional parameter in sparse linear regression.
By Isma\"el Castillo, Alice L'Huillier, Kolyan Ray, Luke Travis
arXiv:2606. 25882v1 Announce Type: new Abstract: DGPs are probabilistic models with remarkable prediction performance that concatenate GPs across several layers.
By Francisco Javier S\'aez-Maldonado, Juan Maro\~nas, Daniel Hern\'andez-Lobato
arXiv:2410. 14843v4 Announce Type: replace-cross Abstract: Vanilla variational inference finds an optimal approximation to the Bayesian posterior distribution, but even the exact Bayesian posterior is often not meaningful under model misspecification.
By Jinlin Lai, Antonio Linero, Yuling Yao
The paper introduces Gradient-based Sample Selection Bayesian Optimization (GSSBO), a method that builds the Gaussian process surrogate on a strategically chosen subset of samples rather than the full dataset. By using gradient information to eliminate redundant points while keeping diversity and representativeness, GSSBO achieves sublinear regret bounds and reduces the cubic computational cost of standard BO. Experiments on synthetic and real-world tasks show that this approach maintains comparable optimization performance while significantly cutting GP fitting time and resource usage.
By Qiyu Wei, Haowei Wang, Zirui Cao, Songhao Wang, Richard Allmendinger, Mauricio A \'Alvarez
The paper introduces a stochastic gradient Markov Chain Monte Carlo (SGMCMC) algorithm designed for Bayesian generalized linear mixed models (GLMMs). By employing Fisher's identity, it constructs a biased Monte Carlo estimator of the gradient of the marginal log-likelihood, enabling scalable inference even when direct gradient computation is infeasible. The authors provide a post-hoc covariance correction to calibrate posterior uncertainty and demonstrate the method’s accuracy and practical impact on large-scale biomedical data, notably electronic health records.
By Youngsoo Baek, Andrea Agazzi, Felipe A. Medeiros, Samuel I. Berchuck
arXiv:2512. 01930v2 Announce Type: replace-cross Abstract: Stochastic Variance Reduced Gradient (SVRG) and its variants aim to speed-up training by using gradient corrections.
By Nico Daheim, Thomas M\"ollenhoff, Ming Liang Ang, Mohammad Emtiyaz Khan
The paper introduces a scalable variational inference framework for latent field models with non‑Gaussian likelihoods. It mirrors the sparse nearest‑neighbor autoregressive structure of the Gaussian process prior in the variational family, employs normalizing‑flow conditionals for expressiveness, and amortizes all variational parameters through a single shared neural conditioner. The method achieves polylogarithmic per‑iteration complexity via doubly stochastic optimization with reduced ancestor sets.
By Paul F. V. Wiemann, Matthias Katzfuss
arXiv:2607. 21843v1 Announce Type: cross Abstract: Empirical Bayes (EB) performs simultaneous inference across many related latent variables.
By Xinwei Shen, Diana Cai, Cheng Zhang, David M. Blei
arXiv:2606. 07841v1 Announce Type: cross Abstract: Black-box variational inference (BBVI) is a methodology for posterior approximation that relies on stochastic optimization.
By Trevor Campbell, Jonathan H. Huggins, Kyurae Kim, Charles C. Margossian
The paper introduces Sources of Uncertainty (SoU) inference, a framework that extends Bayesian inference by allowing heterogeneous confidence to be encoded across model components. This selective treatment controls the uncertainty retained in each component and its propagation, yielding Empirical Bayes and profiling-type inference as special cases. The authors also present a general method for inducing sparsity, demonstrating its application in linear and logistic regression and in Bayesian neural networks for self‑pruning.
By Rafael Mouallem Rosa, Julyan Arbel, Hien Duy Nguyen