Insights Into the Robustness of Minimum Error Entropy Estimation

被引:75
作者
Chen, Badong [1 ]
Xing, Lei [1 ]
Xu, Bin [2 ]
Zhao, Haiquan [3 ]
Principe, Jose C. [1 ,4 ]
机构
[1] Xi An Jiao Tong Univ, Inst Artificial Intelligence & Robot, Xian 710049, Peoples R China
[2] Northwestern Polytech Univ, Sch Automat, Xian 710000, Shaanxi, Peoples R China
[3] Southwest Jiaotong Univ, Sch Elect Engn, Chengdu 611756, Sichuan, Peoples R China
[4] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA
关键词
Estimation; minimum error entropy (MEE); robustness; CRITERION; MINIMIZATION; ALGORITHMS;
D O I
10.1109/TNNLS.2016.2636160
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The minimum error entropy (MEE) is an important and highly effective optimization criterion in information theoretic learning (ITL). For regression problems, MEE aims at minimizing the entropy of the prediction error such that the estimated model preserves the information of the data generating system as much as possible. In many real world applications, the MEE estimator can outperform significantly the well-known minimum mean square error (MMSE) estimator and show strong robustness to noises especially when data are contaminated by non-Gaussian (multimodal, heavy tailed, discrete valued, and so on) noises. In this brief, we present some theoretical results on the robustness of MEE. For a one-parameter linear errors-in-variables (EIV) model and under some conditions, we derive a region that contains the MEE solution, which suggests that the MEE estimate can be very close to the true value of the unknown parameter even in presence of arbitrarily large outliers in both input and output variables. Theoretical prediction is verified by an illustrative example.
引用
收藏
页码:731 / 737
页数:7
相关论文
共 26 条
[11]   Information theoretic clustering [J].
Gokcay, E ;
Principe, JC .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (02) :158-171
[12]   AN ANALYSIS OF THE TOTAL LEAST-SQUARES PROBLEM [J].
GOLUB, GH ;
VANLOAN, CF .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1980, 17 (06) :883-893
[13]   A minimum-error entropy criterion with self-adjusting step-size (MEE-SAS) [J].
Han, Seungju ;
Rao, Sudhir ;
Erdogmus, Deniz ;
Jeong, Kyu-Hwa ;
Principe, Jose .
SIGNAL PROCESSING, 2007, 87 (11) :2733-2745
[14]  
Hu T, 2013, J MACH LEARN RES, V14, P377
[15]   Complex-Valued Filtering Based on the Minimization of Complex-Error Entropy [J].
Huang, Songyan ;
Li, Chunguang ;
Liu, Yiguang .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2013, 24 (05) :695-708
[16]  
Huffel S.V., 1991, TOTAL LEAST SQUARES, V9
[17]  
Kailath Thomas., 2000, Linear Estimation, V1
[18]   Overview of total least-squares methods [J].
Markovsky, Ivan ;
Van Huffel, Sabine .
SIGNAL PROCESSING, 2007, 87 (10) :2283-2302
[19]   Unsupervised Learning by Minimal Entropy Encoding [J].
Melacci, Stefano ;
Gori, Marco .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2012, 23 (12) :1849-1861
[20]   Advanced search algorithms for information-theoretic learning with kernel-based estimators [J].
Morejon, RA ;
Principe, JC .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2004, 15 (04) :874-884