YoVDO

Learning-Based Low-Rank Approximations - IPAM at UCLA

Offered By: Institute for Pure & Applied Mathematics (IPAM) via YouTube

Tags

Singular Value Decomposition Courses Deep Learning Courses Low-Rank Approximation Courses

Course Description

Overview

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)

Related Courses

Neural Networks for Machine Learning
University of Toronto via Coursera
機器學習技法 (Machine Learning Techniques)
National Taiwan University via Coursera
Machine Learning Capstone: An Intelligent Application with Deep Learning
University of Washington via Coursera
Прикладные задачи анализа данных
Moscow Institute of Physics and Technology via Coursera
Leading Ambitious Teaching and Learning
Microsoft via edX