arXiv Machine Learning

Scalable Logistic Gaussian Process Density Regression with Kinetic Langevin Sampling

The paper introduces a scalable Bayesian method for conditional density estimation using a logistic Gaussian process. It models the log conditional density with a separable covariance— a Matérn kernel on the response dimension and a Nyström-feature kernel on covariates— and samples the latent field via kinetic Langevin dynamics instead of traditional approximations. Experiments on photometric‑redshift data with up to 3.9 million observations show the approach matches state‑of‑the‑art tabular foundation models on density and calibration metrics.

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
Aug 24

Exact and general decoupled solutions of the LMC Multitask Gaussian Process model

The paper presents an exact, efficient solution for the Linear Model of Co‑regionalization (LMC) multitask Gaussian Process by decoupling latent processes under a mild noise‑model assumption. It introduces a full parametrization of the resulting projected LMC, enabling linear‑time optimization and simplifying tasks such as training updates and leave‑one‑out cross‑validation. Experiments on synthetic and real data demonstrate that projected LMC is competitive with state‑of‑the‑art multitask GP models while offering greater interpretability and computational ease.

By Olivier Truffinet (CEA Saclay), Karim Ammar (CEA Saclay), Jean-Philippe Argaud (EDF R&D), Bertrand Bouriquet (EDF)
arXiv Machine Learning
Oct 9

Feature Space Adaptation for Effortless Gaussian Process Flows

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 Machine Learning
Oct 9

ISBO: Scalable Spatio-Temporal Bayesian Optimization with Log Gaussian Cox Process Models via the INLA-SPDE Approach

The paper introduces ISBO, a scalable Spatio‑Temporal Bayesian Optimization framework that models log‑intensity using a Log‑Gaussian Cox Process and performs inference via the INLA‑SPDE approach. By employing a Matern field on meshes, ISBO obtains a sparse Gaussian Markov Random Field, enabling fast and accurate posterior inference during sequential optimization. Experiments on synthetic and real‑world datasets demonstrate accurate peak discovery, intensity recovery, and significant speedups compared to an RKHS‑based baseline.

By Kaichuang Yang, H{\aa}vard Rue, Jakob Zeitler