Decomposed Gaussian Processes for Efficient Regression Models with Low Complexity

In this paper, we address the challenges of inferring and learning from a substantial number of observations (N≫1) with a Gaussian process regression model. First, we propose a flexible construction of well-adapted covariances originally derived from specific differential operators. Second, we prove its convergence and show its low computational cost scaling as O(Nm2) for inference and O(m3) for learning instead of O(N3) for a canonical Gaussian process where N≫m. Moreover, we develop an implementation that requires less memory O(m2) instead of O(N2). Finally, we demonstrate the effectiveness of the proposed method with simulation studies and experiments on real data. In addition, we conduct a comparative study with the aim of situating it in relation to certain cutting-edge methods.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2025-04-07
DOI
https://doi.org/10.3390/e27040393
Citations
1
Primary Topic
Gaussian Processes and Bayesian Inference
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decomposed Gaussian Processes for Efficient Regression Models with Low Complexity

Chafik Samir, Anis Fradi, Tien-Tam Tran
1 citations
Entropy
Gaussian Processes and Bayesian Inference
2.48
article

Decomposed Gaussian Processes for Efficient Regression Models with Low Complexity

Chafik Samir, Anis Fradi, Tien-Tam Tran
article en
1 citations

Abstract

In this paper, we address the challenges of inferring and learning from a substantial number of observations (N≫1) with a Gaussian process regression model. First, we propose a flexible construction of well-adapted covariances originally derived from specific differential operators. Second, we prove its convergence and show its low computational cost scaling as O(Nm2) for inference and O(m3) for learning instead of O(N3) for a canonical Gaussian process where N≫m. Moreover, we develop an implementation that requires less memory O(m2) instead of O(N2). Finally, we demonstrate the effectiveness of the proposed method with simulation studies and experiments on real data. In addition, we conduct a comparative study with the aim of situating it in relation to certain cutting-edge methods.

EntropyVol. 27(4)
Université Claude Bernard Lyon 1 (FR), Centre National de la Recherche Scientifique (FR), Vietnam National University, Hanoi (VN), Université Lumière Lyon 2 (FR), Université Clermont Auvergne (FR), University of Clermont Auvergne (FR)
Openalex Percentile: Top 11%
Gaussian Processes and Bayesian Inference
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.