Efficient least angle regression for identification of linear-in-the-parameters models. (February 2017)

• Record Type: Journal Article
• Authors: Zhao, Wanqing; Beach, Thomas H.; Rezgui, Yacine
• Is Part Of: Proceedings. Volume 473:Number 2198(2017)
• Publication Date: 2017-02
• Subjects: computational efficiency -- least angle regression -- linear-in-the-parameters models -- model selection -- system identification; Physical sciences -- Periodicals; Engineering -- Periodicals; Mathematics -- Periodicals; 500
• DOI: 10.1098/rspa.2016.0775
• Languages: English
• ISSNs: 1364-5021

Abstract

Abstract : Least angle regression, as a promising model selection method, differentiates itself from conventional stepwise and stagewise methods, in that it is neither too greedy nor too slow. It is closely related to L 1 norm optimization, which has the advantage of low prediction variance through sacrificing part of model bias property in order to enhance model generalization capability. In this paper, we propose an efficient least angle regression algorithm for model selection for a large class of linear-in-the-parameters models with the purpose of accelerating the model selection process. The entire algorithm works completely in a recursive manner, where the correlations between model terms and residuals, the evolving directions and other pertinent variables are derived explicitly and updated successively at every subset selection step. The model coefficients are only computed when the algorithm finishes. The direct involvement of matrix inversions is thereby relieved. A detailed computational complexity analysis indicates that the proposed algorithm possesses significant computational efficiency, compared with the original approach where the well-known efficient Cholesky decomposition is involved in solving least angle regression. Three artificial and real-world examples are employed to demonstrate the effectiveness, efficiency and numerical stability of the proposed algorithm.