Fetching the paper…
Reading the bibliography…
We consider the problem of reconstructing a signal from multi-layered (possibly) non-linear measurements.
D. J. Thouless, P. W. Anderson, and R. G. Palmer, “Solution of’solvable model of a spin glass’,” Philosophical Magazine , vol. 35, p. 593, 1977
1977
Earlier work this paper cites.
M. Mézard, “The space of interactions in neural networks: Gardner’s computation with the cavity method,” J. Phys. A: Math. & Th. , vol. 22, no. 12, p. 2181, 1989
1989
Earlier work this paper cites.
E. Gardner and B. Derrida, “Three unfinished works on the optimal storage capacity of networks,” Journal of Physics A: Mathematical and General , vol. 22, no. 12, p. 1983, 1989
1989
Earlier work this paper cites.
A. Engel and C. Van den Broeck, Statistical mechanics of learning . Cambridge University Press, 2001
2001
Earlier work this paper cites.
T. Tanaka, “A statistical-mechanics approach to large-system analysis of cdma multiuser detectors,” IEEE Trans. Info. Theory , vol. 48, no. 11, pp. 2888–2910, 2002
2002
Earlier work this paper cites.
J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Understanding belief propagation and its generalizations,” Exploring artificial intelligence in the new millennium , vol. 8, pp. 236–239, 2003
2003
Earlier work this paper cites.
A. M. Tulino and S. Verdú, Random Matrix Theory and Wireless Communications . Now Publishers Inc, 2004
2004
Earlier work this paper cites.
K. Takeda, S. Uda, and Y. Kabashima, “Analysis of cdma systems that are characterized by eigenvalue spectrum,” EPL , vol. 76, p. 1193, 2006
2006
Earlier work this paper cites.
Y. Kabashima, “Inference from correlated patterns: a unified theory for perceptron learning and linear vector channels,” J. Phys.: Conference Series , vol. 95, p. 012001, 2008
2008
Earlier work this paper cites.
M. Mézard and A. Montanari, Information, physics, and computation . Oxford University Press, 2009
2009
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. Natl. Acad. Sci , vol. 106, p. 18914, 2009
2009
Cited alongside, same era.
P. J. Mucha, T. Richardson, K. Macon, M. A. Porter, and J.-P. Onnela, “Community structure in time-dependent, multiscale, and multiplex networks,” Science , vol. 328, no. 5980, pp. 876–878, 2010
2010
Cited alongside, same era.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in 2011 IEEE International Symposium on Information Theory (ISIT) , Jul. 2011, pp. 2168–2172
2011
Cited alongside, same era.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Transactions on Information Theory , vol. 57, no. 2, pp. 764–785, 2011
B. Çakmak, O. Winther, and B. H. Fleury, “S-AMP: Approximate message passing for general matrix ensembles,” in 2014 IEEE Information Theory Workshop (ITW) , Nov. 2014, pp. 192–196
2014
Later among the works it cites.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” Nature , vol. 521, no. 7553, pp. 436–444, 2015
2015
Later among the works it cites.
R. Ranganath, L. Tang, L. Charlin, and D. Blei, “Deep Exponential Families,” in AISTATS , 2015, pp. 762–771
2015
Later among the works it cites.
R. Ranganath, D. Tran, and D. M. Blei, “Hierarchical Variational Models,” in International Conference on Machine Learning (ICML) , 2016
2016
Later among the works it cites.
2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
Y. Wu and S. Verdú, “Optimal phase transitions in compressed sensing,” IEEE Trans. Info. Theory , vol. 58, no. 10, pp. 6241–6263, 2012
2012
Cited alongside, same era.
F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, “Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices,” J. Stat Mech.: Theory and Experiment , vol. 2012, no. 08, p. P08009, 2012
2012
Cited alongside, same era.
A. M. Tulino, G. Caire, S. Verdú, and S. Shamai, “Support Recovery With Sparsely Sampled Free Random Matrices,” IEEE Trans. Info. Theory , vol. 59, no. 7, pp. 4243–4271, Jul. 2013
2013
Cited alongside, same era.
Y. Kabashima and M. Vehkaperä, “Signal recovery using expectation consistent approximation for linear observations,” in 2014 IEEE International Symposium on Information Theory (ISIT) , Jun. 2014, p. 226
2014
Cited alongside, same era.
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 2016 IEEE International Symposium on Information Theory (ISIT) , 2016, p. 665
2016
Later among the works it cites.
S. Rangan, P. Schniter, and A. Fletcher, “Vector Approximate Message Passing,” Oct. 2016, arXiv: 1610.03082
2016
Later among the works it cites.
2016
Later among the works it cites.