Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval (Q2425162): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 13:34, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval	scientific article

Statements

scholarly article

0 references

Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval (English)

0 references

0 references

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

26 June 2019

0 references

full work available at URL

https://arxiv.org/abs/1803.07726

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Entrywise eigenvector analysis of random matrices with low expected rank

0 references

Saving phase: injectivity and stability for phase retrieval

0 references

Non-Convex Phase Retrieval From STFT Measurements

0 references

Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems

0 references

The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences

0 references

Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices

0 references

Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming

0 references

Phase Retrieval via Matrix Completion

0 references

Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization

0 references

Spectral method and regularized MLE are both optimal for top-\(K\) ranking

0 references

Solving quadratic equations via phaselift when there are about as many equations as unknowns

0 references

Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

0 references

Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow

0 references

Phase Retrieval via Wirtinger Flow: Theory and Algorithms

0 references

Fast rank-one alternating minimization algorithm for phase retrieval

0 references

PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming

0 references

ROP: matrix recovery via rank-one projections

0 references

Stable optimizationless recovery from phaseless linear measurements

0 references

Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval

0 references

On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators

0 references

On robust regression with high-dimensional predictors

0 references

Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold

0 references

Sparse and Low-Rank Tensor Estimation via Cubic Sketchings

0 references

Matrix Completion From a Few Entries

0 references

Low rank matrix recovery from rank one measurements

0 references

0 references

Rapid, robust, and reliable blind deconvolution via nonconvex optimization

0 references

Nonconvex Matrix Factorization From Rank-One Measurements

0 references

Fundamental limits of weak recovery with applications to phase retrieval

0 references

Revisiting Normalized Gradient Descent: Fast Evasion of Saddle Points

0 references

Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution

0 references

Optimization-Based AMP for Phase Retrieval: The Impact of Initialization and $\ell_{2}$ Regularization

0 references

Phase Retrieval Using Alternating Minimization

0 references

Cubic regularization of Newton method and its global performance

0 references

Convolutional Phase Retrieval via Gradient Descent

0 references

The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square

0 references

Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks

0 references

Guaranteed Matrix Completion via Non-Convex Factorization

0 references

Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization

0 references

Concentration and Moment Inequalities for Polynomials of Independent Random Variables

0 references

Phase retrieval via randomized Kaczmarz: theoretical guarantees

0 references

Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study

0 references

Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow

0 references

Misspecified nonconvex statistical optimization for sparse phase retrieval

0 references

Near-Optimal Bounds for Phase Synchronization

0 references

Compressive Phase Retrieval via Reweighted Amplitude Flow

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

10.1007/S10107-019-01363-6

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2425162

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2425162&oldid=39073880"