SLIDE 1
W Y W X W Y WX W Y WX W Y WX O O X X O O O - - PowerPoint PPT Presentation
W Y W X W Y WX W Y WX W Y WX O O X X O O O - - PowerPoint PPT Presentation
W Y W X W Y WX W Y WX W Y WX O O X X O O O X O O X O O M M O O E E E O O E O E O E E O O O E vs. E O O O O E X O E E F O O O O O O E
SLIDE 2
SLIDE 3
SLIDE 4
SLIDE 5
SLIDE 6
SLIDE 7
SLIDE 8
SLIDE 9
SLIDE 10
SLIDE 11
SLIDE 12
W
X W Y
SLIDE 13
SLIDE 14
W WX Y
SLIDE 15
W WX Y
SLIDE 16
W WX Y
SLIDE 17
O O O O O X X X O X O
↑ ↓
O
↓ ↑
O
SLIDE 18
SLIDE 19
→
SLIDE 20
SLIDE 21
M
M
SLIDE 22
SLIDE 23
O X O O O O O O O O O O O O O O O O O O OO O E E E E E E E E E E E E E E E E E E E F vs.
SLIDE 24
SLIDE 25
Computational Costs:
During Learning
1,000 2,000 3,000 4,000 5,000 6,000 7,000 Computing Time (s)
SVM Learning (W) Fastest Feedforward Learning (W) Illuminated Learning (M)
Out of Memory!
5 10 15 20 Matrix Size Million
Out of Memory!
… 120 !
SVM F
SLIDE 26
2 4 6 8 10 Computational Cost per Test (s)
Computational Costs:
During Recognition
Best Alternate AI (KNN)
Without Optimization
Illuminated AI (M) Matrix Size 50 100 Millions 20 120 Feedforward AI (W)
SVM F Out of Memory!
Even Faster with Converted Networks
SLIDE 27
SLIDE 28
SLIDE 29
– –
SLIDE 30
- 0.25 -0.2
- 0.15 -0.1
- 0.05
0.05 0.1 0.15 2 4 6 8 10 12 2 4 6 8 10 12 14
- 0.5
0.5 1 1.5 0.6
- 0.2
- 0.1
0.1 0.2 0.3 0.4 0.5 5 10 15 20 25
SLIDE 31
SLIDE 32
I1 W11 W12 * I2 + W13 * I3 + … … W11 * I1 O1 =
SLIDE 33
SLIDE 34
- 1
2 3 4 5 6 7 8 9
Ideal "Expected" Patterns
SLIDE 35
SLIDE 36
SLIDE 37
SLIDE 38
SLIDE 39