Smoothed Analysis of Low Rank Solutions to Semidefinite Programs via Burer Monteiro Factorization
702 views · Published 26 September 2018 · 34:47 · Indexed 21 October 2026
Channel: Simons Institute for the Theory of Computing · 2018 · Education
Praneeth Netrapalli (Microsoft Research India) https://simons.berkeley.edu/talks/smoothed-analysis-low-rank-solutions-semidefinite-programs-burer-monteiro-factorization Randomized Numerical Linear Algebra and Applications
More from this channel
-
35:16
Probabilistic Polynomials and Hamming Nearest Neighbors
-
15:16
Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
33:01
Revenue Maximization in Interdependent Value Settings
-
34:31
Algorithmic Bayesian Mechanism Design
-
37:51
On Maximizing Revenue for Multi-Item Auctions