Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation
Offered By: IEEE via YouTube
Course Description
Overview
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
Coding the Matrix: Linear Algebra through Computer Science ApplicationsBrown University via Coursera Mathematical Methods for Quantitative Finance
University of Washington via Coursera Introduction à la théorie de Galois
École normale supérieure via Coursera Linear Algebra - Foundations to Frontiers
The University of Texas at Austin via edX Massively Multivariable Open Online Calculus Course
Ohio State University via Coursera