Approximate Message Passing with Consistent Parameter Estimation and Applications to Sparse Learning
Preprint
Abstract
We consider the estimation of an i.i.d. vector $\xbf \in \R^n$ from measurements $\ybf \in \R^m$ obtained by a general cascade model consisting of a known linear transform followed by a probabilistic componentwise (possibly nonlinear) measurement channel. A novel method, called adaptive generalized approximate message passing (Adaptive GAMP), that enables joint learning of the statistics of the prior and measurement channel along with estimation of the unknown vector $\xbf$ is presented. The proposed algorithm is a generalization of a recently-developed technique by Vila and Schniter that uses expectation-maximization (EM) iterations where the posteriors in the E-steps are computed via approximate message passing. The proposed methodology can be applied to a large class of learning problems including the learning of sparse priors in compressed sensing or identification of linear-nonlinear cascade models in dynamical systems and neural spiking processes. We prove that for large i.i.d. Gaussian transform matrices the asymptotic componentwise behavior of the adaptive GAMP algorithm is predicted by a simple set of scalar state evolution equations. This analysis shows that the adaptive GAMP method can yield asymptotically consistent parameter estimates, which implies that the algorithm achieves a reconstruction quality equivalent to the oracle algorithm that knows the correct parameter values. The adaptive GAMP methodology thus provides a systematic, general and computationally efficient method applicable to a large range of complex linear-nonlinear models with provable guarantees.
Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Iterative estimation of constrained rank-one matrices in noise2012
- Generalized approximate message passing for estimation with random linear mixing2011
- Estimation with random linear mixing, belief propagation and compressed sensing2010
- Message-passing algorithms for compressed sensingProceedings of the National Academy of Sciences, 2009
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?IEEE Transactions on Information Theory, 2006
- Approximate Belief Propagation, Density Evolution, and Statistical Neurodynamics for CDMA Multiuser DetectionIEEE Transactions on Information Theory, 2005
- Bayesian Factor Regression Models in the “Large p, Small n” Paradigm2003
- Iterative multiuser joint decoding: unified framework and asymptotic analysisIEEE Transactions on Information Theory, 2002
- The identification of nonlinear biological systems: Wiener and Hammerstein cascade modelsBiological Cybernetics, 1986
- Identification of systems containing linear dynamic and static nonlinear elementsAutomatica, 1982