Pages that link to "Item:Q5224010"

The following pages link to Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization (Q5224010):

Displaying 14 items.

• The global optimization geometry of shallow linear neural networks (Q1988338) (← links)
• Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization (Q2052408) (← links)
• Role of sparsity and structure in the optimization landscape of non-convex matrix sensing (Q2133410) (← links)
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
• Provable accelerated gradient method for nonconvex low rank optimization (Q2303662) (← links)
• Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation (Q3296183) (← links)
• Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation (Q5081098) (← links)
• GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery (Q5089733) (← links)
• (Q5149233) (← links)
• Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA (Q5214234) (← links)
• Nonconvex Robust Low-Rank Matrix Recovery (Q5217366) (← links)
• $$L^p$$ Continuity and Microlocal Properties for Pseudodifferential Operators (Q5230197) (← links)
• Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably (Q5230407) (← links)
• Analysis of the optimization landscape of Linear Quadratic Gaussian (LQG) control (Q6052067) (← links)