Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation

DOI10.1007/978-3-319-73074-5_8zbMath1450.94011OpenAlexW2966960289MaRDI QIDQ3296183

Yingbin Liang, Yuejie Chi, Yuan-Xin Li, Huishuai Zhang

Publication date: 7 July 2020

Published in: Applied and Numerical Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-73074-5_8

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations

Uses Software

• Wirtinger Flow

Cites Work

• Unnamed Item
• Estimation of (near) low-rank matrices with noise and high-dimensional scaling
• A geometric analysis of phase retrieval
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
• Rapid, robust, and reliable blind deconvolution via nonconvex optimization
• Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
• Phaselift is robust to a constant fraction of arbitrary errors
• Exact matrix completion via convex optimization
• Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
• Nonconvex Phase Synchronization
• Guaranteed Matrix Completion via Non-Convex Factorization
• Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
• Phase Retrieval via Wirtinger Flow: Theory and Algorithms
• Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
• Robust Spectral Compressed Sensing via Structured Matrix Completion
• Blind Recovery of Sparse Signals From Subsampled Convolution
• Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
• On k-Median clustering in high dimensions
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Median-Truncated Nonconvex Approach for Phase Retrieval With Outliers
• Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow
• Phase Retrieval Using Alternating Minimization
• The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences
• Low-Rank Positive Semidefinite Matrix Recovery From Corrupted Rank-One Measurements
• Compressive principal component pursuit
• Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
• Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization
• Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Matrix Completion From a Few Entries
• Low-rank matrix completion using alternating minimization

This page was built for publication: Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation