Finding Low-Rank Matrices: From Matrix Completion to Recent Trends

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=lXeEWsJ_5TQ


Duration: 53:56
7,334 views
115

Maryam Fazel (University of Washington)
Simons Institute Open Lecture Series, Fall 2017
https://simons.berkeley.edu/events/openlectures2017-fall-3



Other Videos By Simons Institute for the Theory of Computing


2017-11-28Algorithmic Stability for Interactive Data Analysis
2017-11-28Learning One-hidden-layer Neural Networks with Landscape Design
2017-11-28Regularized Nonlinear Acceleration
2017-11-28Data Driven Optimization Models and Algorithms
2017-11-28Michael Cohen and Directed Laplacians
2017-11-27Preconditioning in Expectation
2017-11-27Michael Cohen and Oblivious Routing
2017-11-27Michael Cohen and Self-concordant Barriers over L_p Balls
2017-11-27Michael Cohen and High-dimensional Probability
2017-11-27Welcome and Bird's Eye View of Michael's Work/Uniform Sampling and Inverse Maintenance
2017-11-22Finding Low-Rank Matrices: From Matrix Completion to Recent Trends
2017-11-17Algorithmic Decision Making and the Cost of Fairness
2017-11-17Biases Beyond Observation: Discovering Discrimination in Supervised Learning
2017-11-17Is Bias a Social or a Mathematical Concept?
2017-11-09Quantum Entanglement, Sum of Squares, and the Log Rank Conjecture
2017-11-09Computing the Independence Polynomial in Shearer's Region for the LLL
2017-11-09Fast Spectral Algorithms from Sum-of-Squares Analyses
2017-11-09Nonnegative Polynomials, Nonconvex Polynomial Optimization, and Applications to Learning
2017-11-09From Proofs to Algorithms for Machine Learning Problems
2017-11-08Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs
2017-11-08Independent Set Polytopes: Query vs. Communication Perspective


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Open Lecture
Maryam Fazel
Optimization