8.1 Perceptron lower bound. Let S be a labeled sample of m points in RN with xi
Question:
8.1 Perceptron lower bound. Let S be a labeled sample of m points in RN with xi = ((????1)i; : : : ; (????1)i; (????1)i+1
| {z }
i rst components
; 0; : : : ; 0) and yi = (????1)i+1: (8.30)
Show that the Perceptron algorithm makes (2N) updates before nding a separating hyperplane, regardless of the order in which it receives the points.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Foundations Of Machine Learning
ISBN: 9780262351362
2nd Edition
Authors: Mehryar Mohri, Afshin Rostamizadeh
Question Posted: