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: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.
By Alan Yufei Dong, Jihao Andreas Lin, Jos\'e Miguel Hern\'andez-Lobato
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.
By Hyunseok Seung, Matthias Katzfuss
arXiv:2607. 19498v1 Announce Type: cross Abstract: Gaussian process (GP) modeling is widely used in computational science and engineering.
By Eric Herrison Gyamfi, Emily L. Kang, Bledar A. Konomi, Guang Lin
The paper studies how flow‑matching schedules influence sampling dynamics and regression variance. For centered commuting Gaussians, it shows that a direction‑dependent schedule splits into a variance path that determines intermediate laws and a factorization that keeps the flow unchanged while controlling irreducible regression variance. The authors analyze finite‑step Euler accuracy, derive a drift bound for exact N‑step sampling, and provide closed‑form factorizations that either minimize time‑averaged regression variance or keep it constant along a fixed path.
By Ars\`ene Claustre (DI-ENS), Hugo Negrel (DMA, CFM), Claire Boyer (LMO, IUF), Kimia Nadjahi (DI-ENS), Eric Vanden-Eijnden (DMA, CFM, CIMS)
arXiv:2609.39488v1 Announce Type: new
Abstract: Flow matching generates samples by gradually transforming noise into data. In practice, using a finite number of sampling steps introduces a numerical...
By Ron Levy, Michael Elad
arXiv:2511. 15409v2 Announce Type: replace Abstract: We present a class of algorithms for state estimation in nonlinear, non-Gaussian state-space models.
By Hany Abdulsamad, \'Angel F. Garc\'ia-Fern\'andez, Simo S\"arkk\"a
arXiv:2606. 31230v1 Announce Type: new Abstract: We study the task of learning the structure of a $d$-sparse Gaussian graphical model on $n$ variables from a single trajectory of Glauber dynamics.
By Eric Shen, Tony Wu, Mahbod Majid, Ankur Moitra
arXiv:2607. 18559v1 Announce Type: cross Abstract: Gaussian graphical model selection is usually studied under independent sampling, but in many applications the data arise as a single trajectory of a dependent stochastic process.
By Vignesh Tirukkonda, Gautam Dasarathy
arXiv:2609. 21085v1 Announce Type: cross Abstract: Gaussian processes (GPs) provide principled probabilistic predictions while encoding prior knowledge, including equivariances.
By Tim Steinert, David Ginsbourger
arXiv:2609.36568v1 Announce Type: new
Abstract: Diffusion models have emerged as state-of-the-art generative models, with recent extensions from Euclidean spaces to Riemannian manifolds. However, exi...
By Yuhao Liu, Longbo Huang
arXiv:2604. 07635v2 Announce Type: replace-cross Abstract: This research considers a scalable inference for spatial data modeled through Gaussian intrinsic conditional autoregressive (ICAR) structures.
By Debjoy Thakur