TY - JOUR

T1 - ℓp-regularized least squares (0 < p < 1) and critical path

AU - Yukawa, Masahiro

AU - Amari, Shun Ichi

N1 - Funding Information:
This work was supported by a Grant-in-Aid through JSPS under Grant 24760292. This paper was presented at the IEEE International Symposium on Information Theory in 2012 [1].
Publisher Copyright:
© 2015 IEEE.
Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.

PY - 2016/1/1

Y1 - 2016/1/1

N2 - This paper elucidates the underlying structures of ℓp-regularized least squares problems in the nonconvex case of 0 < p < 1. The difference between two formulations is highlighted (which does not occur in the convex case of p = 1): 1) an ℓp -constrained optimization (Ppc) and 2) an ℓp-penalized (unconstrained) optimization (Lλ p). It is shown that the solution path of (Lλp) is discontinuous and also a part of the solution path of (Ppc). As an alternative to the solution path, a critical path is considered, which is a maximal continuous curve consisting of critical points. Critical paths are piecewise smooth, as can be seen from the viewpoint of the variational method, and generally contain non-optimal points, such as saddle points and local maxima as well as global/local minima. Our study reveals multiplicity (non-monotonicity) in the correspondence between the regularization parameters of (Ppc) and (Lλp). Two particular paths of critical points connecting the origin and an ordinary least squares (OLS) solution are studied further. One is a main path starting at an OLS solution, and the other is a greedy path starting at the origin. Part of the greedy path can be constructed with a generalized Minkowskian gradient. This paper of greedy path leads to a nontrivial close-link between the optimization problem of ℓp -regularized least squares and the greedy method of orthogonal matching pursuit.

AB - This paper elucidates the underlying structures of ℓp-regularized least squares problems in the nonconvex case of 0 < p < 1. The difference between two formulations is highlighted (which does not occur in the convex case of p = 1): 1) an ℓp -constrained optimization (Ppc) and 2) an ℓp-penalized (unconstrained) optimization (Lλ p). It is shown that the solution path of (Lλp) is discontinuous and also a part of the solution path of (Ppc). As an alternative to the solution path, a critical path is considered, which is a maximal continuous curve consisting of critical points. Critical paths are piecewise smooth, as can be seen from the viewpoint of the variational method, and generally contain non-optimal points, such as saddle points and local maxima as well as global/local minima. Our study reveals multiplicity (non-monotonicity) in the correspondence between the regularization parameters of (Ppc) and (Lλp). Two particular paths of critical points connecting the origin and an ordinary least squares (OLS) solution are studied further. One is a main path starting at an OLS solution, and the other is a greedy path starting at the origin. Part of the greedy path can be constructed with a generalized Minkowskian gradient. This paper of greedy path leads to a nontrivial close-link between the optimization problem of ℓp -regularized least squares and the greedy method of orthogonal matching pursuit.

KW - Critical points

KW - LARS

KW - Nonconvex optimization

KW - Sparse solution

KW - ℓ quasi-norm (0 < p < 1)

UR - http://www.scopus.com/inward/record.url?scp=84959378738&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959378738&partnerID=8YFLogxK

U2 - 10.1109/TIT.2015.2501362

DO - 10.1109/TIT.2015.2501362

M3 - Article

AN - SCOPUS:84959378738

VL - 62

SP - 488

EP - 502

JO - IRE Professional Group on Information Theory

JF - IRE Professional Group on Information Theory

SN - 0018-9448

IS - 1

M1 - 7330004

ER -