Generating Functional Analysis of Iterative Sparse Signal Recovery Algorithms with Divergence-Free Estimators
Approximate message passing (AMP) is an effective iterative sparse recovery algorithm for linear system models. Its performance is characterized by the state evolution (SE) which is a simple scalar recursion. However, depending on a measurement matrix ensemble, AMP may face a convergence problem. To avoid this problem, orthogonal AMP (OAMP), which uses de-correlation linear estimation and divergence-free non-linear estimation, was proposed by Ma and Ping. They also provide the SE analysis for OAMP. In their SE analysis, the following two assumptions were made: (i) The estimated vector of the de-correlation linear estimator consists of i.i.d. zero-mean Gaussian entries independent of the vector to be estimated and (ii) the estimated vector of the divergence-free non-linear estimator consists of i.i.d. entries independent of the measurement matrix and the noise vector. In this paper, we derive a simple scalar recursion to characterize iterative sparse recovery algorithms with divergence-free estimators without such assumptions of independence of messages by using the generating functional analysis (GFA), which allows us to study the dynamics by an exact way in the large system limit.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Multi-Rank Sparse and Functional PCA: Manifold Optimization and Iterative Deflation Techniques
We consider the problem of estimating multiple principal components using the recently-proposed Sparse and Functional Principal Components Analysis (SFPCA) estimator. We first propose an extension of SFPCA which estimate…
Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements -- the multivariate case
Signals and images with discontinuities appear in many problems in such diverse areas as biology, medicine, mechanics, and electrical engineering. The concrete data are often discrete, indirect and noisy measurements of …
Electrical EngineeringSparse and Functional Principal Components Analysis
Regularized variants of Principal Components Analysis, especially Sparse PCA and Functional PCA, are among the most useful tools for the analysis of complex high-dimensional data. Many examples of massive data, have both…
Dimensionality ReductionEEGElectroencephalogram (EEG)feature selectionDecoding the Encoding of Functional Brain Networks: an fMRI Classification Comparison of Non-negative Matrix Factorization (NMF), Independent Component Analysis (ICA), and Sparse Coding Algorithms
Brain networks in fMRI are typically identified using spatial independent component analysis (ICA), yet mathematical constraints such as sparse coding and positivity both provide alternate biologically-plausible framewor…
Time Series AnalysisA biconvex analysis for Lasso l1 reweighting
l1 reweighting algorithms are very popular in sparse signal recovery and compressed sensing, since in the practice they have been observed to outperform classical l1 methods. Nevertheless, the theoretical analysis of the…
compressed sensing