Fetching the paper…
Reading the bibliography…
We consider the estimation of an i.i.d.\ random vector observed through a linear transform followed by a componentwise, probabilistic (possibly nonlinear) measurement channel.
R. T. Rockafellar, Convex Analysis . Princeton, NJ: Princeton Univ. Press, 1970
1970
Earlier work this paper cites.
1972
Earlier work this paper cites.
M. Fortin and R. Glowinski, Augmented Lagrangian Methods . Amsterdam: North-Holland Publishing Co., 1983, vol. 15
1983
Earlier work this paper cites.
J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference . San Mateo, CA: Morgan Kaufmann Publ., 1988
1988
Earlier work this paper cites.
R. Glowinski and P. L. Tallec, Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics , ser. SIAM Studies in Applied Mathematics. Philadelphia, PA: SIAM, 1989
1989
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” J. Royal Stat. Soc., Ser. B , vol. 58, no. 1, pp. 267–288, 1996
1996
Earlier work this paper cites.
S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” Feb. 1996
1996
Earlier work this paper cites.
D. J. C. MacKay and R. M. Neal, “Near Shannon limit performance of low density parity check codes,” Electron. Letters , vol. 33, pp. 457–458, 1997
1997
Earlier work this paper cites.
R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, “Turbo decoding as an instance of Pearl’s ‘belief propagation’ algorithm,” IEEE J. Sel. Areas Comm. , vol. 16, no. 2, pp. 140–152, Feb. 1998
1998
Earlier work this paper cites.
T. Richardson and R. Urbanke, “The capacity of low-density parity check codes under message-passing decoding,” Bell Laboratories, Lucent Technologies, Tech. Rep. BL01121710-981105-34TM, Nov. 1998
1998
Earlier work this paper cites.
D. J. C. MacKay, “Good error-correcting codes based on very sparse matrices,” IEEE Trans. Inform. Theory , vol. 45, no. 3, pp. 399–431, Mar. 1999
1999
Earlier work this paper cites.
D. Tse and S. Hanly, “Linear multiuser receivers: Effective interference, effective bandwidth and capacity,” IEEE Trans. Inform. Theory , vol. 45, no. 3, pp. 641–675, Mar. 1999
1999
Earlier work this paper cites.
S. Verdú and S. Shamai, “Spectral efficiency of CDMA with random spreading,” IEEE Trans. Inform. Theory , vol. 45, no. 3, pp. 622–640, Mar. 1999
1999
Earlier work this paper cites.
S. ten Brink, “Convergence behavior of iteratively decoded parallel concatenated codes,” IEEE Trans. Commun. , vol. 49, no. 10, pp. 1727–1737, Oct. 2001
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.
S.-Y. Chung, T. J. Richardson, and R. L. Urbanke, “Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 657–670, Feb. 2001
2001
Earlier work this paper cites.
H. El Gamal and R. Hammons, “Analyzing the turbo decoder using the Gaussian approximation,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 671–686, Feb. 2001
2001
Earlier work this paper cites.
J. Boutros and G. Caire, “Iterative multiuser joint decoding: Unified framework and asymptotic analysis,” IEEE Trans. Inform. Theory , vol. 48, no. 7, pp. 1772–1793, Jul. 2002
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,” Math. Program. , vol. 92, no. 1, Ser A, pp. 103–108, 2002
2002
Earlier work this paper cites.
T. Tanaka, “A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors,” IEEE Trans. Inform. Theory , vol. 48, no. 11, pp. 2888–2910, Nov. 2002
2002
Earlier work this paper cites.
A. Ashikhmin, G. Kramer, and S. ten Brink, “Extrinsic information transfer functions: Model and erasure channel properties,” IEEE Trans. Inform. Theory , vol. 50, no. 11, pp. 2657–2673, Nov. 2004
2004
Earlier work this paper cites.
J. P. Neirotti and D. Saad, “Improved message passing for inference in densely connected systems,” Europhys. Lett. , vol. 71, no. 5, pp. 866–872, Sep. 2005
2005
Earlier work this paper cites.
T. Tanaka and M. Okada, “Approximate belief propagation, density evolution, and neurodynamics for CDMA multiuser detection,” IEEE Trans. Inform. Theory , vol. 51, no. 2, pp. 700–706, Feb. 2005
2005
Earlier work this paper cites.
D. Guo and S. Verdú, “Randomly spread CDMA: Asymptotics via statistical physics,” IEEE Trans. Inform. Theory , vol. 51, no. 6, pp. 1983–2010, Jun. 2005
2005
Earlier work this paper cites.
D. Guo and C.-C. Wang, “Asymptotic mean-square optimality of belief propagation for sparse linear systems,” in Proc. IEEE Inform. Theory Workshop , Chengdu, China, Oct. 2006, pp. 194–198
2006
Cited alongside, same era.
M. Yoshida and T. Tanaka, “Analysis of sparsely-spread CDMA via statistical mechanics,” in Proc. IEEE Int. Symp. Inform. Theory , Seattle, WA, Jun. 2006, pp. 2378–2382
2006
Cited alongside, same era.
C. M. Bishop, Pattern Recognition and Machine Learning , ser. Information Science and Statistics. New York, NY: Springer, 2006
2006
Cited alongside, same era.
E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inform. Theory , vol. 52, no. 2, pp. 489–509, Feb. 2006
2006
Cited alongside, same era.
D. L. Donoho, “Compressed sensing,” IEEE Trans. Inform. Theory , vol. 52, no. 4, pp. 1289–1306, Apr. 2006
——, “Message passing algorithms for compressed sensing II: analysis and validation,” in Proc. Info. Theory Workshop , Jan. 2010
2010
Closest in time.
2010
Closest in time.
P. Schniter, “Turbo reconstruction of structured sparse signals,” in Proc. Conf. on Inform. Sci. & Sys. , Princeton, NJ, Mar. 2010
2010
Closest in time.
J. Ziniel, L. C. Potter, and P. Schniter, “Tracking and smoothing of time-varying sparse signals via approximate belief propagation,” in Conf. Rec. 44th Asilomar Conf. Signals, Syst. & Comput. , Pacific Grove, CA, Nov. 2010, pp. 802–812
2010
Closest in time.
S. Som, L. C. Potter, and P. Schniter, “Compressive imaging using approximate message passing and a Markov-tree prior,” in Conf. Rec. 44th Asilomar Conf. Signals, Syst. & Comput. , Pacific Grove, CA, Nov. 2010, pp. 243–247
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
E. J. Candès and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?” IEEE Trans. Inform. Theory , vol. 52, no. 12, pp. 5406–5425, Dec. 2006
2006
Cited alongside, same era.
A. Montanari and D. Tse, “Analysis of belief propagation for non-linear problems: The example of CDMA (or: How to prove Tanaka’s formula),” arXiv:cs/0602028v1 [cs.IT]., Feb. 2006
2006
Cited alongside, same era.
——, “Random sparse linear systems observed via arbitrary channels: A decoupling principle,” in Proc. IEEE Int. Symp. Inform. Theory , Nice, France, Jun. 2007, pp. 946–950
2007
Cited alongside, same era.
L. R. Varshney, “Performance of LDPC codes under noisy message-passing decoding,” in Proc. Inform. Th. Workshop , Lake Tahoe, CA, Sep. 2007, pp. 178–183
2007
Cited alongside, same era.
M. J. Wainwright and M. I. Jordan, Graphical Models, Exponential Families, and Variational Inference , ser. Foundations and Trends in Machine Learning. Hanover, MA: NOW Publishers, 2008, vol. 1
2008
Cited alongside, same era.
G. Guo and C. C. Wang, “Multiuser detection of sparsely spread CDMA,” IEEE J. Sel. Areas Comm. , vol. 26, no. 3, pp. 421–431, Mar. 2008
2008
Cited alongside, same era.
N. Sommer, M. Feder, and O. Shalvi, “Low-density lattice codes,” IEEE Trans. Inform. Theory , vol. 54, no. 4, pp. 1561–1585, Apr. 2008
2008
Cited alongside, same era.
2010
Closest in time.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Trans. Inform. Theory , vol. 57, no. 2, pp. 764–785, Feb. 2011
2011
Closest in time.
2011
Closest in time.
2011
Closest in time.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in Proc. IEEE Int. Symp. Inform. Theory , Saint Petersburg, Russia, Jul.–Aug. 2011, pp. 2174–2178
2011
Closest in time.
S. Rangan, “Generalized approximate message passing wiki page,” http://gampmatlab.sourceforge.net/wiki/index.php, 2011
2011
Closest in time.
2011
Closest in time.
A. K. Fletcher, S. Rangan, L. Varshney, and A. Bhargava, “Neural reconstruction with approximate message passing (NeuRAMP),” in Proc. Neural Information Process. Syst. , Granada, Spain, Dec. 2011
2011
Closest in time.
G. Caire, S. Shamai, A. Tulino, and S. Verdú, “Support recovery in compressed sensing: Information-theoretic bounds,” in Proc. UCSD Workshop Inform. Theory & Its Applications , La Jolla, CA, Jan. 2011
2011
Closest in time.
D. Donoho, I. Johnstone, A. Maleki, and A. Montanari, “Compressed sensing over ℓ p \ell^{p} -balls: Minimax mean square error,” in Proc. ISIT , St. Petersburg, Russia, Jun. 2011
2011
Closest in time.
J. P. Vila and P. Schniter, “Expectation-maximization Bernoulli-Gaussian approximate message passing,” in Conf. Rec. 45th Asilomar Conf. Signals, Syst. & Comput. , Pacific Grove, CA, Nov. 2011, pp. 799–803
2011
Closest in time.
P. Schniter, “A message-passing receiver for BICM-OFDM over unknown clustered-sparse channels,” in Proc. IEEE Workshop Signal Process. Adv. Wireless Commun. , San Francisco, CA, Jun. 2011
2011
Closest in time.
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,” IEEE Trans. Inform. Theory , vol. 58, no. 3, pp. 1902–1923, Mar. 2012
2012
Closest in time.
2012
Closest in time.
S. Rangan and R. Madan, “Belief propagation methods for intercell interference coordination in femtocell networks,” IEEE J. Sel. Areas Comm. , vol. 30, no. 3, pp. 631–640, Apr. 2012
2012
Closest in time.
——, “Expectation-maximization Gaussian-mixture approximate message passing,” in Proc. Conf. on Inform. Sci. & Sys. , Princeton, NJ, Mar. 2012
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 Proc. IEEE Int. Symp. Inform. Theory , Cambridge, MA, Jul. 2012, pp. 1241–1245
2012
Closest in time.
A. Montanari, “Graphical model concepts in compressed sensing,” in Compressed Sensing: Theory and Applications , Y. C. Eldar and G. Kutyniok, Eds. Cambridge Univ. Press, Jun. 2012, pp. 394–438
2012
Closest in time.