Abstract
In this letter, optimization properties of Minimization of Error Entropy (MEE) and Minimization of Error Entropy with Fiducial points (MEEF) are presented. It is proved that by varying the kernel parameter of the MEE and/or MEEF objective function, the resulting problem, in general leads to an invex problem. Furthermore, for certain values of the kernel parameter it is shown that the problems may transform to convex or pseudo-convex problems.
| Original language | English |
|---|---|
| Article number | 6619422 |
| Pages (from-to) | 1159-1162 |
| Number of pages | 4 |
| Journal | IEEE Signal Processing Letters |
| Volume | 20 |
| Issue number | 12 |
| DOIs | |
| State | Published - 2013 |
| Externally published | Yes |
Keywords
- Entropic learning
- Error entropy
- Information potential
- Information theoretic learning
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering
- Applied Mathematics