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

YouTube

Non-convex Matrix Sensing: Breaking the Quadratic Rank Barrier in Sample Complexity

USC Probability and Statistics Seminar via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Learn about groundbreaking research in matrix reconstruction through this USC Probability and Statistics seminar talk that explores efficient methods for reconstructing low-rank matrices from limited linear measurements. Dive into the comparison between traditional convex approaches using nuclear norm minimization and computationally less expensive non-convex methods employing factorized gradient descent. Discover how the speaker improves upon existing techniques by reducing the sample complexity of non-convex matrix factorization from quadratic to linear rank-dependence when reconstructing positive semidefinite matrices from Gaussian measurements. Follow along as the presentation introduces a novel probabilistic decoupling argument demonstrating that gradient descent iterates maintain only weak dependencies on individual measurement matrix entries. The research, conducted in collaboration with Dominik Stöger from KU Eichstätt-Ingolstadt, represents a significant advancement in matrix sensing theory and computational efficiency.

Syllabus

Yizhe Zhu: Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample com... (USC)

Taught by

USC Probability and Statistics Seminar

Reviews

Start your review of Non-convex Matrix Sensing: Breaking the Quadratic Rank Barrier in Sample Complexity

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.