Fetching the paper…
Reading the bibliography…
The estimation of a random vector with independent components passed through a linear transform followed by a componentwise (possibly nonlinear) output map arises in a range of applications.
J. A. Nelder and R. W. M. Wedderburn, “Generalized linear models,” J. Royal Stat. Soc. Series A , vol. 135, pp. 370–385, 1972
1972
Earlier work this paper cites.
P. McCullagh and J. A. Nelder, Generalized Linear Models , 2nd ed. Chapman & Hall, 1989
1989
Earlier work this paper cites.
P. Tseng, “Applications of a splitting algorithm to decomposition in convex programming and variational inequalities,” SIAM J. Control and Optimization , vol. 29, no. 1, pp. 119–138, Jan. 1991
1991
Earlier work this paper cites.
J. Eckstein and D. Bertsekas, “On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators,” Math. Program. , vol. 5, pp. 293–318, 1992
1992
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.
A. Chambolle, R. A. DeVore, N. Y. Lee, and B. J. Lucier, “Nonlinear wavelet image processing: Variational problems, compression, and noise removal through wavelet shrinkage,” IEEE Trans. Image Process. , vol. 7, no. 3, pp. 319–335, Mar. 1998
1998
Earlier work this paper cites.
I. M. Gelfand and S. V. Fomin, Calculus of Variations . Courier Corporation, 2000
2000
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.
Y. Weiss and W. T. Freeman, “On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 736–744, 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.
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.
T. Heskes, “Stable fixed points of loopy belief propagation are minima of the Bethe free energy,” in Proc. Neural Information Process. Syst. , Vancouver, Canada, Dec. 2003
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.
P. L. Combettes and V. R. Wajs, “Signal recovery by proximal forward-backward splitting,” Multiscale Model. Simul. , vol. 4, pp. 1168–1200, 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 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
Earlier work this paper cites.
Y. E. Nesterov, “Gradient methods for minimizing composite objective function,” CORE Report , 2007
2007
Earlier work this paper cites.
J. Bioucas-Dias and M. Figueiredo, “A new TwIST: Two-step iterative shrinkage/thresholding algorithms for image restoration,” IEEE Trans. Image Process. , vol. 16, no. 12, pp. 2992 – 3004, Dec. 2007
2007
Earlier work this paper cites.
W. Hachem, P. Loubaton, and J. Najim, “Deterministic equivalents for certain functionals of large random matrices,” Ann. Applied Probability , vol. 17, no. 3, pp. 875–930, Jun. 2007
2007
Earlier work this paper cites.
M. Zhu and T. Chan, “An efficient primal-dual hybrid gradient algorithm for total variation image restoration,” UCLA CAM, Tech. Rep. 08-34, 2008
2008
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, 2008
2008
Earlier work this paper cites.
M. Seeger, “Bayesian inference and optimal design for the sparse linear model,” J. Machine Learning Research , vol. 9, pp. 759–813, Sep. 2008
2008
Earlier work this paper cites.
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
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problem,” SIAM J. Imag. Sci. , vol. 2, no. 1, pp. 183––202, 2009
2009
Earlier work this paper cites.
T. Goldstein and S. Osher, “The split Bregman method for L1-regularized problems,” SIAM J. Imaging Sciences , vol. 2, no. 2, 2009
2009
Cited alongside, same era.
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.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Found. Trends Mach. Learn. , vol. 3, pp. 1–122, 2010
2010
Cited alongside, same era.
J. E. Esser, “Primal dual algorithms for convex models and applications to image restoration, registration and nonlocal inpainting,” Ph.D. dissertation, University of California, Los Angeles, 2010
2010
Cited alongside, same era.
U. S. Kamilov, S. Rangan, A. K. Fletcher, and M. Unser, “Approximate message passing with consistent parameter estimation and applications to sparse learning,” in Proc. NIPS , Lake Tahoe, NV, Dec. 2012
2012
Later among the works it cites.
S. Som and P. Schniter, “Compressive imaging using approximate message passing and a Markov-tree prior,” IEEE Trans. Signal Process. , vol. 60, no. 7, pp. 3439–3448, Jul. 2012
2012
Later among the works it cites.
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
Later among the works it cites.
S. Rangan and A. K. Fletcher, “Iterative estimation of constrained rank-one matrices in noise,” in Proc. IEEE Int. Symp. Inform. Theory , Cambridge, MA, Jul. 2012
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
——, “Message passing algorithms for compressed sensing II: analysis and validation,” in Proc. Info. Theory Workshop , Jan. 2010
2010
Cited alongside, same era.
S. Rangan, “Estimation with random linear mixing, belief propagation and compressed sensing,” in Proc. Conf. on Inform. Sci. & Sys. , Princeton, NJ, Mar. 2010, pp. 1–6
2010
Cited alongside, same era.
S. Chen, H. Tong, Z. Wang, S. Liu, M. Li, and B. Zhang, “Improved generalized belief propagation for vision processing,” Mathematical Problems in Engineering , vol. 2011, 2010
2010
Cited alongside, same era.
X. Zhang, M. Burger, and S. Osher, “A unified primal-dual algorithm framework based on Bregman iteration,” SIAM J. Sci. Comput. , vol. 46, pp. 20–46, 2011
2011
Cited alongside, same era.
A. Chambolle and T. Pock, “A first-order primal-dual algorithm for convex problems with applications to imaging,” J. Math. Imaging Vis. , vol. 40, pp. 120–145, 2011
2011
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.
——, “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.
S. Rangan, P. Schniter, E. Riegler, A. Fletcher, and V. Cevher, “Fixed points of generalized approximate message passing with arbitrary matrices,” in Proc. ISIT , Jul. 2013, pp. 664–668
2013
Closest in time.
J. Vila, P. Schniter, and J. Meola, “Hyperspectral image unmixing via bilinear generalized approximate message passing,” in SPIE Defense, Security, and Sensing . International Society for Optics and Photonics, 2013, pp. 87 430Y–87 430Y
2013
Closest in time.
N. Parikh and S. Boyd, “Proximal algorithms,” Found. Trends Optimiz. , vol. 3, no. 1, pp. 123–231, 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, Oct. 2013
2013
Closest in time.
J. Parker, P. Schniter, and V. Cevher, “Bilinear generalized approximate message passing—Part I: Derivation,” IEEE Trans. Signal Processing , vol. 62, no. 22, pp. 5839 – 5853, 2013
2013
Closest in time.
——, “Bilinear generalized approximate message passing—Part II: Applications,” IEEE Trans. Signal Processing , vol. 62, no. 22, pp. 5854–5867, 2013
2013
Closest in time.
F. Krzakala, M. Mézard, and L. Zdeborová, “Phase diagram and approximate message passing for blind calibration and dictionary learning,” in Proc. IEEE ISIT , 2013, pp. 659–663
2013
Closest in time.
B. Çakmak, O. Winther, and B. H. Fleury, “S-AMP: Approximate message passing for general matrix ensembles,” in Proc. IEEE Information Theory Workshop (ITW) , 2014, pp. 192–196
2014
Closest in time.
S. Rangan, P. Schniter, and A. Fletcher, “On the convergence of approximate message passing with arbitrary matrices,” in Proc. ISIT , Jul. 2014, pp. 236–240
2014
Closest in time.
F. Caltagirone, L. Zdeborová, and F. Krzakala, “On convergence of approximate message passing,” in Proc. ISIT , Jul. 2014, pp. 1812–1816
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.
2014
Closest in time.
F. Krzakala, A. Manoel, E. W. Tramel, and L. Zdeborová, “Variational free energies for compressed sensing,” in Proc. ISIT , Jul. 2014, pp. 1499–1503
2014
Closest in time.
2014
Closest in time.
2014
Closest in time.
——, “Approximate message passing with consistent parameter estimation and applications to sparse learning,” IEEE Trans. Info. Theory , vol. 60, no. 5, pp. 2969 – 2985, Apr. 2014
2014
Closest in time.
J. Vila, P. Schniter, S. Rangan, F. Krzakala, and L. Zdeborová, “Adaptive damping and mean removal for the generalized approximate message passing algorithm,” in Proc. IEEE ICASSP , 2015, to appear
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.