perceptron learning algo, max margin classifiers
people.eecs.berkeley.edu · 1,856 words · saved by 1 readers
N/A
Perceptron Learning; Maximum Margin Classifiers 13 3 Perceptron Learning; Maximum Margin Classifiers Perceptron Algorithm (cont’d) Recall: – linear decision fn f (x) = w · x (for simplicity, no ↵) – decision boundary {x : f (x) = 0} (a hyperplane through the origin) – sample points X1 , X2 , . . . , Xn 2 Rd ; class labels y1 , . . . , yn = ±1 – goal: find weights w such that yi Xi · w 0 X – goal, revised: find w that minimizes R(w) =…
related reading
- Support vector machine - Wikipediaen.wikipedia.org
- Perceptron - Wikipediaen.wikipedia.org
- Neural networks and deep learningneuralnetworksanddeeplearning.com
- 02.pdfpeople.eecs.berkeley.edu
- Support vector machine - Wikipediaen.wikipedia.org
- CS231n Deep Learning for Computer Visioncs231n.github.io
- Why Momentum Really Worksdistill.pub
- kernelspeople.eecs.berkeley.edu
- A Course in Machine Learningciml.info
- deeplearningbook.org/contents/ml.htmldeeplearningbook.org
- 6.036_notes.pdfphillipi.github.io
- soft margin svmspeople.eecs.berkeley.edu