Recovery Guarantee of Non-Negative Matrix Factorization via Alternating Updates

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


Duration: 43:00
497 views
2

Yingyu Liang, Princeton University
https://simons.berkeley.edu/talks/yingyu-liang-2016-11-17
Learning, Algorithm Design and Beyond Worst-Case Analysis



Other Videos By Simons Institute for the Theory of Computing


2016-11-18Above Average-Case Analysis?
2016-11-18When Existing Techniques in Linear Regression Preserve Differential Privacy
2016-11-18Monotone Estimation Framework and its Applications for Scalable Analytics of Large Data Sets
2016-11-18How Hard Is Inference for Structured Prediction?
2016-11-18Automated Scientific Discovery Using Insights from Problem Structure
2016-11-17Sketching and Randomization for Distributed Submodular and Coverage Optimization
2016-11-17When Does Clustering Become Easy, and Should We Care About Other Cases?
2016-11-17Follow the Leader with Dropout Perturbations
2016-11-17Beyond Worst Case: When Complex Feedback Can Improve the Label Complexity of Active Learning
2016-11-17Characterizing the Typical Case Complexity of Formal Verification and Synthesis
2016-11-17Recovery Guarantee of Non-Negative Matrix Factorization via Alternating Updates
2016-11-17The Logic of Counting Query Answers
2016-11-16The Computational Benefit of Correlated Instances
2016-11-16Learning as a Tool for Algorithm Design and Beyond-Worst-Case Analysis
2016-11-16Learning the Best Agorithm for Max-Cut, Clustering, and Other​ ​Partitioning Problems
2016-11-16Beyond Big-O: Statistical Analysis of Performance Scaling
2016-11-16Self-Improving Algorithms for Sorting and Geometric Problems
2016-11-16A PAC Approach to Application-Specific Algorithm Selection
2016-11-15Automatic Resource Bound Analysis and Linear Optimization
2016-11-15A Theoretical Approach to Semantic Coding and Hashing
2016-11-15Timing Matters: Online Dynamics in Broadcast Games


Tags:
Yingyu Liang
Learning Algorithm Design and Beyond Worst-Case Analysis
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley