Fetching the paper…
Reading the bibliography…
We consider the estimation of an i.i.d.
V. A. Marčenko and L. A. Pastur, “Distribution of eigenvalues for some sets of random matrices,”
1967
Earlier work this paper cites.
A. Dempster, N. M. Laird, and D. B. Rubin, “Maximum-likelihood from incomplete data via the EM algorithm,”
1977
Earlier work this paper cites.
S. Billings and S. Fakhouri, “Identification of systems containing linear dynamic and static nonlinear elements,”
1982
Earlier work this paper cites.
M. Fortin and R. Glowinski,
1983
Earlier work this paper cites.
I. W. Hunter and M. J. Korenberg, “The identification of nonlinear biological systems: Wiener and Hammerstein cascade models,”
1986
Earlier work this paper cites.
R. Glowinski and P. L. Tallec,
1989
Earlier work this paper cites.
D. L. Donoho and I. M. Johnstone, “Minimax risk over
1994
Earlier work this paper cites.
M. Tipping, “Sparse Bayesian learning and the relevance vector machine,”
2001
Earlier work this paper cites.
T. P. Minka, “A family of algorithms for approximate Bayesian inference,” Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 2001
2001
Earlier work this paper cites.
J. Boutros and G. Caire, “Iterative multiuser joint decoding: Unified framework and asymptotic analysis,”
2002
Earlier work this paper cites.
B. He, L.-Z. Liao, D. Han, and H. Yang, “A new inexact alternating directions method for monotone variational inequalities,”
2002
Earlier work this paper cites.
T. Tanaka, “A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors,”
2002
Earlier work this paper cites.
M. West, “Bayesian factor regressionm models in the “large
2003
Earlier work this paper cites.
D. Wipf and B. Rao, “Sparse Bayesian learning for basis selection,”
2004
Earlier work this paper cites.
T. Tanaka and M. Okada, “Approximate belief propagation, density evolution, and neurodynamics for CDMA multiuser detection,”
2005
Earlier work this paper cites.
D. Guo and S. Verdú, “Randomly spread CDMA: Asymptotics via statistical physics,”
2005
Cited alongside, same era.
O. Schwartz, J. W. Pillow, N. C. Rust, and E. P. Simoncelli, “Spike-triggered neural characterization,”
2006
Cited alongside, same era.
D. Guo and C.-C. Wang, “Asymptotic mean-square optimality of belief propagation for sparse linear systems,” in
2006
Cited alongside, same era.
E. J. Candès and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?”
2006
Cited alongside, same era.
——, “Random sparse linear systems observed via arbitrary channels: A decoupling principle,” in
2007
Cited alongside, same era.
S. Ji, Y. Xue, and L. Carin, “Bayesian compressive sensing,”
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,”
2011
Later among the works it cites.
——, “Generalized approximate message passing for estimation with random linear mixing,” in
2011
Later among the works it cites.
J. P. Vila and P. Schniter, “Expectation-maximization Bernoulli-Gaussian approximate message passing,” in
2011
Later among the works it cites.
2011
Later among the works it cites.
2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
M. Seeger, “Bayesian inference and optimal design for the sparse linear model,”
2008
Cited alongside, same era.
V. Cevher, “Learning with compressible priors,” in
2009
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,”
2009
Cited alongside, same era.
S. J. Wright, R. D. Nowak, and M. Figueiredo, “Sparse reconstruction by separable approximation,”
2009
Cited alongside, same era.
——, “Message passing algorithms for compressed sensing I: motivation and construction,” in
2010
Cited alongside, same era.
——, “Message passing algorithms for compressed sensing II: analysis and validation,” in
2010
Cited alongside, same era.
Later among the works it cites.
G. Caire, S. Shamai, A. Tulino, and S. Verdú, “Support recovery in compressed sensing: Information-theoretic bounds,” in
2011
Later among the works it cites.
D. Donoho, I. Johnstone, A. Maleki, and A. Montanari, “Compressed sensing over
2011
Later among the works it cites.
A. K. Fletcher, S. Rangan, L. Varshney, and A. Bhargava, “Neural reconstruction with approximate message passing (NeuRAMP),” in
2011
Later among the works it cites.
A. Montanari, “Graphical model concepts in compressed sensing,” in
2012
Closest in time.
——, “Expectation-maximization Gaussian-mixture approximate message passing,” in
2012
Closest in time.
2012
Closest in time.
S. Rangan, A. K. Fletcher, V. K. Goyal, and P. Schniter, “Hybrid generalized approximation message passing with applications to structured sparsity,” in
2012
Closest in time.
U. S. Kamilov, S. Rangan, A. K. Fletcher, and M. Unser, “Approximate message passing with consistent parameter estimation and applications to sparse learning,” in
2012
Closest in time.
S. Rangan, A. Fletcher, and V. K. Goyal, “Asymptotic analysis of MAP estimation via the replica method and applications to compressed sensing,”
2012
Closest in time.
S. Rangan and A. K. Fletcher, “Iterative estimation of constrained rank-one matrices in noise,” in
2012
Closest in time.