Login / Signup
Matching Matrix Bernstein with Little Memory: Near-Optimal Finite Sample Guarantees for Oja's Algorithm.
Prateek Jain
Chi Jin
Sham M. Kakade
Praneeth Netrapalli
Aaron Sidford
Published in:
CoRR (2016)
Keyphrases
</>
learning algorithm
optimal solution
finite sample
objective function
k means
computational complexity
np hard
probabilistic model
expectation maximization
em algorithm
theoretical analysis
active learning
special case
worst case
support vector machine svm
learning tasks
error bounds