Globally sparse PLS regression - CentraleSupélec Access content directly
Book Sections Year : 2013

Globally sparse PLS regression


Partial least squares (PLS) regression combines dimensionality reduction and prediction using a latent variable model. It provides better predictive ability than principle component analysis by taking into account both the independent and re- sponse variables in the dimension reduction procedure. However, PLS suffers from over-fitting problems for few samples but many variables. We formulate a new criterion for sparse PLS by adding a structured sparsity constraint to the global SIMPLS optimization. The constraint is a sparsity-inducing norm, which is useful for selecting the important variables shared among all the components. The optimization is solved by an augmented Lagrangian method to obtain the PLS components and to perform variable selection simultaneously. We propose a novel greedy algorithm to overcome the computation difficulties. Experiments demonstrate that our approach to PLS regression attains better performance with fewer selected predictors
Fichier principal
Vignette du fichier
liu_GSIMPLS_Springer13.pdf (3.27 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01069009 , version 1 (26-09-2014)



Tzu-Yu Liu, Laura Trinchera, Arthur Tenenhaus, Dennis Wei, Alfred Hero. Globally sparse PLS regression. New perspectives in Partial Least Squares and Related Methods, Springer, pp.117-127, 2013, Springer Proceedings in Mathematics & Statistics, ⟨10.1007/978-1-4614-8283-3_7⟩. ⟨hal-01069009⟩
107 View
323 Download



Gmail Facebook X LinkedIn More