arXiv Machine Learning By Christopher B\"ulte, Emil Partow, Astha Gupta, Pascal Esser, Gitta Kutyniok

SCORE: Spectral Correlation Estimation for Multivariate Gaussians

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

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 AI
Sep 28

Adaptive multi-resolution Gaussian processes: Scalable exact inference with naturally data-sparse covariance matrices

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.

By Yanchuang Cao, Jun Liu, Tengchao Yu, Heng Yong