Principal component analysis for Gaussian process posteriors
Not on the map. Why?
Abstract (arXiv)
This paper proposes an extension of principal component analysis for Gaussian process (GP) posteriors, denoted by GP-PCA. Since GP-PCA estimates a low-dimensional space of GP posteriors, it can be used for meta-learning, which is a framework for improving the performance of target tasks by estimating a structure of a set of tasks. The issue is how to define a structure of a set of GPs with an infinite-dimensional parameter, such as coordinate system and a divergence. In this study, we reduce the infiniteness of GP to the finite-dimensional case under the information geometrical framework by considering a space of GP posteriors that have the same prior. In addition, we propose an approximation method of GP-PCA based on variational inference and demonstrate the effectiveness of GP-PCA as meta-learning through experiments.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 32 references that are in the map. First posted on arXiv 15 Jul 2021.
Builds on
7 of 32 references.
References · 7
- 2020Meta-Learning in Neural Networks: A Surveycited by 944
- 2018When Gaussian Process Meets Big Data: A Review of Scalable GPscited by 205
- 2020A Survey of Deep Meta-Learningcited by 99
- 2020PACOH: Bayes-Optimal Meta-Learning with PAC-Guaranteescited by 85
- 2018An elementary introduction to information geometrycited by 76
- 2018Transferring Knowledge across Learning Processescited by 22
- 2019Meta-Learning Mean Functions for Gaussian Processescited by 17
Built on by
Citing papers per year: 2022: 1.
1 paper.
- 2022Geometry of EM and related iterative algorithmscited by 2
- 2022Geometry of EM and related iterative algorithms3 Sep 2022