YoVDO

Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation

Offered By: IEEE via YouTube

Tags

Linear Algebra Courses Dimensionality Reduction Courses Computational Mathematics Courses Matrix Theory Courses Low-Rank Approximation Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a comprehensive 28-minute IEEE conference talk on robust and sample optimal algorithms for positive semidefinite (PSD) low-rank approximation. Delve into cutting-edge research presented by Ainesh Bakshi from Carnegie Mellon University, Nadiia Chepurko from Massachusetts Institute of Technology, and David Woodruff from Carnegie Mellon University. Gain insights into advanced mathematical techniques and algorithmic approaches for efficiently approximating low-rank structures in positive semidefinite matrices, with a focus on robustness and sample optimality.

Syllabus

Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Quantum-Inspired Classical Linear Algebra
Simons Institute via YouTube
Sampling for Linear Algebra, Statistics, and Optimization I
Simons Institute via YouTube
Foundations of Data Science II
Simons Institute via YouTube
Near Optimal Linear Algebra in the Online and Sliding Window Models
IEEE via YouTube
Low Rank Approximation in Electron Excitation Calculations - IPAM at UCLA
Institute for Pure & Applied Mathematics (IPAM) via YouTube