Dynamic Updating for L1 Minimization

Abstract

The theory of compressive sensing (CS) suggests that under certain conditions, a sparse signal can be recovered from a small number of linear incoherent measurements. An effective class of reconstruction algorithms involve solving a convex optimization program that balances the L1 norm of the solution against a data fidelity term. Tremendous progress has been made in recent years on algorithms for solving these L1 minimization programs. These algorithms, however, are for the most part static: they focus on finding the solution for a fixed set of measurements. In this paper, we will discuss "dynamic algorithms" for solving L1 minimization programs for streaming sets of measurements. We consider cases where the underlying signal changes slightly between measurements, and where new measurements of a fixed signal are sequentially added to the system. We develop algorithms to quickly update the solution of several different types of L1 optimization problems whenever these changes occur, thus avoiding having to solve a new optimization problem from scratch. Our proposed schemes are based on homotopy continuation, which breaks down the solution update in a systematic and efficient way into a small number of linear steps. Each step consists of a low-rank update and a small number of matrix-vector multiplications -- very much like recursive least squares. Our investigation also includes dynamic updating schemes for L1 decoding problems, where an arbitrary signal is to be recovered from redundant coded measurements which have been corrupted by sparse errors.

arXiv commentSome sections are re-organized

References in corpus (11)

• Least Angle Regression
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Rejoinder to "Least angle regression" by Efron et al
• Near-ideal model selection by ${\ell }_1$ minimization

Cited by in corpus (17)

• A survey of sparse representation: algorithms and applications
• Semi-Supervised Sparse Representation Based Classification for Face Recognition with Insufficient Labeled Samples
• Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks
• Robust Nonparametric Regression via Sparsity Control with Application to Load Curve Data Cleansing
• Dynamic Filtering of Time-Varying Sparse Signals via l1 Minimization
• Online Hyperparameter-Free Sparse Estimation Method
• Discrete and Continuous-time Soft-Thresholding with Dynamic Inputs
• Recursive ${\ell }_{1,\infty }$ Group lasso
• Compressive Link Acquisition in Multiuser Communications
• Exact recoverability from dense corrupted observations via $L_1$ minimization
• Prediction-Correction Splittings for Nonsmooth Time-Varying Optimization
• ProPPA: A Fast Algorithm for ${\ell }_1$ Minimization and Low-Rank Matrix Completion
• Keeping greed good: sparse regression under design uncertainty with application to biomass characterization
• Prediction-Correction for Nonsmooth Time-Varying Optimization via Forward-Backward Envelopes
• Stability of Modified-CS and LS-CS for Recursive Reconstruction of Sparse Signal Sequences
• Time Invariant Error Bounds for Modified-CS based Sparse Signal Sequence Recovery
• Analysis of Recurrent Linear Networks for Enabling Compressed Sensing of Time-Varying Signals