Pages that link to "Item:Q2425162"

The following pages link to Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval (Q2425162):

Displaying 42 items.

• On global convergence of gradient descent algorithms for generalized phase retrieval problem (Q1675386) (← links)
• Homomorphic sensing of subspace arrangements (Q1979937) (← links)
• Scalable incremental nonconvex optimization approach for phase retrieval (Q2023709) (← links)
• A selective overview of deep learning (Q2038303) (← links)
• Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data (Q2054540) (← 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)
• Randomly initialized EM algorithm for two-component Gaussian mixture achieves near optimality in \(O(\sqrt{n})\) iterations (Q2113265) (← links)
• Solving phase retrieval with random initial guess is nearly as good as by spectral initialization (Q2118400) (← links)
• Role of sparsity and structure in the optimization landscape of non-convex matrix sensing (Q2133410) (← links)
• Tensor factorization recommender systems with dependency (Q2137793) (← links)
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
• Complex phase retrieval from subgaussian measurements (Q2226993) (← links)
• Spectral method and regularized MLE are both optimal for top-\(K\) ranking (Q2313284) (← links)
• The local convexity of solving systems of quadratic equations (Q2410810) (← links)
• Sparse signal recovery from phaseless measurements via hard thresholding pursuit (Q2667051) (← links)
• Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation (Q3296183) (← links)
• Solving Systems of Quadratic Equations Via Exponential-Type Gradient Descent Algorithm (Q3385678) (← links)
• Consensus-based optimization on hypersurfaces: Well-posedness and mean-field limit (Q3388781) (← links)
• (Q4999045) (← links)
• Revisiting Landscape Analysis in Deep Neural Networks: Eliminating Decreasing Paths to Infinity (Q5051381) (← links)
• (Q5053253) (← links)
• Nonconvex Low-Rank Tensor Completion from Noisy Data (Q5080674) (← links)
• Anisotropic Diffusion in Consensus-Based Optimization on the Sphere (Q5097020) (← links)
• Convolutional Phase Retrieval via Gradient Descent (Q5123818) (← 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)
• (Q5159418) (← links)
• Phase retrieval via randomized Kaczmarz: theoretical guarantees (Q5242865) (← links)
• On the Convergence of Mirror Descent beyond Stochastic Convex Programming (Q5853716) (← links)
• The Global Landscape of Phase Retrieval II: Perturbed Amplitude Models (Q5865904) (← links)
• The Global Landscape of Phase Retrieval II: Quotient Intensity Models (Q5865908) (← links)
• Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization (Q5868947) (← links)
• Multicategory Angle-Based Learning for Estimating Optimal Dynamic Treatment Regimes With Censored Data (Q5881147) (← links)
• The numerics of phase retrieval (Q5887821) (← links)
• Sharp global convergence guarantees for iterative nonconvex optimization with random data (Q6046308) (← links)
• Fast gradient method for low-rank matrix estimation (Q6111368) (← links)
• Nearly optimal bounds for the global geometric landscape of phase retrieval (Q6162747) (← links)
• Provable Phase Retrieval with Mirror Descent (Q6168333) (← links)
• Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method (Q6172167) (← links)
• Inference for heteroskedastic PCA with missing data (Q6550970) (← links)
• A new complexity metric for nonconvex rank-one generalized matrix completion (Q6608034) (← links)