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
Differential Equations Part I Basic TheoryKorea Advanced Institute of Science and Technology via Coursera Matrix Analysis with Applications
Indian Institute of Technology Roorkee via Swayam Essential Mathematics for Machine Learning
Indian Institute of Technology Roorkee via Swayam Advanced Matrix Theory and Linear Algebra for Engineers
NPTEL via YouTube Eigenvalues
YouTube