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.
Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation
Overview
Syllabus
Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Learning-Based Low-Rank Approximations - IPAM at UCLA
-
Non-convex Matrix Sensing: Breaking the Quadratic Rank Barrier in Sample Complexity
-
Instance Optimal Iterative Methods for Matrix Function Approximation
-
Finding Low-Rank Matrices - From Matrix Completion to Recent Trends
-
The Comedy Club of High-Performance Computing: Low-Rank Matrix Approximation Takes the Stage
