Efficient least angle regression for identification of linear-in-the-parameters models

Zhao, W, Beach, TH and Rezgui, Y (2017) Efficient least angle regression for identification of linear-in-the-parameters models. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 473 (2198). ISSN 1364-5021

Preview

Accepted Version Available under License In Copyright. Download (386kB) | Preview

Abstract

© 2017 The Author(s) Published by the Royal Society. All rights reserved. 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 L1 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 wellknown 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.