In Learning Using Privileged Information (LUPI) paradigm, along with the standard training data in the decision space, a teacher supplies a learner with the privileged information in the correcting space. The goal of the learner is to find a classifier with a low generalization error in the decision space. We consider a new version of empirical risk minimization algorithm, called Privileged ERM, that takes into account the privileged information in order to find a good function in the decision space. We outline the conditions on the correcting space that, if satisfied, allow Privileged ERM to have much faster learning rate in the decision space than the one of the regular empirical risk minimization.
[1]
P. Massart,et al.
Risk bounds for statistical learning
,
2007,
math/0702683.
[2]
Corinna Cortes,et al.
Support-Vector Networks
,
1995,
Machine Learning.
[3]
Vladimir Vapnik,et al.
A new learning paradigm: Learning using privileged information
,
2009,
Neural Networks.
[4]
Luc Devroye,et al.
Lower bounds in pattern recognition and learning
,
1995,
Pattern Recognit..
[5]
Vladimir Vapnik,et al.
Learning using hidden information: Master-class learning
,
2007,
NATO ASI Mining Massive Data Sets for Security.