arrow
Return

A simple homotopy proximal mapping algorithm for compressive sensing

delete2018-11-16
delete4
delete
OA
AI
T
Tianbao Yang *
L
Lijun Zhang
靳
靳榕 (Rong Jin)
S
Shenghuo Zhu
Zhi-Hua Zhou cover
Zhi-Hua Zhou (Zhi‐Hua Zhou)
DOI:10.1007/s10994-018-5772-7delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In this paper, we present novel yet simple homotopy proximal mapping algorithms for reconstructing a sparse signal from (noisy) linear measurements of the signal or for learning a sparse linear model from observed data, where the former task is well-known in the field of compressive sensing and the latter task is known as model selection in statistics and machine learning. The algorithms adopt a simple proximal mapping of the 1 norm at each iteration and gradually reduces the regularization parameter for the 1 norm. We prove a global linear convergence of the proposed homotopy proximal mapping (HPM) algorithms for recovering the sparse signal under three different settings (i) sparse signal recovery under noiseless measurements, (ii) sparse signal recovery under noisy measurements, and (iii) nearly-sparse signal recovery under sub-Gaussian noisy measurements. In particular, we show that when the measurement matrix satisfies restricted isometric properties (RIP), one of the proposed algorithms with an appropriate setting of a parameter based on the RIP constants converges linearly to the optimal solution up to the noise level. In addition, in setting (iii), a practical variant of the proposed algorithms does not rely on the RIP constants and our results for sparse signal recovery are better than the previous results in the sense that our recovery error bound is smaller. Furthermore, our analysis explicitly exhibits that more observations lead to not only more accurate recovery but also faster convergence. Finally our empirical studies provide further support for the proposed homotopy proximal mapping algorithm and verify the theoretical results.
Keywords:
Compressive sensing
Sparse signal recovery
Proximal mapping
Linear convergence
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Machine Learning cover
Machine Learning
IF:
2.9
Papers:
2.7K
Citations:
3.4W

Organization

A
alibaba group
Scholars:
1.1K
Papers: 789
Citations: 0
U
University of Iowa
Scholars:
2.8W
Papers: 2.3W
Citations: 600
N
nanjing university
Scholars:
7.8W
Papers: 5.6W
Citations: 87
researcher View more organizations
Cited Papers

Cited Papers

Preparation of PP-g-(AA-MAH) Fibers Using Suspension Grafting and Melt-Blown Spinning and its Adsorption for Aniline
err2020-09-22
err0
errOAAI
errZhouyang Lian; Yiyang Xu; Jie Zuo; Hui Qian; Zhengwei Luo; Wuji Wei
errShare
errSave
SIMULTANEOUS ANALYSIS OF LASSO AND DANTZIG SELECTOR
err2009-08-01
err1.7K
errOAAI
errBickel, Peter J.; Ritov, Ya'acov; Tsybakov, Alexandre B.
errShare
errSave
High-dimensional graphs and variable selection with the Lasso
err2006-06-01
err2.9K
errOAAI
errMeinshausen, Nicolai; Buehlmann, Peter
errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave
errShare
errSave
errShare
errSave
researcher View more