Pages that link to "Item:Q5230407"
From MaRDI portal
The following pages link to Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably (Q5230407):
Displaying 15 items.
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset (Q518124) (← links)
- Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization (Q2052408) (← links)
- An optimal statistical and computational framework for generalized tensor estimation (Q2119217) (← links)
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (Q2286374) (← links)
- Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation (Q3296183) (← links)
- (Q4614128) (← links)
- (Q4969122) (← links)
- Tensor Canonical Correlation Analysis With Convergence and Statistical Guarantees (Q5066457) (← 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)
- (Q5159422) (← links)
- Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery (Q5214201) (← links)
- $$L^p$$ Continuity and Microlocal Properties for Pseudodifferential Operators (Q5230197) (← links)
- On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems (Q5853570) (← links)
- Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy (Q6038660) (← links)