Fetching the paper…
Reading the bibliography…
Deep learning has gained great popularity due to its widespread success on many inference problems.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” J. Roy. Statist. Soc. B
1996
Earlier work this paper cites.
A. Chambolle, R. A. DeVore, N. Lee, and B. J. Lucier, “Nonlinear wavelet image processing: Variational problems, compression, and noise removal through wavelet shrinkage,” IEEE Trans. Image Process
1998
Earlier work this paper cites.
S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM J. Scientific Comput
1998
Earlier work this paper cites.
M. Unser, “Splines: A perfect fit for signal and image processing,” IEEE Signal Process. Mag
1999
Earlier work this paper cites.
A. M. Sayeed, “Deconstructing multi-antenna fading channels,” IEEE Trans. Signal Process
2002
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
2004
Earlier work this paper cites.
E. Candès, J. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communications on Pure and Applied Mathematics
2006
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM J. Imag. Sci
2009
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message passing algorithms for compressed sensing,” Proc. Nat. Acad. Sci
2009
Earlier work this paper cites.
A. K. Fletcher, S. Rangan, and V. K. Goyal, “A sparsity detection framework for on-off random access channels,” in Proc. IEEE Int. Symp. Inform. Thy
2009
Earlier work this paper cites.
M. J. Wainwright, “Sharp thresholds for high-dimensional and noisy recovery of sparsity using ℓ 1 \ell_{1} -constrained quadratic programming (lasso),” IEEE Trans. Inform. Theory
2009
Earlier work this paper cites.
K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” in Proc. Int. Conf. Mach. Learning
2010
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message passing algorithms for compressed sensing: I. Motivation and construction,” in Proc. Inform. Theory Workshop
2010
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
2011
Earlier work this paper cites.
(full version at arXiv:1010.5141 )
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in Proc. IEEE Int. Symp. Inform. Thy · 2011
Earlier work this paper cites.
New York: Cambridge Univ. Press, 2012
Y. C. Eldar and G. Kutyniok, Compressed Sensing: Theory and Applications · 2012
Earlier work this paper cites.
P. Sprechmann, P. Bronstein, and G. Sapiro, “Learning efficient structured-sparse models,” in Proc. Int. Conf. Mach. Learning
2012
Earlier work this paper cites.
A. Montanari, “Graphical models concepts in compressed sensing,” in Compressed Sensing: Theory and Applications
2012
Earlier work this paper cites.
H. C. Burger, C. J. Schuler, and S. Harmeling, “Image denoising: Can plain neural networks compete with BM3D?,” in Proc. IEEE Conf. Comp. Vision Pattern Recog
2012
Cited alongside, same era.
U. S. Kamilov, V. K. Goyal, and S. Rangan, “Message-passing de-quantization with applications to compressed sensing,” IEEE Trans. Signal Process
2012
Cited alongside, same era.
A. M. Tulino, G. Caire, S. Verdú, and S. Shamai (Shitz), “Support recovery with sparsely sampled free random matrices,” IEEE Trans. Inform. Theory
2013
Cited alongside, same era.
C. J. Schuler, H. C. Burger, S. Harmeling, and B. Scholkopf, “A machine learning approach for non-blind image deconvolution,” in Proc. IEEE Conf. Comp. Vision Pattern Recog
2013
Cited alongside, same era.
J. P. Vila and P. Schniter, “Expectation-maximization Gaussian-mixture approximate message passing,” IEEE Trans. Signal Process
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in Proc. Internat. Conf. on Learning Repres
2015
Later among the works it cites.
G. Wunder, H. Boche, T. Strohmer, and P. Jung, “Sparse signal processing concepts for efficient 5G system design,” IEEE Access
2015
Later among the works it cites.
C.-K. Wen, S. Jin, K.-K. Wong, J.-C. Chen, and P. Ting, “Channel estimation for massive MIMO using Gaussian-mixture Bayesian learning,” IEEE Trans. Wireless Commun
2015
Later among the works it cites.
P. Schniter and S. Rangan, “Compressive phase retrieval via generalized approximate message passing,” IEEE Trans. Signal Process
2015
Later among the works it cites.
M. Borgerding and P. Schniter, “Onsager-corrected deep learning for sparse linear inverse problems,” in Proc. IEEE Global Conf. Signal Info. Process
2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
C. Bockelmann, H. F. Schepker, and A. Dekorsy, “Compressive sensing based multi-user detection for machine-to-machine communication,” Trans. Emerging Telecomm. Tech
2013
Cited alongside, same era.
F. Rusek, D. Persson, B. K. Lau, E. G. Larsson, T. L. Marzetta, O. Edfors, and F. Tufvesson, “Scaling up MIMO: Opportunities and challenges with very large arrays,” IEEE Signal Process. Mag
2013
Cited alongside, same era.
J. R. Hershey, J. Le Roux, and F. Weninger, “Deep unfolding: Model-based inspiration of novel deep architectures,” Tech. Rep. TR2014-117, Mitsubishi Electric Research Labs, 2014
2014
Cited alongside, same era.
U. Schmidt and S. Roth, “Shrinkage fields for effective image restoration,” in Proc. IEEE Conf. Comp. Vision Pattern Recog
2014
Cited alongside, same era.
J. G. Andrews, S. Buzzi, W. Choi, S. V. Hanly, A. Lozano, A. C. Soong, and J. C. Zhang, “What will 5G be?,” IEEE J. Sel. Areas Commun
2014
Cited alongside, same era.
Z. Wang, D. Liu, J. Yang, W. Han, and T. S. Huang, “Deep networks for image super-resolution with sparse prior,” in Proc. IEEE Conf. Comp. Vision Pattern Recog
2015
Cited alongside, same era.
2015
Cited alongside, same era.
MIT Press, 2016
I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning · 2016
Closest in time.
U. Kamilov and H. Mansour, “Learning optimal nonlinearities for iterative thresholding algorithms,” IEEE Signal Process. Lett
2016
Closest in time.
Z. Wang, Q. Ling, and T. S. Huang, “Learning deep ℓ 0 \ell_{0} encoders,” in Proc. AAAI Conf. Artificial Intell
2016
Closest in time.
S. Rangan, P. Schniter, and A. K. Fletcher, “Vector approximate message passing,” arXiv:1610.03082
2016
Closest in time.
A. Veit, M. Wilber, and S. Belongie, “Residual networks behave like ensembles of relatively shallow networks,” in Proc. Neural Inform. Process. Syst. Conf
2016
Closest in time.
C. Dong, C. C. Loy, K. He, and X. Tang, “Image super-resolution using deep convolutional networks,” IEEE Trans. Pattern Anal. Mach. Intell
2016
Closest in time.
B. Xin, Y. Wang, W. Gao, and D. Wipf, “Maximal sparsity from deep networks?,” in Proc. Neural Inform. Process. Syst. Conf
2016
Closest in time.
K. Kulkarni, S. Lohi, P. Turaga, R. Kerviche, and A. Ashok, “ReconNet: Non-iterative reconstruction of images from compressively sensed random measurements,” in Proc. IEEE Conf. Comp. Vision Pattern Recog
2016
Closest in time.
M. Iliadis, L. Spinoulas, and A. K. Katsaggelos, “Deep fully-connected networks for video compressive sensing,” in arXiv:1603:04930
2016
Closest in time.
P. Schniter, S. Rangan, and A. K. Fletcher, “Vector approximate message passing for the generalized linear model,” in Proc. Asilomar Conf. Signals Syst. Comput
2016
Closest in time.
A. K. Fletcher and P. Schniter, “Learning and free energies for vector approximate message passing,” in Proc. IEEE Int. Conf. Acoust. Speech & Signal Process
2017
Closest in time.
A. Mousavi and R. Baraniuk, “Learning to invert: Signal recovery via deep convolutional networks,” in Proc. ICASSP, to appear
2017
Closest in time.