288 pp. per issue
6 x 9, illustrated
2014 Impact factor:

Neural Computation

November 2017, Vol. 29, No. 11, Pages 3014-3039
(doi: 10.1162/neco_a_01002)
© 2017 Massachusetts Institute of Technology
A Robust Regression Framework with Laplace Kernel-Induced Loss
Article PDF (569.96 KB)

This work proposes a robust regression framework with nonconvex loss function. Two regression formulations are presented based on the Laplace kernel-induced loss (LK-loss). Moreover, we illustrate that the LK-loss function is a nice approximation for the zero-norm. However, nonconvexity of the LK-loss makes it difficult to optimize. A continuous optimization method is developed to solve the proposed framework. The problems are formulated as DC (difference of convex functions) programming. The corresponding DC algorithms (DCAs) converge linearly. Furthermore, the proposed algorithms are applied directly to determine the hardness of licorice seeds using near-infrared spectral data with noisy input. Experiments in eight spectral regions show that the proposed methods improve generalization compared with the traditional support vector regressions (SVR), especially in high-frequency regions. Experiments on several benchmark data sets demonstrate that the proposed methods achieve better results than the traditional regression methods in most of data sets we have considered.