Pages that link to "Item:Q2977389"

The following pages link to Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming (Q2977389):

Displaying 28 items.

• Low rank matrix recovery from rank one measurements (Q347516) (← links)
• Subgradient methods for sharp weakly convex functions (Q1626538) (← links)
• Learning general sparse additive models from point queries in high dimensions (Q2007617) (← links)
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
• On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint (Q2089778) (← links)
• On the robustness of noise-blind low-rank recovery from rank-one measurements (Q2168911) (← links)
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
• Compressive total variation for image reconstruction and restoration (Q2194808) (← links)
• Complex phase retrieval from subgaussian measurements (Q2226993) (← links)
• Compressed covariance estimation with automated dimension learning (Q2300095) (← links)
• ROP: matrix recovery via rank-one projections (Q2338922) (← links)
• The local convexity of solving systems of quadratic equations (Q2410810) (← links)
• Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval (Q2425162) (← links)
• Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems (Q2979257) (← links)
• Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation (Q3296183) (← links)
• Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements (Q4603729) (← links)
• Stable low-rank matrix recovery via null space properties (Q4606522) (← links)
• Stochastic Model-Based Minimization of Weakly Convex Functions (Q4620418) (← links)
• Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization (Q5006447) (← links)
• ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
• Low rank matrix recovery with adversarial sparse noise* (Q5030160) (← links)
• Norm and Trace Estimation with Random Rank-one Vectors (Q5150838) (← links)
• Communication-Efficient Distributed Eigenspace Estimation (Q5162627) (← links)
• An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656) (← links)
• Nonconvex Robust Low-Rank Matrix Recovery (Q5217366) (← links)
• Covariate Information Number for Feature Screening in Ultrahigh-Dimensional Supervised Problems (Q5881153) (← links)
• Provable sample-efficient sparse phase retrieval initialized by truncated power method (Q6162742) (← links)
• Performance bounds of the intensity-based estimators for noisy phase retrieval (Q6185682) (← links)