This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Next revision Both sides next revision | ||
assignments:assignment4 [2016/09/30 11:26] asa [Submission] |
assignments:assignment4 [2016/10/03 10:00] asa [Part 2: leave-one-out error for linearly separable data] |
||
---|---|---|---|
Line 17: | Line 17: | ||
* Consider the following statement: The set of all key support vectors is unique. Prove this, or show a counter-example. | * Consider the following statement: The set of all key support vectors is unique. Prove this, or show a counter-example. | ||
- | * Using the definition of key support vectors prove a tighter bound on the leave-one-out cross validation error: | + | * In class we argued that the fraction of examples that are support vectors provide a bound on the leave-one-out error. Using the definition of key support vectors prove a tighter bound on the leave-one-out cross validation error can be obtained: |
$$ | $$ | ||
E_{cv} \leq \frac{\textrm{number of key support vectors}}{N}, | E_{cv} \leq \frac{\textrm{number of key support vectors}}{N}, |