Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
(April 3 )
(April
(April
(April
13.
5)
14.
10 )
15.
12 )
16.
(April
(April
(April
(May
3)
19 )
17.
18.
(May
8)
(May
(May
10 )
15 )
(May
1)
26 )
17 )
22 )
(May
(May
(May
24 )
(May
31 )
24 )
(April
(May
17 )
Overtting
Regularization
Validation
Support Ve
tor Ma
hines
Kernel Methods
Radial Basis Fun
tions
Three Learning Prin
iples
Epilogue
theory; mathemati
al
te
hnique; pra
ti
al
analysis;
on
eptual
29 )
Le ture 1:
AM
L
2/19
A pattern exists.
We
annot pin it down mathemati
ally.
We have data on it.
AM
L
3/19
?
e
s
i
ru
? n?
kbu
y
d
e
tio blo
m
o s a rs
s
like like prefe
s
like
C
m
To
viewer
add
ontributions
from ea
h fa
tor
predi
ted
rating
movie
ise
Cru
t?
in i
Tom
r?
uste t
kb ten
blo
on nt
ion nte
a
t edy
o
om
AM
L
4/19
viewer
movie
LEARNING
rating
bottom
AM
L
5/19
Components of learning
age
gender
annual salary
years in residen
e
years in job
urrent debt
23 years
male
$30,000
1 year
1 year
$15,000
Approve
redit?
AM
L
6/19
Components of learning
Formalization:
Input: x
Output: y
(good/bad ustomer? )
Hypothesis: g : X Y
AM
L
(histori al re ords)
(formula to be used )
7/19
TRAINING EXAMPLES
( x1 , y1 ), ... , ( xN , yN )
(historical records of credit customers)
LEARNING
ALGORITHM
A
FINAL
HYPOTHESIS
g~
~f
HYPOTHESIS SET
H
(set of candidate formulas)
AM
L
8/19
Solution
omponents
The 2 solution
omponents of the learning
problem:
Percepteron model
gH
TRAINING EXAMPLES
( x1 , y1 ), ... , ( xN , yN )
(historical records of credit customers)
LEARNING
ALGORITHM
Percepteron learning
algorithm
FINAL
HYPOTHESIS
g~
~f
HYPOTHESIS SET
H
9/19
`attributes of a ustomer'
Approve redit if
d
P
i=1
Deny redit if
d
P
i=1
h(x) = sign
d
X
i=1
AM
L
wixi
threshold
!
10/19
h(x) = sign
d
X
wi xi +
i=1
w0
h(x) = sign
d
X
wi xi
i=0
!
_
+
_
+
_
+
+
+
+
_
_
_
_
h(x) = sign(wTx)
AM
L
11/19
h(x) = sign(wTx)
y= +1
w+y x
x
y= 1
w+y x
w
x
w w + ynxn
AM
L
12/19
Iterations of PLA
One iteration of the PLA:
w w + yx
where (x, y) is a mis
lassied training point.
+
_
_
+
+
+
+
_
That's it!
AM
L
13/19
AM
L
14/19
Supervised Learning
Unsupervised Learning
Reinfor
ement Learning
AM
L
15/19
Supervised learning
Example from vending ma
hines
oin re
ognition
25
Mass
Mass
25
5
1
10
10
Size
AM
L
Size
16/19
Mass
Instead of
Unsupervised learning
(input,
orre
t output), we get (input, ? )
Size
AM
L
17/19
AM
L
18/19
A Learning puzzle
f = 1
f = +1
f =?
AM
L
19/19