Linear time dynamic programming for computing breakpoints in the regularization path of models selected from a finite set

Many learning algorithms are formulated in terms of finding model parameters which minimize a data-fitting loss function plus a regularizer. When the regularizer involves the ℓ0 pseudo-norm, the resulting regularization path consists of a finite set of ...