Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation

IEEE via YouTube

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

Reviews

Start your review of Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.