Algorithms for Big Data (COMPSCI 229r), Lecture 17

Algorithms for Big Data (COMPSCI 229r), Lecture 17 his lecture explores methodologies for obtaining oblivious subspace embeddings, including net arguments, non-commutative Khintchine, the moment method, and approximate matrix multiplication. It further examines the application of these techniques to improve the efficiency of least squares regression through iterative methods like gradient descent.