arXiv · 2410.10237
A non-asymptotic upper bound in prediction for the PLS estimator
Abstract
We investigate the theoretical performances of the Partial Least Square (PLS) algorithm in a high dimensional context. We provide upper bounds on the risk in prediction for the statistical linear model when considering the PLS estimator. Our bounds are non-asymptotic and are expressed in terms of the number of observations, the noise level, the properties of the design matrix, and the number of considered PLS components. In particular, we exhibit some scenarios where the variability of the PLS may explode and prove that we can get round of these situations by introducing a Ridge regularization step. These theoretical findings are illustrated by some numerical simulations.
Explore related subjects
Keep this discovery
Luca Castelli, Irène Gannaz, Clément Marteau. 2024-10-14. A non-asymptotic upper bound in prediction for the PLS estimator. https://arxiv.org/abs/2410.10237
Cite the original work for its findings. Save a collection to share your selection of sources.