Progressive Stochastic Greedy Sparse Reconstruction and Support Selection

No abstract is available for this paper.

• Publication year

  2019

• Venue

  arXiv: Discrete Mathematics

• Publication date

  2019-07-22

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Accelerated orthogonal least-squares for large-scale sparse reconstruction

  2018cited by this paper
• Scalable Greedy Feature Selection via Weak Submodularity

  2017cited by this paper
• Restricted Strong Convexity Implies Weak Submodularity

  2016cited by this paper
• Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit

  2015cited by this paper
• Recovery of Sparse Signals Using Multiple Orthogonal Least Squares

  2014cited by this paper
• Compressed Sensing

  2014cited by this paper
• Lazier Than Lazy Greedy

  2014cited by this paper
• Greedy column subset selection for large-scale data sets

  2013cited by this paper
• A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit

  2012cited by this paper
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit

  2012cited by this paper
• Joint K-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares

  2011cited by this paper
• Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection

  2011cited by this paper
• Optimal column-based low-rank matrix reconstruction

  2011cited by this paper
• Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise

  2011cited by this paper
• Near Optimal Column-Based Matrix Reconstruction

  2011cited by this paper
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP

  2010cited by this paper
• On the Role of Sparse and Redundant Representations in Image Processing

  2010cited by this paper
• On the Consistency of Feature Selection using Greedy Least Squares Regression

  2009cited by this paper
• Sparse subspace clustering

  2009cited by this paper
• Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property

  2009cited by this paper
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

  2008cited by this paper
• Column subset selection, matrix factorization, and eigenvalue optimization

  2008cited by this paper
• Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity

  2008cited by this paper
• Decoding by linear programming

  2005cited by this paper
• Greed is good: algorithmic results for sparse approximation

  2004cited by this paper
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

  2004cited by this paper
• From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose

  2001cited by this paper
• Chapter 8 - Local Operator Theory, Random Matrices and Banach Spaces

  2001cited by this paper
• Regression Shrinkage and Selection via the Lasso

  1996cited by this paper
• Sparse Approximate Solutions to Linear Systems

  1995cited by this paper
• Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition

  1993cited by this paper
• Orthogonal least squares methods and their application to non-linear system identification

  1989cited by this paper
• An analysis of approximations for maximizing submodular set functions—I

  1978cited by this paper
• Presented by?????

  year unknowncited by this paper

• On the Performance-Complexity Tradeoff in Stochastic Greedy Weak Submodular Optimization

  2021cites this paper