Analyzing Non-Convex Optimization for Sparse Coding thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Analyzing Non-Convex Optimization for Sparse Coding

Published on Aug 20, 20152508 Views

Sparse coding is a basic task in many fields including signal processing, neuroscience and machine learning where the goal is to learn a basis that enables a sparse representation of a given set of da

Related categories

Chapter list

Analyzing Non-convex Optimization for Sparse Coding00:00
Sparse Coding (a.k.a Dictionary Learning) - 100:10
Sparse Coding (a.k.a Dictionary Learning) - 201:17
Sparse Coding (a.k.a Dictionary Learning) - 301:32
Origins of Sparse Coding01:39
Applications to Machine Learning02:30
Outline03:41
Non-convex Heuristics03:58
Minimizing Energy Function04:39
Previous Works05:31
Model Assumptions07:33
Our Results - 108:54
Our Results - 210:08
Outline11:03
Alternating Updates →Updates on A11:10
Proof Famework11:45
Analysis of Sparse Coding - 113:22
Analysis of Sparse Coding - 214:12
Why should we expect that ...14:12
Discussion and Open Questions17:02