arXiv:2511. 16340v2 Announce Type: replace Abstract: Efficient Gaussian process (GP) inference is critical for sequential decision-making tasks such as active learning, online prediction, and Bayesian optimization.
By Alan Yufei Dong, Jihao Andreas Lin, Jos\'e Miguel Hern\'andez-Lobato
The paper introduces improvements to FlowGP, a method for conditional sampling from Gaussian processes outside the linear-Gaussian regime. It adds kernel approximations to scale to high-resolution domains and a new technique for computing marginal likelihood by measuring the work required to steer diffusion toward conditioning statements. These advances enable hyperparameter optimisation within FlowGP and are demonstrated on tasks such as probabilistic downscaling, PDE solution inference on irregular domains, and sea level anomaly field recovery from non-Gaussian satellite data.
By Thomas Cowperthwaite, Louis Sharrock, Lachlan Astfalck, Henry Moss
arXiv:2606. 02909v1 Announce Type: cross Abstract: Gradient observations can substantially improve Gaussian process (GP) surrogates, particularly in high-dimensional settings where function evaluations are expensive.
By Hyunseok Seung, Matthias Katzfuss
arXiv:2609. 21085v1 Announce Type: cross Abstract: Gaussian processes (GPs) provide principled probabilistic predictions while encoding prior knowledge, including equivariances.
By Tim Steinert, David Ginsbourger
arXiv:2610.22885v1 Announce Type: cross
Abstract: Classifier-free guidance (CFG) is a standard component of conditional diffusion models, and guided generation performance has become the \textit{de f...
By Haoming Liu, Junhao Zhu, Shaoyi Zheng, Yuanhe Guo, Jinnuo Liu, Shenji Wan, Hongyi Wen
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
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
arXiv:2607. 24583v1 Announce Type: new Abstract: Large scale Bayesian nonparametrics (BNP) learner such as Stochastic Variational Inference (SVI) can handle datasets with large class number and large training size at fractional cost.
By Kart-Leong Lim
arXiv:2512. 06143v2 Announce Type: replace Abstract: Despite a large corpus of recent work on scaling up Gaussian processes, a stubborn trade-off between computational speed, prediction and uncertainty quantification accuracy, and customizability persists.
By Marcus M. Noack, Mark D. Risser, Hengrui Luo, Vardaan Tekriwal, Ronald J. Pandolfi
arXiv:2607. 19498v1 Announce Type: cross Abstract: Gaussian process (GP) modeling is widely used in computational science and engineering.
By Eric Herrison Gyamfi, Emily L. Kang, Bledar A. Konomi, Guang Lin
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
arXiv:2610.10428v1 Announce Type: cross
Abstract: Gradient observations promise more accurate Gaussian process (GP) surrogates, but the cost of incorporating them has long stood in the way of realizi...
By Hyunseok Seung, Matthias Katzfuss