Fetching the paper…
Reading the bibliography…
Deep generative networks provide a powerful tool for modeling complex data in a wide range of applications.
T. P. Minka, “A family of algorithms for approximate Bayesian inference,” Ph.D. dissertation, Dept. Comp. Sci. Eng., MIT, Cambridge, MA, 2001
2001
Earlier work this paper cites.
M. Opper and O. Winther, “Expectation consistent free energies for approximate inference,” in Proc. NIPS , 2004, pp. 1001–1008
2004
Earlier work this paper cites.
——, “Expectation consistent approximate inference,” J. Mach. Learning Res. , vol. 1, pp. 2177–2204, 2005
2005
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
Earlier work this paper cites.
——, “Message passing algorithms for compressed sensing I: Motivation and construction,” in Proc. Info. Theory Workshop , Jan. 2010, pp. 1–5
2010
Earlier work this paper cites.
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
Earlier work this paper cites.
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
Earlier work this paper cites.
M. Welling and Y. W. Teh, “Bayesian learning via stochastic gradient langevin dynamics,” in Proc. ICML , 2011, pp. 681–688
2011
Earlier work this paper cites.
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
Earlier work this paper 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, pp. 1246–1250
2012
Earlier work this paper cites.
F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, “Statistical-physics-based reconstruction in compressed sensing,” Physical Review X , vol. 2, no. 2, p. 021005, 2012
2012
Earlier work this paper cites.
D. P. Kingma and M. Welling, “Auto-encoding variational bayes,” arXiv:1312.6114 , 2013
2013
Earlier work this paper cites.
A. M. Tulino, G. Caire, S. Verdú, and S. Shamai, “Support recovery with sparsely sampled free random matrices,” IEEE Trans. Inform. Theory , vol. 59, no. 7, pp. 4243–4271, 2013
2013
Earlier work this paper cites.
F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborová, and P. Zhang, “Spectral redemption in clustering sparse networks,” Proceedings of the National Academy of Sciences , vol. 110, no. 52, pp. 20 935–20 940, 2013
2013
Earlier work this paper cites.
J. P. Vila and P. Schniter, “Expectation-maximization Gaussian-mixture approximate message passing,” IEEE Trans. Signal Process. , vol. 61, no. 19, pp. 4658–4672, 2013
2013
Earlier work this paper cites.
D. J. Rezende, S. Mohamed, and D. Wierstra, “Stochastic backpropagation and approximate inference in deep generative models,” in Proc. ICML , 2014, pp. 1278–1286
2014
Earlier work this paper cites.
Y. Bengio, E. Laufer, G. Alain, and J. Yosinski, “Deep generative stochastic networks trainable by backprop,” in Proc. International Conference on Machine Learning , 2014, pp. 226–234
2014
Cited alongside, same era.
F. Krzakala, A. Manoel, E. W. Tramel, and L. Zdeborová, “Variational free energies for compressed sensing,” in Proc. IEEE ISIT , Jul. 2014, pp. 1499–1503
2014
Cited alongside, same era.
S. Rangan, P. Schniter, and A. Fletcher, “On the convergence of approximate message passing with arbitrary matrices,” in Proc. IEEE Int. Symp. Inform. Theory , Jul. 2014, pp. 236–240
2014
Cited alongside, same era.
F. Caltagirone, L. Zdeborová, and F. Krzakala, “On convergence of approximate message passing,” in Proc. IEEE ISIT , Jul. 2014, pp. 1812–1816
2014
Cited alongside, same era.
P. Jylänki, A. Nummenmaa, and A. Vehtari, “Expectation propagation for neural networks with sparsity-promoting priors.” Journal of Machine Learning Research , vol. 15, no. 1, pp. 1849–1901, 2014
2016
Later among the works it cites.
2016
Later among the works it cites.
G. Reeves and H. D. Pfister, “The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact,” in Proc. IEEE ISIT , 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
2014
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,” IEEE Trans. Inform. Theory , vol. 60, no. 5, pp. 2969–2985, Apr. 2014
2014
Cited alongside, same era.
R. Salakhutdinov, “Learning deep generative models,” Annual Review of Statistics and Its Application , vol. 2, pp. 361–385, 2015
2015
Cited alongside, same era.
A. Mousavi, A. B. Patel, and R. G. Baraniuk, “A deep learning approach to structured signal recovery,” in Proc. 53rd Ann. Allerton Conf. on Commun., Control and Comp. , Sep.–Oct. 2015
2015
Cited alongside, same era.
2015
Cited alongside, same era.
Y. Deshpande and A. Montanari, “Finding hidden cliques of size \ \backslash sqrt { \{ N/e } \} in nearly linear time,” Foundations of Computational Mathematics , vol. 15, no. 4, pp. 1069–1128, 2015
2015
Cited alongside, same era.
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
Cited alongside, same era.
2016
Later among the works it cites.
T. Bui, D. Hernández-Lobato, J. Hernandez-Lobato, Y. Li, and R. Turner, “Deep gaussian processes for regression using approximate expectation propagation,” in International Conference on Machine Learning , 2016, pp. 1472–1481
2016
Later among the works it cites.
A. B. Patel, M. T. Nguyen, and R. Baraniuk, “A probabilistic framework for deep learning,” in Advances in Neural Information Processing Systems , 2016, pp. 2558–2566
2016
Later among the works it cites.
E. W. Tramel, A. Manoel, F. Caltagirone, M. Gabrié, and F. Krzakala, “Inferring sparsity: Compressed sensing using generalized restricted boltzmann machines,” in Proc. ITW , 2016, pp. 265–269
2016
Later among the works it cites.
2016
Later among the works it cites.
2017
Closest in time.
S. Rangan, A. K. Fletcher, P. Schniter, and U. S. Kamilov, “Inference for generalized linear models via alternating directions and Bethe free energy minimization,” IEEE Trans. Inform. Theory , vol. 63, no. 1, pp. 676–697, 2017
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
P. Schniter, S. Rangan, and A. K. Fletcher, “Vector approximate message passing for the generalized linear model,” in IEEE Intl. Conf. Acoustics, Speech and Signal Processing (ICASSP) , Mar. 2017
2017
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 Int. Conf. Acoust., Speech, and Signal Process. , 2015, pp. 2021–2025
2025
Closest in time.