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
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:2606. 01954v1 Announce Type: new Abstract: Implicit-process priors define distributions over functions through flexible generative mechanisms, making them attractive for Bayesian function-space modelling.
By Luis A. Ortega, Andr\'es R. Masegosa, Thomas D. Nielsen
The paper presents a tuning‑free empirical Bayes framework for Bayesian generalized linear models that uses a novel mean‑field variational inference algorithm. By estimating the prior within the VI procedure and optimizing the posterior mean directly, the method reduces optimization complexity and supports scalable solvers like L‑BFGS and stochastic gradient descent. Applied to sparse logistic regression, the approach shows superior predictive performance compared to existing methods.
By Dongyue Xie, Matthew Stephens
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: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: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
arXiv:2509.10393v5 Announce Type: replace-cross
Abstract: Several methods in statistics and machine learning target a probability distribution for which an entropy-regularised variational objective i...
By Cl\'ementine Chazal, Heishiro Kanagawa, Zheyang Shen, Anna Korba, Chris. J. Oates
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 NeVI‑Cut, a modular variational inference method for cut‑Bayes that does not require access to upstream data or models. It approximates the cut‑posterior by minimizing the expected downstream conditional Kullback‑Leibler divergence, using conditional normalizing flows as the variational family. The authors provide fixed‑data convergence rates, establish uniform KL approximation results for flow classes, and demonstrate the algorithm’s speed and accuracy on several applications.
By Jiafang Song, Sandipan Pramanik, Abhirup Datta
arXiv:2606. 15458v1 Announce Type: cross Abstract: Variational inference (VI) is a core engine of modern AI, enabling scalable approximate Bayesian learning and uncertainty-aware training of large probabilistic and generative models.
By Yuda Shao, Zhiling Gu, Shan Yu
The paper investigates whether momentum-based acceleration can improve Gaussian variational inference (GVI) for strongly log-concave, log-smooth targets. With exact Gaussian expectations, GVI achieves the classic accelerated √κ convergence rate, but when only pointwise derivatives are available, the authors construct targets that force any randomized algorithm to use κ^{1-o(1)} queries, showing curvature alone does not guarantee acceleration. They identify additional structure—specifically a Hessian-Lipschitz condition with small Hessian variation—under which variance-reduced stochastic methods can achieve accelerated guarantees, and demonstrate empirical speedups on real datasets.
By Jaesung R. Park, Uijeong Jang, Yifan Chen