arXiv Analytics

Sign in

arXiv:2205.07764 [stat.ML]AbstractReferencesReviewsResources

On the inability of Gaussian process regression to optimally learn compositional functions

Matteo Giordano, Kolyan Ray, Johannes Schmidt-Hieber

Published 2022-05-16Version 1

We rigorously prove that deep Gaussian process priors can outperform Gaussian process priors if the target function has a compositional structure. To this end, we study information-theoretic lower bounds for posterior contraction rates for Gaussian process regression in a continuous regression model. We show that if the true function is a generalized additive function, then the posterior based on any mean-zero Gaussian process can only recover the truth at a rate that is strictly slower than the minimax rate by a factor that is polynomially suboptimal in the sample size $n$.

Related articles: Most relevant | Search more
arXiv:1912.06689 [stat.ML] (Published 2019-12-13)
Frequentist Consistency of Gaussian Process Regression
arXiv:2406.12678 [stat.ML] (Published 2024-06-18)
Contraction rates for conjugate gradient and Lanczos approximate posteriors in Gaussian process regression
arXiv:2310.20630 [stat.ML] (Published 2023-10-31)
Projecting basis functions with tensor networks for Gaussian process regression