Learning-Based Low-Rank Approximations - IPAM at UCLA
Institute for Pure & Applied Mathematics (IPAM) via YouTube
Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 49-minute lecture on learning-based algorithms for low-rank approximation problems presented by Piotr Indyk from the Massachusetts Institute of Technology. Delve into the recent advancements in optimizing algorithm performance using training sets of input matrices. Discover the two-step process of efficient approximate algorithms for computing low-rank approximations, involving the computation of a "sketch" and subsequent singular value decomposition. Learn how replacing random matrices with "learned" matrices significantly reduces approximation errors. Gain insights into joint work with Peter Bartlett, Yang Yuan, Ali Vakilian, Tal Wagner, and David Woodruff in this IPAM workshop on Multi-Modal Imaging with Deep Learning and Modeling.
Syllabus
Piotr Indyk - Learning-Based Low-Rank Approximations - IPAM at UCLA
Taught by
Institute for Pure & Applied Mathematics (IPAM)