lecture11 notes

These examples are labeled according to some unknown

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Optimistic VC inequality, which will improve on � this rate when P (C ) is small. As before, we have pairs (Xi , Yi ), Yi = ±1. These examples are labeled according to some unknown C0 such that Y = 1 if X = C0 and Y = 0 if X ∈ C0 . / Let C = {C : C ⊆ X }, a set of classifiers. C makes a mistake if X ∈ C \ C0 ∪ C0 \ C = C �C0 . Similarly to last lecture, we can derive bounds on � � n �1 � � � � sup � I (Xi ∈ C �C0 ) − P (C �C0 )� , �n � C i=1 where P (C �C0 ) is the generalization error. Let C � = {C �C0 :...
View Full Document

This note was uploaded on 01/23/2014 for the course MATH 18.465 taught by Professor Panchenko during the Spring '07 term at MIT.

Ask a homework question - tutors are online