A non-asymptotic upper bound in prediction for the PLS estimator

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Castelli, Luca, Gannaz, Irène, Marteau, Clément
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909347716530176
author Castelli, Luca
Gannaz, Irène
Marteau, Clément
author_facet Castelli, Luca
Gannaz, Irène
Marteau, Clément
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2410_10237
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A non-asymptotic upper bound in prediction for the PLS estimator
Castelli, Luca
Gannaz, Irène
Marteau, Clément
Statistics Theory
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.
title A non-asymptotic upper bound in prediction for the PLS estimator
topic Statistics Theory
url https://arxiv.org/abs/2410.10237