External Resources
Articles:

The top 10 algorithms
 A quick overview of some of the most important algorithms out there
 Fast Randomized SVD
Papers:
 The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted LowRank Matrices
 Robust Principal Component Analysis?
Courses:
Internal Resources
 Miscellaneous
 Calculus
 Linear Algebra
 Computational Linear Algebra
 Introduction of the course; presentation of the problems we are trying to solve  Course 1: Why are we here?
 The problem of trying to assign a topic to a post; different approaches; how to speed them up  Course 2: Topic modelling with SVD and NMF
 SVD and NMF in depth; calculating smaller SVD (maintains high accuracy while speeding up compute significantly  Course 3: Topic modelling with SVD and NMF
 PCA, decomposing matrices into sparse matrices and low rank matrices to help with tasks such as background removal  Course 4: Background Removal with Robust PCA
Minimizing a function multiplied by a constant
Let’s say we have an optimization problem.
$\underset{u}{min}(u5)^2+1 => u=5$
If we multiply it all by some constant, the result does not change.
$\underset{u}{min} 10*((u5)^2+1) => \underset{u}{min} 10(u5)^2+10 => u=5$
EWMA
Exponentially weighted moving average
S**t = Y1 for t = 1St* = *α* * *Yt + (1 − α)*S**t − 1 for t > 1