Robust feature extraction via information theoretic learning

In this paper, we present a robust feature extraction framework based on informationtheoretic learning. Its formulated objective aims at simultaneously maximizing the Renyi's quadratic information potential of features and the Renyi's cross information potential between features and class labels. This objective function reaps the advantages in robustness from both redescending M-estimator and manifold regularization, and can be efficiently optimized via halfquadratic optimization in an iterative manner. In addition, the popular algorithms LPP, SRDA and LapRLS for feature extraction are all justified to be the special cases within this framework. Extensive comparison experiments on several real-world data sets, with contaminated features or labels, well validate the encouraging gain in algorithmic robustness from this proposed framework.

• Type: Conference
• Year: 2009
• Where: ICML
• Authors: Xiaotong Yuan, Bao-Gang Hu
• Keywords: Algorithmic Robustness, Feature Extraction Framework, ICML 2009, Machine Learning, Quadratic Information Potential