en
en-es
0.25
0.5
0.75
1.25
1.5
1.75
2
Efficient Learning of Simplices
Published on 2013-08-093286 Views
We show an efficient algorithm for the following problem: Given uniformly random points from an arbitrary n-dimensional simplex, estimate the simplex. The size of the sample and the number of arithmet
Related categories
Presentation
Efficient learning of simplices00:00
Motivation - Approach00:21
Problem00:59
Disatnce01:39
More specific motivation02:13
Independent Component Analysis (ICA)04:16
Our results05:51
Related work06:46
Algorithm to learn a simplex10:49
Understanding 3rd moment13:34
Finding vertices efficiently15:18
From learning lp ball to ICA - 118:00
From learning lp ball to ICA - 219:17
Untitled20:20