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

Matteo Giordano, Kolyan Ray, Johannes Schmidt-Hieber

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)
105 Downloads (Pure)

Abstract

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.

Original languageEnglish
Title of host publication36th Conference on Neural Information Processing Systems, NeurIPS 2022
EditorsS. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, A. Oh
PublisherNeural information processing systems foundation
Number of pages13
ISBN (Electronic)9781713871088
Publication statusPublished - 2022
Event36th Annual Conference on Neural Information Processing Systems, NeurIPS 2022: Connecting Methods and Applications - New Orleans Convention Center, New Orleans, United States
Duration: 28 Nov 20229 Dec 2022
Conference number: 36
https://neurips.cc/Conferences/2022

Publication series

NameAdvances in Neural Information Processing Systems
PublisherNeural Information Processing Systems Foundation
Volume35
ISSN (Print)1049-5258

Conference

Conference36th Annual Conference on Neural Information Processing Systems, NeurIPS 2022
Abbreviated titleNeurIPS 2022
Country/TerritoryUnited States
CityNew Orleans
Period28/11/229/12/22
Internet address

Fingerprint

Dive into the research topics of 'On the inability of Gaussian process regression to optimally learn compositional functions'. Together they form a unique fingerprint.

Cite this