arXiv Machine Learning

Online Gradient Computation for Warping Gaussian Process Transformations

arXiv Machine Learning
Jul 27

gp2Scale: A Class of Compactly Supported Non-Stationary Kernels and Distributed Computing for Exact Gaussian Processes on 10 Million Data Points

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 Machine Learning
3d ago

Amortized Structured Stochastic Variational Inference for Gaussian Process Latent Variable Models

The paper introduces Amortized Structured Stochastic Variational Inference for Gaussian Process Latent Variable Models, enabling the variational posterior over latent variables to depend on GP inducing points. This approach addresses limitations of mean‑field approximations and yields improved reconstruction metrics for data manifold points.

By Maksym Tretiakov, Sarah Lucie Filipp, Vincent Fortuin, Ruth Misener, Ruby Sedgwick, James Odgers
arXiv Machine Learning
3d ago

Predictively Oriented Gaussian Process Posteriors

arXiv:2610.03201v1 Announce Type: cross Abstract: Gaussian Processes (GPs) are a powerful tool for modelling and quantifying uncertainty in functional relationships. However, they require practitione...

By Callum Lau, Jeremias Knoblauch, Louis Sharrock
arXiv Machine Learning
Sep 14

A Generalized Tangent Approximation based Variational Inference Framework for Strongly Super-Gaussian Likelihoods

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 Machine Learning
Sep 10

Accelerating Diffusion Transformers with Gaussian Process Rectified Feature Cache

The paper introduces GP-Refiner, a plug‑and‑play framework that uses Gaussian Process Regression to correct feature predictions in Diffusion Transformers. By observing that residuals between cached and full‑compute features follow a local zero‑mean Gaussian distribution, the method treats cached features as noisy observations of the true trajectory, enabling online correction without needing explicit labels. Experiments show that integrating GP‑Refiner with existing acceleration techniques, such as TaylorSeer, cuts computational load by 19.3% while improving image quality metrics (PSNR +0.9 dB, LPIPS 0.46→0.29).

By Zhirong Shen, Rui Huang, Chang Zou, Shikang Zheng, Jiacheng Liu, Peiliang Cai, Zhengyi Shi, Yaosong Du, Liang Feng, Xiaobing Tu, Jinkui Ren, Xiantao Zhang, Linfeng Zhang
arXiv Machine Learning
Sep 4

No-Regret Bayesian Optimization with Finite-Library Input-Warped Kernels

The paper introduces Finite-Library Input-Warped Bayesian Optimization (FLIWBO), a method that selects input warps from a finite library to adapt the geometry used by Gaussian‑process Bayesian optimization. FLIWBO maintains high‑probability convergence guarantees while improving sample efficiency on problems where raw coordinates poorly match the objective’s geometry, such as log‑scaled hyperparameters or localized peaks. Experiments on synthetic benchmarks, Fashion‑MNIST hyperparameter tuning, and a 20‑dimensional multi‑agent system design demonstrate that FLIWBO‑UCB outperforms raw‑coordinate GP‑UCB and other methods with regret guarantees, especially under misspecified geometry.

By Edvin Ketabati Augustinsson, Robert A. Bridges
arXiv Machine Learning
Jul 1

Dynamic Gaussian Processes and the Vanilla-SPDE Exchange

arXiv:2606. 31063v1 Announce Type: cross Abstract: Gaussian process inference is often limited by cubic computational costs, a challenge that becomes more pronounced in spatio-temporal settings where posterior inference is required over dense grids.

By Rui-Yang Zhang, Lachlan Astfalck, Edward Cripps, David Leslie, Henry Moss