Advanced Techniques for Low-Rank Matrix Approximation

Channel:

Subscribers:

68,700

Published on September 24, 2018 8:30:05 PM ● Video Link: https://www.youtube.com/watch?v=HCkJ13LG7o4

Duration: 32:01

1,920 views

Other Videos By Simons Institute for the Theory of Computing

2018-09-25	Applying Randomized Methods for Zonotope Enumeration and...
2018-09-25	Randomized Algorithms for Computing Full Matrix Factorizations
2018-09-25	Convergence Theory for Iterative Eigensolvers
2018-09-25	Randomized Riemannian Preconditioning for Quadratically Constrained Problems
2018-09-25	Stochastic Quasi-Gradient Methods: Variance Reduction via Jacobian Sketching
2018-09-24	Why Deep Learning Works: Implicit Self-Regularization in Deep Neural Networks
2018-09-24	How Randomized Analysis Can Help Us Do “Data Science:” Examples in Deep Learning and Graph Analysis
2018-09-24	Reconstructing Continuous Signals via Leverage Score Sampling
2018-09-24	Asympirical Analysis: Theory Informs Practice
2018-09-24	Recent Advances in Positive Semidefinite Matrix Approximation
2018-09-24	Advanced Techniques for Low-Rank Matrix Approximation
2018-09-24	Randomized Numerical Linear Algebra: Overview
2018-09-24	Randomized Least Squares Regression: Combining Model- and Algorithm-Induced Uncertainties
2018-09-14	A Short List of Equalities Has Large Sign Rank
2018-09-14	The Coin Problem and AC^0[parity]
2018-09-14	Does Looking Inside a Circuit Help?
2018-09-14	The Complexity of Distributions
2018-09-14	Distribution-Free Junta Testing
2018-09-14	The Pathset Approach to Formula Lower Bounds
2018-09-13	Boolean Matrix Multiplication Lower Bounds
2018-09-13	New Lower Bounds Through an Improved Easy Witness Lemma

Tags:

Randomized Numerical Linear Algebra and Applications

Ming Gu

Simons Institute

Theory of Computing

Theory of Computation

Theoretical Computer Science

Computer Science

UC Berkeley