arXiv Machine Learning
Derivative Gaussian Processes on a Two-Direction Budget
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jun 3
Scalable Derivative Gaussian Processes via Exact Gradient Reduction
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.
arXiv Machine Learning
Jun 30
Warm-Starting Iterative Gaussian Processes for Faster Sequential Inference
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.
arXiv Machine Learning
1d ago
Geometry-Aware Block Selection for Sparse Variational Gaussian Processes
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...
arXiv Machine Learning
Oct 9
SCORE: Spectral Correlation Estimation for Multivariate Gaussians
The paper introduces SCORE, a scalable framework that learns an expressive covariance approximation for high‑dimensional Gaussian targets by combining scoring rule training with spectral‑space modeling. It decomposes the learning task into marginal distribution estimation and structured correlation matrix learning, achieving dense dependencies with linear storage and ≠(d log d) computational cost. The method employs a closed‑form Gaussian kernel score that remains valid for degenerate covariances, provides bounded gradients, and is invariant under unitary transforms, with theoretical guarantees on marginal recovery and correlation projection, and demonstrates improved performance on time‑series forecasting, monocular depth estimation, and spatial weather prediction.
arXiv Machine Learning
Oct 7
Direct Regret Optimization in Bayesian Optimization
arXiv:2507.06529v2 Announce Type: replace Abstract: Bayesian optimization (BO) is a powerful paradigm for optimizing expensive black-box functions. Traditional BO methods typically rely on separate h...
arXiv Machine Learning
Oct 9
Exploiting Gradients in Bayesian Inference of Expensive Simulators
The paper explores how to use gradients of simulator outputs with respect to input parameters to improve Bayesian inference for expensive simulators. By incorporating gradient information into Gaussian process surrogate models, the authors show that Bayesian optimization can converge faster under a limited simulation budget. They find that reverse‑mode differentiation yields efficiency gains, while forward‑mode does not offset its computational cost, especially when the number of parameters exceeds the output dimensionality.