A novel local patch framework for fixing supervised learning models

In the past decades, machine learning models, especially supervised learning algorithms, have been widely used in various real world applications. However, no matter how strong a learning model is, it will suffer from the prediction errors when it is applied to real world problems. Due to the black box nature of supervised learning models, it is a challenging problem to fix the supervised learning models by further learning from the failure cases it generates. In this paper, we propose a novel Local Patch Framework (LPF) to locally fix supervised learning models by learning from its predicted failure cases. Since the learning models are generally globally optimized during training process, our proposed LPF assumes that most of the learning errors are led by local errors in the model. Thus we aim to break the black boxes of learning models by identifying and fixing the local errors of various models automatically. The proposed LPF has two key steps, which are local error region subspace learning and local patch model learning. Through this way, we aim to fix the errors of learning models locally and automatically with certain generalization ability on unseen testing data. Experiments on both classification and ranking problems show that the proposed LPF is effective and outperforms the original algorithms and the incremental learning model.

[1]  Wei Liu,et al.  Semi-supervised distance metric learning for collaborative image retrieval and clustering , 2010, ACM Trans. Multim. Comput. Commun. Appl..

[2]  Kilian Q. Weinberger,et al.  Web-Search Ranking with Initialized Gradient Boosted Regression Trees , 2010, Yahoo! Learning to Rank Challenge.

[3]  Kilian Q. Weinberger,et al.  Metric Learning for Kernel Regression , 2007, AISTATS.

[4]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.

[5]  Sanjay Jain,et al.  Open Problems in "Systems That Learn" , 1994, J. Comput. Syst. Sci..

[6]  Robi Polikar,et al.  Learn++.MT: A New Approach to Incremental Learning , 2004, Multiple Classifier Systems.

[7]  Yoav Freund,et al.  A Short Introduction to Boosting , 1999 .

[8]  José del Campo-Ávila,et al.  Incremental Algorithm Driven by Error Margins , 2006, Discovery Science.

[9]  V. Kshirsagar,et al.  Face recognition using Eigenfaces , 2011, 2011 3rd International Conference on Computer Research and Development.

[10]  Debashis Kushary,et al.  Bootstrap Methods and Their Application , 2000, Technometrics.

[11]  Keinosuke Fukunaga,et al.  An Optimal Global Nearest Neighbor Metric , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Dennis McLeod,et al.  Efficient Spam Email Filtering using Adaptive Ontology , 2007, Fourth International Conference on Information Technology (ITNG'07).

[13]  S. Domínguez-Almendros,et al.  Logistic regression models. , 2011, Allergologia et immunopathologia.

[14]  Zeki Erdem,et al.  Reducing the Effect of Out-Voting Problem in Ensemble Based Incremental Support Vector Machines , 2005, ICANN.

[15]  Tshilidzi Marwala,et al.  Evolving Classifiers: Methods for Incremental Learning , 2007, ArXiv.

[16]  Amir Globerson,et al.  Metric Learning by Collapsing Classes , 2005, NIPS.

[17]  Sanjay Jain,et al.  Towards a Better Understanding of Incremental Learning , 2006, ALT.

[18]  Thorsten Joachims,et al.  Learning to classify text using support vector machines - methods, theory and algorithms , 2002, The Kluwer international series in engineering and computer science.

[19]  Lei Fan,et al.  An incremental learning algorithm for SVM based on voting principle , 2010, 2010 6th International Conference on Advanced Information Management and Service (IMS).

[20]  Gert R. G. Lanckriet,et al.  Metric Learning to Rank , 2010, ICML.

[21]  I. Tsang,et al.  Kernel relevant component analysis for distance metric learning , 2005, Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005..

[22]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[23]  Zeki Erdem,et al.  Ensemble of SVMs for Incremental Learning , 2005, Multiple Classifier Systems.

[24]  Corinna Cortes,et al.  Support-Vector Networks , 1995, Machine Learning.

[25]  Kilian Q. Weinberger,et al.  Distance Metric Learning for Large Margin Nearest Neighbor Classification , 2005, NIPS.

[26]  de RijkeMaarten,et al.  "Learning to rank for information retrieval from user interactions" by K. Hofmann, S. Whiteson, A. Schuth, and M. de Rijke with Martin Vesely as coordinator , 2014 .

[27]  Satish S. Udpa,et al.  LEARN++: an incremental learning algorithm for multilayer perceptron networks , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[28]  Michael I. Jordan,et al.  Distance Metric Learning with Application to Clustering with Side-Information , 2002, NIPS.

[29]  Thomas Zeugmann,et al.  Incremental Learning from Positive Data , 1996, J. Comput. Syst. Sci..

[30]  Jaana Kekäläinen,et al.  Cumulated gain-based evaluation of IR techniques , 2002, TOIS.

[31]  Tie-Yan Liu,et al.  Learning to rank for information retrieval , 2009, SIGIR.

[32]  Steffen Lange,et al.  On the Strength of Incremental Learning , 1999, ALT.

[33]  Ken Lang,et al.  NewsWeeder: Learning to Filter Netnews , 1995, ICML.

[34]  Stephen Tyree,et al.  Parallel boosted regression trees for web search ranking , 2011, WWW.

[35]  Vasant Honavar,et al.  Learn++: an incremental learning algorithm for supervised neural networks , 2001, IEEE Trans. Syst. Man Cybern. Part C.

[36]  Thomas G. Dietterich Overfitting and undercomputing in machine learning , 1995, CSUR.