Matrix recipes for hard thresholding methods
From MaRDI portal
Abstract: In this paper, we present and analyze a new set of low-rank recovery algorithms for linear inverse problems within the class of hard thresholding methods. We provide strategies on how to set up these algorithms via basic ingredients for different configurations to achieve complexity vs. accuracy tradeoffs. Moreover, we study acceleration schemes via memory-based techniques and randomized, -approximate matrix projections to decrease the computational costs in the recovery process. For most of the configurations, we present theoretical analysis that guarantees convergence under mild problem conditions. Simulation results demonstrate notable performance improvements as compared to state-of-the-art algorithms both in terms of reconstruction accuracy and computational complexity.
Recommendations
- Iterative hard thresholding for low-rank recovery from rank-one projections
- A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery
- A Singular Value Thresholding Algorithm for Matrix Completion
- Proximal iteratively reweighted algorithm for low-rank matrix recovery
- Normalized iterative hard thresholding for matrix completion
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Clustering large graphs via the singular value decomposition
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing and best \(k\)-term approximation
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Exact matrix completion via convex optimization
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Greed is Good: Algorithmic Results for Sparse Approximation
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Hard thresholding pursuit: an algorithm for compressive sensing
- Interior-point method for nuclear norm approximation with application to system identification
- Introductory lectures on convex optimization. A basic course.
- Iterative hard thresholding for compressed sensing
- Learning non-parametric basis independent models from point queries via low-rank methods
- Matrix Completion From a Few Entries
- Matrix approximation and projective clustering via volume sampling
- Matrix recipes for hard thresholding methods
- Noiselets
- Normalized iterative hard thresholding for matrix completion
- Parallel stochastic gradient algorithms for large-scale matrix completion
- Robust principal component analysis?
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Sparse Approximate Solutions to Linear Systems
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
Cited in
(38)- Guarantees of Riemannian optimization for low rank matrix completion
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Structured random measurements in signal processing
- scientific article; zbMATH DE number 7415093 (Why is no real title available?)
- A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization
- Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm
- Guarantees of Riemannian optimization for low rank matrix recovery
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion
- The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
- Matrix pseudoinverse hard thresholding pursuit and sparse recovery problem
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- Fast gradient method for low-rank matrix estimation
- Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
- Minimum n-rank approximation via iterative hard thresholding
- Greedy-like algorithms for the cosparse analysis model
- Matrix completion via minimizing an approximate rank
- GNMR: a provable one-line algorithm for low rank matrix recovery
- Structured sparsity: discrete and convex approaches
- GPU accelerated greedy algorithms for compressed sensing
- Harmonic mean iteratively reweighted least squares for low-rank matrix recovery
- Low rank matrix recovery with adversarial sparse noise
- Homotopy method for matrix rank minimization based on the matrix hard thresholding method
- Low rank matrix completion by alternating steepest descent methods
- Matrix rigidity and the ill-posedness of robust PCA and matrix completion
- A preconditioned Riemannian gradient descent algorithm for low-rank matrix recovery
- Low rank matrix recovery from rank one measurements
- A new method based on the manifold-alternative approximating for low-rank matrix completion
- Iterative hard thresholding for low-rank recovery from rank-one projections
- Matrix recipes for hard thresholding methods
- Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion
- Compressed sensing of low-rank plus sparse matrices
- Dynamic thresholding algorithm with memory for linear inverse problems
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Painless breakups -- efficient demixing of low rank matrices
- Low-rank tensor recovery using sequentially optimal modal projections in iterative hard thresholding (SeMPIHT)
- A simple homotopy proximal mapping algorithm for compressive sensing
This page was built for publication: Matrix recipes for hard thresholding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2251217)
