Median-truncated gradient descent: a robust and scalable nonconvex approach for signal estimation
DOI10.1007/978-3-319-73074-5_8zbMATH Open1450.94011OpenAlexW2966960289MaRDI QIDQ3296183FDOQ3296183
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
Recommendations
- Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent
- Efficient learning with robust gradient descent
- Robust estimation via generalized quasi-gradients
- Fast, robust and non-convex subspace recovery
- A well-tempered landscape for non-convex robust subspace recovery
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26)
Cites Work
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Exact matrix completion via convex optimization
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Matrix Completion From a Few Entries
- Compressive principal component pursuit
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Low-rank matrix completion using alternating minimization
- Robust Spectral Compressed Sensing via Structured Matrix Completion
- Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
- On k-Median clustering in high dimensions
- Low-Rank Positive Semidefinite Matrix Recovery From Corrupted Rank-One Measurements
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- Guaranteed Matrix Completion via Non-Convex Factorization
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
- Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization
- Nonconvex phase synchronization
- Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow
- The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
- Guarantees of Riemannian optimization for low rank matrix recovery
- A geometric analysis of phase retrieval
- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
- Phase Retrieval Using Alternating Minimization
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
- Blind Recovery of Sparse Signals From Subsampled Convolution
- Title not available (Why is that?)
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
- Median-Truncated Nonconvex Approach for Phase Retrieval With Outliers
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Phaselift is robust to a constant fraction of arbitrary errors
Cited In (2)
Uses Software
This page was built for publication: Median-truncated gradient descent: a robust and scalable nonconvex approach for signal estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296183)
