Pith. sign in

REVIEW

Robust Learning with Kernel Mean p-Power Error Loss

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1612.07019 v1 pith:NNNL5QUP submitted 2016-12-21 stat.ML cs.LG

classification stat.MLcs.LG
keywords kernellearningkmperobustalgorithmserrorlossmeasure
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Correntropy is a second order statistical measure in kernel space, which has been successfully applied in robust learning and signal processing. In this paper, we define a nonsecond order statistical measure in kernel space, called the kernel mean-p power error (KMPE), including the correntropic loss (CLoss) as a special case. Some basic properties of KMPE are presented. In particular, we apply the KMPE to extreme learning machine (ELM) and principal component analysis (PCA), and develop two robust learning algorithms, namely ELM-KMPE and PCA-KMPE. Experimental results on synthetic and benchmark data show that the developed algorithms can achieve consistently better performance when compared with some existing methods.

Discussion (0). Continue with ORCID to comment.

Pith tools