Fetching the paper…
Reading the bibliography…
In this paper, we propose a novel sparse signal recovery algorithm called Trainable ISTA (TISTA).
K. Fukushima, “Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position,” Bio. Cybern., vol. 36, no. 4, pp. 193-202, 1980
1980
Earlier work this paper cites.
D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Learning representations by back-propagating errors,” Nature, vol. 323, no. 6088, pp. 533-536, Oct. 1986
1986
Earlier work this paper cites.
B. Aazhang, B. P. Paris and G. C. Orsak, “Neural networks for multiuser detection in code-division multiple-access communications,” IEEE Trans. Comm., vol. 40, no. 7, pp. 1212-1222, Jul. 1992
1992
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” J. Royal Stat. Society, Series B, vol. 58, pp. 267-288, 1996
1996
Earlier work this paper cites.
G. Davis, S. Mallat, and M. Avellaneda, “Adaptive greedy approximations,” Constructive Approximation, vol. 13, no. 1, pp. 57-98, Mar. 1997
1997
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., vol. 7, no. 3, pp. 319-335, Mar, 1998
1998
Earlier work this paper cites.
Y. A. LeCun, L. Bottou, G. B. Orr, and K. R. Müller, “Efficient backprop,” in Neural networks: Tricks of the trade
1998
Earlier work this paper cites.
M. Riesenhuber and T. Poggio, “Hierarchical models of object recognition in cortex,” Nature Neuroscience, vol. 2, no. 11, pp. 1019-1025, Nov. 1999
1999
Earlier work this paper cites.
Y. Kabashima, “A CDMA multiuser detection algorithm on the basis of belief propagation,” J. Phys. A: Math. Gen., vol. 36 pp. 11111-11121, Oct. 2003
2003
Earlier work this paper cites.
B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, “Least angle regression,” Ann. Stat., vol. 32, no. 2, pp. 407-499, Apr. 2004
2004
Earlier work this paper cites.
I. Daubechies, M. Defrise, and C. De Mol, “An iterative thresholding algorithm for linear inverse problems with a sparsity constraint,” Comm. Pure and Appl. Math., vol. 57, no. 11, pp. 1413-1457, Aug. 2004
2004
Earlier work this paper cites.
D. L. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006
2006
Earlier work this paper cites.
E. J. Candes and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?” IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006
2006
Earlier work this paper cites.
G. E. Hinton, R. R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” Science, vol. 313, no. 5786, pp. 504-507, Jun. 2006
2006
Earlier work this paper cites.
J. M. Bioucas-Dias and M. A. T. 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.
T. T. Wu and K. Lange, “Coordinate descent algorithms for lasso penalized regression,” Ann. Appl. Stat., vol. 2, no. 1, pp. 224-244, 2008
2008
Earlier work this paper cites.
R. Hadsell, A. Erkan, P. Sermanet, M. Scoffier, U. Muller and Y. LeCun, “Deep belief net learning in a long-range vision system for autonomous off-road driving,” 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems
2008
Cited alongside, same era.
P. Schniter, L. C. Potter and J. Ziniel, “Fast bayesian matching pursuit,” 2008 Information Theory and Applications Workshop
2008
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proceedings of the National Academy of Sciences, vol. 106, no. 45, pp. 18914-18919, Nov. 2009
2009
Cited alongside, same era.
A. Beck, and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM J Imaging Sciences, vol. 2, no. 1, pp. 183-202, 2009
2009
Cited alongside, same era.
F. Caltagirone, L. Zdeborova, and F. Krzakala, “On convergence of approximate message passing,” 2014 IEEE Int. Symp. Inf. Theory
2014
Later among the works it cites.
D. P. Kingma and J. L. Ba, “Adam: A method for stochastic optimization,” arXiv:1412.6980, 2014
2014
Later among the works it cites.
Z. Zhang, Y. Xu, J. Yang, X. Li, and D. Zhang, “A survey of sparse representation: Algorithms and applications,” IEEE Access, vol. 3, pp. 490-530, May. 2015
2015
Later among the works it cites.
“TensorFlow: Large-scale machine learning on heterogeneous systems,” http://tensorflow.org/
2015
Later among the works it cites.
E. Nachmani, Y. Beéry and D. Burshtein, “Learning to decode linear codes using deep learning,” 2016 54th Annual Allerton Conf. Comm., Control, and Computing
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…
D. L. Donoho, A. Maleki, and A. Montanari, “Message passing algorithms for compressed sensing: I. Motivation and construction,” IEEE Information Theory Workshop 2010
2010
Cited alongside, same era.
K. Gregor, and Y. LeCun, “Learning fast approximations of sparse coding,” Proc. 27th Int. Conf. Machine Learning
2010
Cited alongside, same era.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 764-785, Jan. 2011
2011
Cited alongside, same era.
R. Gribonval “Should penalized least squares regression be interpreted as maximum a posteriori estimation?, ” IEEE Trans. Sig. Process., vol.59, no.5, pp. 2405-2410, May. 2011
2011
Cited alongside, same era.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” IEEE Int. Symp. Inf. Theory
2011
Cited alongside, same era.
A. Krizhevsky, I. Sutskever, G. E. Hinton, “Imagenet classification with deep convolutional neural networks.” Advances in Neural Inf. Process. Sys. 2012
2012
Cited alongside, same era.
G. Hinton et al., “Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups,” IEEE Signal Processing Magazine, vol. 29, no. 6, pp. 82-97, Nov. 2012
2012
Cited alongside, same era.
G. E. Dahl, D. Yu, L. Deng and A. Acero, "Context-dependent pre-trained deep neural networks for large-vocabulary speech recognition," IEEE Trans. Audio, Speech, Lang. Process., vol. 20, no. 1, pp. 30-42, Jan. 2012
2012
Cited alongside, same era.
M. Borgerding and P. Schniter, “Onsager-corrected deep learning for sparse linear inverse problems,” 2016 IEEE Global Conf. Signal and Inf. Process. (GlobalSIP)
2016
Later among the works it cites.
J. Ma and L. Ping, “Orthogonal AMP,” IEEE Access, vol. 5, pp. 2020-2033, Jan. 2017
2017
Later among the works it cites.
S. Rangan, P. Schniter, and A. K. Fletcher, “Vector approximate message passing,” 2017 IEEE Int. Symp. Inf. Theory
2017
Later among the works it cites.
K. Takeuchi, “Rigorous dynamics of expectation-propagation-based signal recovery from unitarily invariant measurements,” 2017 IEEE Int. Symp. Inf. Theory
2017
Later among the works it cites.
T. O’Shea and J. Hoydis, “An introduction to deep learning for the physical layer,” IEEE Trans. Cog. Comm. Net., vol. 3, no. 4, pp. 563-575, Dec. 2017
2017
Later among the works it cites.
M. Borgerding, P. Schniter, and S. Rangan, “AMP-inspired deep networks for sparse linear inverse problems, ” IEEE Trans, Sig. Process. vol 65, no. 16, pp. 4293-4308 Aug. 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
A. Paszke et al., “Automatic differentiation in PyTorch,” 31st Conf. Neural Inf. Process. Syst
2017
Later among the works it cites.
R. Hayakawa and K. Hayashi, “Convex optimization-based signal detection for massive overloaded MIMO systems,” in IEEE Trans. Wireless Comm., vol. 16, no. 11, pp. 7080-7091, Nov. 2017
2017
Later among the works it cites.
J. Vila, P. Schniter, S. Rangan, F. Krzakala, and L. Zdeborova, “Adaptive damping and mean removal for the generalized approximate message passing algorithm,” 2015 IEEE International Conference on Acoustics, Speech and Signal Processing
2025
Closest in time.