Pages that link to "Item:Q2189396"

The following pages link to Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396):

Displaying 37 items.

• Estimation from nonlinear observations via convex programming with application to bilinear regression (Q2002578) (← links)
• Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
• Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data (Q2054540) (← links)
• Non-convex exact community recovery in stochastic block model (Q2089764) (← links)
• Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
• Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods (Q2155796) (← links)
• Matrix completion with nonconvex regularization: spectral operators and scalable algorithms (Q2195855) (← links)
• Entrywise eigenvector analysis of random matrices with low expected rank (Q2196228) (← links)
• Smoothed amplitude flow-based phase retrieval algorithm (Q2230851) (← links)
• Normal approximation and confidence region of singular subspaces (Q2233555) (← links)
• Spectral method and regularized MLE are both optimal for top-\(K\) ranking (Q2313284) (← links)
• Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval (Q2425162) (← links)
• Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices (Q2656603) (← links)
• Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements (Q2662546) (← links)
• Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements (Q2693686) (← links)
• Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation (Q3296183) (← links)
• (Q4998964) (← links)
• Approximate message passing with spectral initialization for generalized linear models* (Q5055411) (← links)
• Nonconvex Low-Rank Tensor Completion from Noisy Data (Q5080674) (← links)
• Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method (Q5081100) (← links)
• GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery (Q5089733) (← links)
• (Q5091116) (← links)
• First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
• An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations (Q5131960) (← links)
• Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization (Q5131966) (← links)
• Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent (Q5143310) (← links)
• (Q5149225) (← links)
• (Q5159422) (← links)
• The numerics of phase retrieval (Q5887821) (← links)
• Lower bounds for non-convex stochastic optimization (Q6038643) (← links)
• Byzantine-robust distributed sparse learning for \(M\)-estimation (Q6053803) (← links)
• Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method (Q6172167) (← links)
• Inference for low-rank completion without sample splitting with application to treatment effect estimation (Q6199626) (← links)
• Inference for heteroskedastic PCA with missing data (Q6550970) (← links)
• Low-rank matrix recovery under heavy-tailed errors (Q6565325) (← links)
• A diffusion process perspective on posterior contraction rates for parameters (Q6583523) (← links)
• Truncated amplitude flow with coded diffraction patterns (Q6659671) (← links)