arXiv:2607. 19498v1 Announce Type: cross Abstract: Gaussian process (GP) modeling is widely used in computational science and engineering.
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...
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.
The paper introduces an adaptive multi‑resolution Gaussian process framework that achieves scalable, exact inference by constructing a naturally data‑sparse covariance matrix using basis functions anchored directly to samples. By shrinking the support domains of these basis functions, the resulting matrix has limited block sizes, ensuring sparsity and enabling efficient computation of its inverse via a sparse Cholesky algorithm. The authors demonstrate that this approach yields exact inference with training cost ≠≠ O(n log^2 n) and prediction cost ≠≠ O(log^d n), while also improving predictive uncertainties through an augmented basis function.
The paper introduces Compressed Active Subspaces (CAS), a scalable method for Bayesian inference in high‑dimensional models. CAS first compresses model parameters via a structured isometric embedding, then constructs the active subspace in this reduced space, dramatically lowering memory requirements. Experiments on neural networks of growing size show that CAS preserves predictive performance and provides robust uncertainty estimates while enabling inference where traditional active subspace methods fail.
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.
arXiv:2608. 16606v1 Announce Type: new Abstract: Outliers can substantially distort Gaussian process regression (GPR) due to its conventional Gaussian observation likelihood, leading to inaccurate model learning and prediction.
arXiv:2603.16621v2 Announce Type: replace Abstract: We propose a conjugate and calibrated Gaussian process (GP) model for multi-class classification by exploiting the geometry of the probability simp...
arXiv:2605. 10285v2 Announce Type: replace-cross Abstract: We present a theoretically grounded Gaussian process framework that leverages neural feature maps to construct expressive kernels.
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.
arXiv:2603. 16481v3 Announce Type: replace Abstract: Non-conservative uncertainty bounds are essential for making reliable predictions about latent functions from noisy data, and thus, a key enabler for safe learning-based control.
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.