[HDDA] sparse subspace constrained partial least squares. Issue 6 (13th April 2019)

• Record Type: Journal Article
• Authors: Sutton, Matthew; Mengersen, Kerrie; Liquet, Benoit
• Is Part Of: Journal of statistical computation and simulation. Volume 89:Issue 6(2019)
• Page Start: 1005
• Page End: 1019
• Publication Date: 2019-04-13
• Subjects: Deflation -- Lasso -- Partial Least Squares -- penalized matrix decomposition; Mathematical statistics -- Data processing -- Periodicals; Digital computer simulation -- Periodicals; 519.5028505
• DOI: 10.1080/00949655.2018.1555830
• Languages: English
• ISSNs: 0094-9655

Abstract

ABSTRACT: In this paper, we investigate the objective function and deflation process for sparse Partial Least Squares (PLS) regression with multiple components. While many have considered variations on the objective for sparse PLS, the deflation process for sparse PLS has not received as much attention. Our work highlights a flaw in the Statistically Inspired Modification of Partial Least Squares (SIMPLS) deflation method when applied in sparse PLS regression. We also consider the Nonlinear Iterative Partial Least Squares (NIPALS) deflation in sparse PLS regression. To remedy the flaw in the SIMPLS method, we propose a new sparse PLS method wherein the direction vectors are constrained to be sparse and lie in a chosen subspace. We give insight into this new PLS procedure and show through examples and simulation studies that the proposed technique can outperform alternative sparse PLS techniques in coefficient estimation. Moreover, our analysis reveals a simple renormalization step that can be used to improve the estimation of sparse PLS direction vectors generated using any convex relaxation method.