Fetching the paper…
Reading the bibliography…
Gaussian and quadratic approximations of message passing algorithms on graphs have attracted considerable recent attention due to their computational simplicity, analytic tractability, and wide applicability in optimization and statistical inference problems.
N. S. Rao, R. D. Nowak, S. J. Wright, and N. G. Kingsbury, “Convex approaches to model wavelet sparsity patterns,” in Proc. IEEE Int. Conf. Image Process. , 2011, pp. 1917–1920
1920
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.
B. J. Frey, Graphical Models for Machine Learning and Digital Communication . MIT Press, 1998
1998
Earlier work this paper cites.
A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications . New York: Springer, 1998
1998
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” in Proc. IEEE , vol. 86, 1998, pp. 2278–2324
1998
Earlier work this paper cites.
G. Caire, A. Tulino, and E. Biglieri, “Iterative multiuser joint detection and parameter estimation: a factor-graph approach,” in Proc. IEEE Inform. Theory Workshop , Cairns, Australia, Sep. 2001, pp. 36–38
2001
Earlier work this paper cites.
J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Understanding belief propagation and its generalizations,” in Exploring Artificial Intelligence in the New Millennium . San Francisco, CA: Morgan Kaufmann Publishers, 2003, pp. 239–269
2003
Earlier work this paper cites.
I. Daubechies, M. Defrise, and C. D. Mol, “An iterative thresholding algorithm for linear inverse problems with a sparsity constraint,” Commun. Pure Appl. Math. , vol. 57, no. 11, pp. 1413–1457, Nov. 2004
2004
Earlier work this paper cites.
B. Krishnapuram, L. Carin, M. Figueiredo, and A. Hartemink, “Sparse multinomial logistic regression: Fast algorithms and generalization bounds,” IEEE Trans. Pattern Anal. and Mach. Int. , vol. 27, no. 6, pp. 957–968, 2005
2005
Earlier work this paper cites.
C. M. Bishop, Pattern Recognition and Machine Learning , ser. Information Science and Statistics. New York, NY: Springer, 2006
2006
Earlier work this paper cites.
D. M. Malioutov, J. K. Johnson, and A. S. Willsky, “Walk-sums and belief propagation in Gaussian graphical models,” J. Machine Learning Res. , vol. 7, pp. 2031–2064, Oct. 2006
2006
Earlier work this paper cites.
G. Elidan, I. McGraw, and D. Koller, “Residual belief propagation: Informed scheduling for asynchronous message passing,” in Proc. Conf. on Uncertainty in AI , Boston, MA, Jul. 2006
2006
Earlier work this paper cites.
M. Yuan and Y. Lin, “Model selection and estimation in regression with grouped variables,” J. Royal Statist. Soc. , vol. 68, pp. 49–67, 2006
2006
Earlier work this paper cites.
Y. Kim, J. Kim, and Y. Kim, “Blockwise sparse regression,” Statistica Sinica , vol. 16, pp. 375–390, 2006
2006
Earlier work this paper cites.
M. Figueiredo, S. J. Wright, and R. D. Nowak, “Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems,” IEEE J. Sel. Topics Signal Process. , vol. 1, no. 4, pp. 586–597, Dec. 2007
2007
Earlier work this paper cites.
S. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinvesky, “An interior point method for large-scale ℓ 1 \ell_{1} -regularized least squares,” IEEE J. Sel. Topics Signal Process. , vol. 1, no. 4, pp. 606–617, Dec. 2007
2007
Earlier work this paper cites.
G. C. Cawley, N. L. C. Talbot, and M. Girolami, “Sparse multinomial logistic regression via Bayesian L1 regularisation,” in Proc. Neural Information Process. Syst. , 2007, pp. 209–216
2007
Earlier work this paper cites.
M. J. Wainwright and M. I. Jordan, “Graphical models, exponential families, and variational inference,” Found. Trends Mach. Learn. , vol. 1, no. 1–2, pp. 1–305, 2008
2008
Earlier work this paper cites.
L. Meier, S. van de Geer, and P. Bühlmann, “The group lasso for logistic regression,” J. Royal Statistical Society: Series B , vol. 70, no. 1, pp. 53–71, 2008
2008
Earlier work this paper cites.
D. Koller and N. Friedman, Probabilistic Graphical Models: Principles and Techniques . Cambridge, MA: MIT Press, 2009
2009
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. Nat. Acad. Sci. , vol. 106, no. 45, pp. 18 914–18 919, Nov. 2009
2009
Cited alongside, same era.
P. Zhao, G. Rocha, and B. Yu, “The composite absolute penalties family for grouped and hierarchical variable selection,” Ann. Stat. , vol. 37, no. 6, pp. 3468–3497, 2009
2009
Cited alongside, same era.
A. C. Lozano, G. Świrszcz, and N. Abe, “Group orthogonal matching pursuit for variable selection and prediction,” in Proc. Neural Information Process. Syst. , Vancouver, Canada, Dec. 2009, pp. 1150–1158
2009
Cited alongside, same era.
S. J. Wright, R. D. Nowak, and M. Figueiredo, “Sparse reconstruction by separable approximation,” IEEE Trans. Signal Process. , vol. 57, no. 7, pp. 2479–2493, Jul. 2009
2009
Cited alongside, same era.
T. J. Richardson and R. L. Urbanke, Modern Coding Theory . Cambridge, UK: Cambridge Univ. Press, 2009
——, “Bilinear generalized approximate message passing—Part II: Applications,” IEEE Trans. Signal Processing , vol. 62, no. 22, pp. 5854–5867, 2013
2013
Closest in time.
J. Ziniel and P. Schniter, “Efficient high-dimensional inference in the multiple measurement vector problem,” IEEE Trans. Signal Process. , vol. 61, no. 2, pp. 340–354, Jan. 2013
2013
Closest in time.
——, “Dynamic compressive sensing of time-varying signals via approximate message passing,” IEEE Trans. Signal Process. , vol. 61, no. 21, pp. 5270–5284, Nov. 2013
2013
Closest in time.
J. P. Vila and P. Schniter, “Expectation-maximization Gaussian-mixture approximate message passing,” IEEE Trans. Signal Processing , vol. 61, no. 19, pp. 4658–4672, 2013
2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
——, “Message passing algorithms for compressed sensing I: Motivation and construction,” in Proc. Info. Theory Workshop , Jan. 2010, pp. 1–5
2010
Cited alongside, same era.
P. Schniter, “Turbo reconstruction of structured sparse signals,” in Proc. Conf. on Inform. Sci. & Sys. , Princeton, NJ, Mar. 2010
2010
Cited alongside, same era.
V. Cevher, P. Indyk, L. Carin, and R. Baraniuk, “Sparse signal recovery and acquisition with graphical models,” IEEE Signal Process. Mag. , vol. 27, no. 6, pp. 92–103, Nov. 2010
2010
Cited alongside, same era.
J. Friedman, T. Hastie, and R. Tibshirani, “Regularization paths for generalized linear models via coordinate descent,” J. Statst. Softw. , vol. 33, no. 1, pp. 1–22, 2010
2010
Cited alongside, same era.
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
Cited alongside, same era.
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
Cited alongside, same era.
——, “A message-passing receiver for BICM-OFDM over unknown clustered-sparse channels,” IEEE J. Sel. Topics Signal Process. , vol. 5, no. 8, pp. 1462–1474, Dec. 2011
2011
Cited alongside, same era.
2013
Closest in time.
M. Nassar, P. Schniter, and B. Evans, “A factor-graph approach to joint OFDM channel estimation and decoding in impulsive noise environments,” IEEE Trans. Signal Process. , vol. 62, no. 6, pp. 1576–1589, Mar. 2014
2014
Closest in time.
A. K. Fletcher and S. Rangan, “Scalable inference for neuronal connectivity from calcium imaging,” in Proc. Neural Information Processing Systems , 2014, pp. 2843–2851
2014
Closest in time.
J. Vila, P. Schniter, and J. Meola, “Hyperspectral image unmixing via turbo bilinear approximate message passing,” IEEE Trans. Computat. Imaging , vol. 1, no. 3, pp. 143–158, 2015
2015
Closest in time.
S. Wang, Y. Li, and J. Wang, “Multiuser detection in massive spatial modulation MIMO with low-resolution ADCs,” IEEE Trans. Wireless Comm. , vol. 14, no. 4, pp. 2156–2168, 2015
2015
Closest in time.
A. K. Fletcher, J. Viventi, and S. Rangan, “Neural mass spatio-temporal modeling from high-density electrode array recordings,” in Proc. Information Theory and Applications Workshop , 2015, pp. 319–321
2015
Closest in time.
A. Manoel, F. Krzakala, E. W. Tramel, and L. Zdeborová, “Swept approximate message passing for sparse estimation,” in Proc. ICML , 2015, pp. 1123–1132
2015
Closest in time.
J. Ziniel, P. Schniter, and P. Sederberg, “Binary linear classification and feature selection via generalized approximate message passing,” IEEE Trans. Signal Process. , vol. 63, no. 8, pp. 2020–2032, 2015
2015
Closest in time.
E. M. Byrne, “Sparse multinomial logistic regression via approximate message passing,” Master’s thesis, The Ohio State University, Columbus, Ohio, July 2015
2015
Closest in time.
J. Parker and P. Schniter, “Parametric bilinear generalized approximate message passing,” IEEE J. Sel. Topics Signal Proc. , vol. 10, no. 4, pp. 1–14, 2016
2016
Closest in time.
E. W. Tramel, A. Drémeau, and F. Krzakala, “Approximated message passing with restricted Boltzmann machine priors,” J. Stat. Mech.: Thy. Exp. , vol. 2016, no. 7, p. 073401, 2016
2016
Closest in time.
S. Wang and L. Zhang, “Signal processing in massive MIMO with IQ imbalances and low-resolution ADCs,” IEEE Trans. Wireless Comm. , vol. 15, no. 12, pp. 8298–8312, 2016
2016
Closest in time.
E. M. Byrne and P. Schniter, “Sparse multinomial logistic regression via approximate message passing,” IEEE Trans. Signal Process. , vol. 64, no. 21, pp. 5485–5498, 2016
2016
Closest in time.
Z. Utkovski, O. Simeone, T. Dimitrova, and P. Popovski, “Random access in c-ran for user activity detection with limited-capacity fronthaul,” IEEE Signal Process. Lett. , vol. 24, no. 1, pp. 17–21, 2017
2017
Closest in time.