Cover Image

Global convergence of gradient descent for phase retrieval

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fougereux, Théodore, Josz, Cédric, Li, Xiaopeng
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning 90C26
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Global convergence of the gradient method for functions definable in o-minimal structures
by: Josz, Cédric
Published: (2023)

A theory on the absence of spurious solutions for nonconvex and nonsmooth optimization
by: Josz, Cedric, et al.
Published: (2018)

Exponential convergence rates for momentum stochastic gradient descent in the overparametrized setting
by: Gess, Benjamin, et al.
Published: (2023)

The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviations
by: Azizian, Waïss, et al.
Published: (2025)

Global Optimization of Gaussian processes
by: Schweidtmann, Artur M., et al.
Published: (2020)

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
by: Fatkhullin, Ilyas, et al.
Published: (2025)

Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets
by: Li, Mengmeng, et al.
Published: (2023)

A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties
by: Qiu, Junwen, et al.
Published: (2023)

A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization
by: Qiu, Junwen, et al.
Published: (2023)

Noisy phase retrieval from subgaussian measurements
by: Peng, Haiyang, et al.
Published: (2024)

SPAM: Stochastic Proximal Point Method with Momentum Variance Reduction for Non-convex Cross-Device Federated Learning
by: Karagulyan, Avetik, et al.
Published: (2024)

FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection
by: He, Yutong, et al.
Published: (2026)

Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates
by: Rammal, Ahmad, et al.
Published: (2023)

Revisiting Frank-Wolfe for Structured Nonconvex Optimization
by: Maskan, Hoomaan, et al.
Published: (2025)

Step-Size Stability in Stochastic Optimization: A Theoretical Perspective
by: Schaipp, Fabian, et al.
Published: (2026)

Optimization without Retraction on the Random Generalized Stiefel Manifold
by: Vary, Simon, et al.
Published: (2024)

Parameter-free accelerated gradient descent for nonconvex minimization
by: Marumo, Naoki, et al.
Published: (2022)

A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods
by: Qiu, Junwen, et al.
Published: (2024)

What is the long-run distribution of stochastic gradient descent? A large deviations analysis
by: Azizian, Waïss, et al.
Published: (2024)

Convergence of gradient descent for deep neural networks
by: Chatterjee, Sourav
Published: (2022)

Wirtinger gradient descent methods for low-dose Poisson phase retrieval
by: Diederichs, Benedikt, et al.
Published: (2024)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
by: Jin, Ruinan, et al.
Published: (2024)

Nonmonotone subgradient methods based on a local descent lemma
by: Aragón-Artacho, Francisco J., et al.
Published: (2025)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
by: Engquist, Björn, et al.
Published: (2022)

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
by: Yao, Tongliang, et al.
Published: (2024)

Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems
by: Wang, Jun-Lin, et al.
Published: (2024)

A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems
by: Wang, Junlin, et al.
Published: (2024)

Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning
by: Qiu, Junwen, et al.
Published: (2026)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
by: Prakhya, Karthik, et al.
Published: (2026)

A Generalized Version of Chung's Lemma and its Applications
by: Jiang, Li, et al.
Published: (2024)

A note on the convergence of deterministic gradient sampling in nonsmooth optimization
by: Gebken, Bennet
Published: (2023)

Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats
by: K, Mishal Assif P, et al.
Published: (2019)

Implicit regularization of normalized gradient descent
by: Josz, Cédric
Published: (2026)

High Probability Guarantees for Random Reshuffling
by: Yu, Hengxu, et al.
Published: (2023)

Alternating minimization for square root principal component pursuit
by: Deng, Shengxiang, et al.
Published: (2024)

Stochastic Gradient Descent Revisited
by: Louzi, Azar
Published: (2024)

NS-RGS: Newton-Schulz based Riemannian gradient method for orthogonal group synchronization
by: Peng, Haiyang, et al.
Published: (2026)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
by: Ghaffari-Hadigheh, Alireza, et al.
Published: (2022)

Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees
by: Lu, Zhaosong, et al.
Published: (2024)

Projected gradient descent accumulates at Bouligand stationary points
by: Olikier, Guillaume, et al.
Published: (2024)