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

Big Data Analytics in Healthcare
Georgia Institute of Technology via Udacity
Introduction to Recommender Systems
University of Minnesota via Coursera
Поиск структуры в данных
Moscow Institute of Physics and Technology via Coursera
Materials Data Sciences and Informatics
Georgia Institute of Technology via Coursera
Matrix Factorization and Advanced Techniques
University of Minnesota via Coursera