The following pages link to (Q5159422):
Displaying 11 items.
- GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery (Q5089733) (← links)
- Fast gradient method for low-rank matrix estimation (Q6111368) (← links)
- A block-randomized stochastic method with importance sampling for CP tensor decomposition (Q6126539) (← links)
- Provable sample-efficient sparse phase retrieval initialized by truncated power method (Q6162742) (← links)
- Low-rank matrix recovery under heavy-tailed errors (Q6565325) (← links)
- Stochastic variance reduced gradient for affine rank minimization problem (Q6587638) (← links)
- A customized inertial proximal alternating minimization for SVD-free robust principal component analysis (Q6606306) (← links)
- A new complexity metric for nonconvex rank-one generalized matrix completion (Q6608034) (← links)
- The Hadamard decomposition problem (Q6609102) (← links)
- A preconditioned Riemannian gradient descent algorithm for low-rank matrix recovery (Q6641764) (← links)
- SketchySGD: reliable stochastic optimization via randomized curvature estimates (Q6664471) (← links)
