Fetching the paper…
Reading the bibliography…
Deep generative priors offer powerful models for complex-structured data, such as images, audio, and text.
P. McCullagh and J. A. Nelder, Generalized Linear Models , 2nd ed. Chapman & Hall, 1989
1989
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society: Series B (Methodological) , vol. 58, no. 1, pp. 267–288, 1996
1996
Earlier work this paper cites.
M. Bertalmio, G. Sapiro, V. Caselles, and C. Ballester, “Image inpainting,” in Proc. ACM Conf. Computer Graphics and Interactive Techniques , 2000, pp. 417–424
2000
Earlier work this paper cites.
T. P. Minka, “Expectation propagation for approximate bayesian inference,” in Proc. UAI , 2001, pp. 362–369
2001
Earlier work this paper cites.
M. Opper and O. Winther, “Expectation consistent approximate inference,” J. Machine Learning Res. , vol. 6, pp. 2177–2204, Dec. 2005
2005
Earlier work this paper cites.
J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Constructing free-energy approximations and generalized belief propagation algorithms,” IEEE Trans. Information Theory , vol. 51, no. 7, pp. 2282–2312, 2005
2005
Earlier work this paper cites.
M. J. Wainwright and M. I. Jordan, “Graphical models, exponential families, and variational inference,” Foundations and Trends in Machine Learning , vol. 1, no. 1–2, pp. 1–305, 2008
2008
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,” in Proc. Inform. Theory Workshop , 2010, pp. 1–5
2010
Earlier work this paper cites.
M. Welling and Y. W. Teh, “Bayesian learning via stochastic gradient Langevin dynamics,” in Proc. 28th Int. Conf. Machine Learning , 2011, pp. 681–688
2011
Earlier work this paper cites.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in Proc. IEEE Int. Symp. Information Theory , 2011, pp. 2168–2172
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.
P. J. Huber, Robust Statistics . Springer, 2011
2011
Earlier work this paper cites.
Y. C. Eldar and G. Kutyniok, Compressed Sensing: Theory and Applications . Cambridge Univ. Press, Jun. 2012
2012
Earlier work this paper cites.
R. M. Neal, Bayesian learning for neural networks . Springer Science & Business Media, 2012, vol. 118
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. Javanmard and A. Montanari, “State evolution for general approximate message passing algorithms, with applications to spatial coupling,” Information and Inference , vol. 2, no. 2, pp. 115–144, 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.
B. Cakmak, O. Winther, and B. H. Fleury, “S-AMP: Approximate message passing for general matrix ensembles,” in Proc. IEEE ITW , 2014
2014
Earlier work this paper cites.
F. Krzakala, A. Manoel, E. W. Tramel, and L. Zdeborová, “Variational free energies for compressed sensing,” in Proc. IEEE Int. Symp. Information Theory , 2014, pp. 1499–1503
2014
Earlier work this paper cites.
B. He, H. Liu, Z. Wang, and X. Yuan, “A strictly contractive peaceman–rachford splitting method for convex programming,” SIAM Journal on Optimization , vol. 24, no. 3, pp. 1011–1040, 2014
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
S. Rangan, P. Schniter, and A. K. Fletcher, “On the convergence of approximate message passing with arbitrary matrices,” in Proc. IEEE Int. Symp. Information Theory , Jul. 2014, pp. 236–240
2014
Earlier work this paper cites.
2015
Cited alongside, same era.
R. Salakhutdinov, “Learning deep generative models,” Annual Review of Statistics and Its Application , vol. 2, 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. Allerton Conf. Comm. Control & Comput. , 2015, pp. 1336–1343
2015
Cited alongside, same era.
A. Mahendran and A. Vedaldi, “Understanding deep image representations by inverting them,” in Proc. IEEE Conf. Computer Vision and Pattern Recognition , 2015, pp. 5188–5196
2015
Cited alongside, same era.
G. Reeves, “Additivity of information in multilayer networks via additive Gaussian noise transforms,” in Proc. Allerton Conf. Comm. Control & Comput. , 2017, pp. 1064–1070
2017
Later among the works it cites.
2017
Later among the works it cites.
A. K. Fletcher, S. Rangan, and P. Schniter, “Inference in deep networks in high dimensions,” Proc. IEEE Int. Symp. Information Theory , 2018
2018
Later among the works it cites.
D. Ulyanov, A. Vedaldi, and V. Lempitsky, “Deep image prior,” in Proc. IEEE Conf. Computer Vision and Pattern Recognition , 2018, pp. 9446–9454
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
A. Choromanska, M. Henaff, M. Mathieu, G. B. Arous, and Y. LeCun, “The loss surfaces of multilayer networks,” in Artificial Intelligence and Statistics , 2015, pp. 192–204
2015
Cited alongside, same era.
M. Pereyra, P. Schniter, E. Chouzenoux, J.-C. Pesquet, J.-Y. Tourneret, A. O. Hero, and S. McLaughlin, “A survey of stochastic simulation and optimization methods in signal processing,” IEEE J. Sel. Top. Signal Process. , vol. 10, no. 2, pp. 224–241, 2015
2015
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
A. K. Fletcher, M. Sahraee-Ardakan, S. Rangan, and P. Schniter, “Expectation consistent approximate inference: Generalizations and convergence,” in Proc. IEEE Int. Symp. Information Theory , 2016, pp. 190–194
2016
Cited alongside, same era.
S. Rangan, P. Schniter, E. Riegler, A. K. Fletcher, and V. Cevher, “Fixed points of generalized approximate message passing with arbitrary matrices,” IEEE Trans. Information Theory , vol. 62, no. 12, pp. 7464–7474, 2016
2016
Cited alongside, same era.
G. Reeves and H. D. Pfister, “The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact,” in Proc. IEEE Int. Symp. Information Theory , 2016, pp. 665–669
2016
Cited alongside, same era.
2018
Later among the works it cites.
M. Kabkab, P. Samangouei, and R. Chellappa, “Task-aware compressed sensing with generative adversarial networks,” in Thirty-Second AAAI Conference on Artificial Intelligence , 2018
2018
Later among the works it cites.
V. Shah and C. Hegde, “Solving linear inverse problems using GAN priors: An algorithm with provable guarantees,” in IEEE Int. Conf. Acoustics, Speech and Signal Processing , 2018, pp. 4609–4613
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
A. K. Fletcher, P. Pandit, S. Rangan, S. Sarkar, and P. Schniter, “Plug-in estimation in high-dimensional linear inverse problems: A rigorous analysis,” in Advances in Neural Information Processing Systems , 2018, pp. 7440–7449
2018
Later among the works it cites.
M. Gabrié, A. Manoel, C. Luneau, J. Barbier, N. Macris, F. Krzakala, and L. Zdeborová, “Entropy and mutual information in models of deep neural networks,” in Proc. NIPS , 2018
2018
Later among the works it cites.
B. Hanin and D. Rolnick, “How to start training: The effect of initialization and architecture,” in Advances in Neural Information Processing Systems , 2018, pp. 571–581
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
C. Rush and R. Venkataramanan, “Finite-sample analysis of approximate message passing algorithms,” IEEE Trans. Inform. Theory , vol. 64, no. 11, pp. 7264–7286, 2018
2018
Later among the works it cites.
P. Pandit, M. Sahraee, S. Rangan, and A. K. Fletcher, “Asymptotics of MAP inference in deep networks,” in Proc. IEEE Int. Symp. Information Theory , 2019, pp. 842–846
2019
Closest in time.
S. Sarkar, A. K. Fletcher, S. Rangan, and P. Schniter, “Bilinear recovery using adaptive vector-amp,” IEEE Tran. Signal Processing , vol. 67, no. 13, pp. 3383–3396, 2019
2019
Closest in time.
S. Rangan, P. Schniter, and A. K. Fletcher, “Vector approximate message passing,” IEEE Trans. Information Theory , vol. 65, no. 10, pp. 6664–6684, 2019
2019
Closest in time.
J. Barbier, F. Krzakala, N. Macris, L. Miolane, and L. Zdeborová, “Optimal errors and phase transitions in high-dimensional generalized linear models,” Proc. Nat. Acad. Sci. , vol. 116, no. 12, pp. 5451–5460, 2019
2019
Closest in time.
P. Li and P.-M. Nguyen, “On random deep weight-tied autoencoders: Exact asymptotic analysis, phase transitions, and implications to training,” in Proc. Int. Conf. Learning Research , 2019
2019
Closest in time.
2019
Closest in time.
A. Manoel, F. Krzakala, M. Mézard, and L. Zdeborová, “Multi-layer generalized linear estimation,” in Proc. IEEE Int. Symp. Information Theory , 2017, pp. 2098–2102
2098
Closest in time.