No article text was recorded for this version.
sparse recovery scalability
Version 1 of 1129 papers152 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
- Blog: High-dimensional analysis of semidefinite relaxations for sparse principal components
- Blog: Information-theoretic limits on sparse signal recovery: dense versus sparse measurement matrices
- Blog: Optimization for Compressed Sensing: the Simplex Method and Kronecker Sparsification
- Blog: Phase retrieval from very few measurements
- Blog: Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
- Blog: Two-Part Reconstruction in Compressed Sensing
- Blog: L2/L2-foreach sparse recovery with low risk
- Blog: Accelerated Sparse Subspace Clustering
- Blog: Approximate Sparse Recovery: Optimizing Time and Measurements
- Blog: Adaptive support-driven Bayesian reweighted algorithm for sparse signal recovery
- Blog: For-all Sparse Recovery in Near-Optimal Time
- Blog: Subexponential-Time Algorithms for Sparse PCA
- Blog: Fast and Robust Compressive Phase Retrieval with Sparse-Graph Codes
- Blog: On Low-Risk Heavy Hitters and Sparse Recovery Schemes
- Blog: An O(k log n) Time Fourier Set Query Algorithm
- Blog: Multiple Candidate Matching Pursuit
- Blog: Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average
- Blog: A Simple Homotopy Proximal Mapping for Compressive Sensing
- Blog: Jointly clustering rows and columns of binary matrices
- Blog: Cross-Scale Predictive Dictionaries
- Blog: A GAMP Based Low Complexity Sparse Bayesian Learning Algorithm
- Blog: Two-Part Reconstruction with Noisy-Sudocodes
- Blog: A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians
- Blog: Fast and RIP-Optimal Transforms
- Blog: Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem
- Blog: Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion.
- Blog: SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits
- Blog: Sharp Time-Data Tradeoffs for Linear Inverse Problems
- Blog: Non-convex approaches for low-rank tensor completion under tubal sampling
- Blog: Sparse Linear Regression via Generalized Orthogonal Least-Squares
- Blog: Sampling Requirements and Accelerated Schemes for Sparse Linear Regression with Orthogonal Least-Squares
- Blog: Approximate Sparse Recovery: Optimizing Time and Measurements
- Blog: A Unified Approach to Sparse Signal Processing
- Blog: Effcient Transition Probability Computation for Continuous-Time Branching Processes via Compressed Sensing
- Blog: How Many Iterations are Needed for the Exact Recovery of Sparse Signals using Orthogonal Matching Pursuit
- Blog: Retrieve Sparse Solution of Multiple-Measurement Vectors via Zero-point Attracting Projection
- Blog: A survey of Sparse Component Analysis for blind source separation: principles, perspectives, and new challenges
- Blog: Combining geometry and combinatorics: A unified approach to sparse signal recovery
- Blog: Analysis of Orthogonal Matching Pursuit using the Restricted Isometry Property
- Blog: Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
- Blog: Robust Estimation of Self-Exciting Generalized Linear Models With Application to Neuronal Modeling
- Blog: Subspace pursuit for compressive sensing signal reconstruction
- Blog: Shortest-support multi-spline bases for generalized sampling
- Blog: Partially Linear Estimation with Application to Image Deblurring Using Blurred/Noisy Image Pairs
- Blog: Generalized Orthogonal Matching Pursuit
- Blog: Low-Rank Toeplitz Matrix Estimation via Random Ultra-Sparse Rulers
- Blog: Blended Matching Pursuit
- Blog: Sparse Subspace Clustering by Learning Approximation ℓ0 Codes
- Blog: Near optimal compressed sensing without priors: Parametric SURE Approximate Message Passing
- Blog: Finding a sparse vector in a subspace: Linear sparsity using alternating directions
- Blog: Convex Matching Pursuit for Large-Scale Sparse Coding and Subset Selection
- Blog: A signal recovery algorithm for sparse matrix based compressed sensing
- Blog: Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
- Blog: Convex Block-sparse Linear Regression with Expanders - Provably
- Blog: Spectral tetris fusion frame constructions
- Blog: Image denoising via K-SVD with primal-dual active set algorithm
- Blog: Implicit Regularization for Optimal Sparse Recovery
- Blog: For-All Sparse Recovery in Near-Optimal Time
- Blog: Sparsity-aware sphere decoding: Algorithms and complexity analysis
Showing 60 of 129 papers.
History & citation
Current · Permanent link
- Sublinear Time Sparse Recovery with Optimal Measurements merged into this direction (89% overlap)
- Robust Greedy Pursuit for Sparse Signal Recovery merged into this direction (59% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_sparse_recovery_scalability_13a3b313,
title = {sparse recovery scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparse-recovery-scalability/rdr_13a3b313323e46b49730820c2684b519},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_sparse_recovery_scalability_13a3b313_v1,
title = {sparse recovery scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sparse-recovery-scalability/rdr_13a3b313323e46b49730820c2684b519/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}