Fetching the paper…
Reading the bibliography…
We introduce a neural-network architecture, termed the constrained recurrent sparse autoencoder (CRsAE), that solves convolutional dictionary learning problems, thus establishing a link between dictionary learning and neural networks.
A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the em algorithm,” Journal of the Royal Statistical Society: Series B (Methodological) , vol. 39, no. 1, pp. 1–22, 1977
1977
Earlier work this paper cites.
S. Chen, S. A. Billings, and W. Luo, “Orthogonal least squares methods and their application to non-linear system identification,” International Journal of Control , vol. 50, no. 5, pp. 1873–96, 1989
1989
Earlier work this paper cites.
S. Mallat, “A theory for multiresolution signal decomposition: The wavelet representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 11, pp. 674–693, 1989
1989
Earlier work this paper cites.
R. Mehrotra, K. Namuduri, and N. Ranganathan, “Gabor filter-based edge detection,” Pattern Recognition , vol. 25, no. 12, pp. 1479–94, 1992
1992
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–88, 1996
1996
Earlier work this paper cites.
S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM Review , vol. 43, pp. 129–59, 1998
1998
Earlier work this paper cites.
M. S. Lewicki, “A review of methods for spike sorting: the detection and classification of neural action potentials,” Network: Computation in Neural Systems , vol. 9, no. 4, pp. R53–R78, 1998
1998
Earlier work this paper cites.
Y. A. LeCun, L. Bottou, G. B. Orr, and K.-R. Müller, “Efficient backprop,” Neural Networks: Tricks Of The Trade , vol. 1524, pp. 9–50, 1998
1998
Earlier work this paper cites.
K. Engan, S. Aase, and J. Hakon Husoy, “Method of optimal directions for frame design,” in Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (ICASSP) , vol. 5, 1999, pp. 2443–46
1999
Earlier work this paper cites.
K. Harris, D. Henze, J. Csicsvari, H. Hirase, and G. Buzsaki, “Accuracy of tetrode spike separation as determined by simultaneous intracellular and extracellular measurements,” Journal Of Neurophysiology , vol. 84, no. 1, pp. 401–14, 2000
2000
Earlier work this paper cites.
D. L. Donoho and M. Elad, “Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization,” Proc. the National Academy of Sciences , vol. 100, no. 5, pp. 2197–2202, 2003
2003
Earlier work this paper cites.
Z. Wang, E. P. Simoncelli, and A. C. Bovik, “Multiscale structural similarity for image quality assessment,” in The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003 , vol. 2. Ieee, 2003, pp. 1398–1402
2003
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,” Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences , vol. 57, no. 11, pp. 1413–57, 2004
2004
Earlier work this paper cites.
M. Aharon, M. Elad, and A. Bruckstein, “K-svd: An algorithm for designing overcomplete dictionaries for sparse representation,” IEEE Transactions on Signal Processing , vol. 54, no. 11, pp. 4311–22, 2006
2006
Earlier work this paper cites.
E. J. Candès, J. K. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communications on Pure and Applied Mathematics , vol. 59, pp. 1–15, 2006
2006
Earlier work this paper cites.
T. Park and G. Casella, “The bayesian lasso,” Journal of the American Statistical Association , vol. 103, no. 482, pp. 681–86, 2008
2008
Cited alongside, same era.
E. J. Candès, “The restricted isometry property and its implications for compressed sensing,” Comptes Rendus Mathematique , vol. 346, no. 9, pp. 589–92, 2008
2008
Cited alongside, same era.
T. Blumensath and M. E. Davies, “Iterative hard thresholding for compressed sensing,” Applied and Computational Harmonic Analysis , vol. 27, no. 3, pp. 265–74, 2009
2009
Cited alongside, same era.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM journal on imaging sciences , vol. 2, no. 1, pp. 183–202, 2009
2009
Cited alongside, same era.
K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” in Proc. the 27th International Conference on Machine Learning (ICML) , 2010, pp. 399–406
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in Proc. the 3rd International Conference on Learning Representations (ICLR) , 2014, pp. 1–15
2014
Later among the works it cites.
C. Ekanadham, D. Tranchina, and E. P. Simoncelli, “A unified framework and method for automatic neural spike identification,” Journal of neuroscience methods , vol. 222, pp. 47–55, 2014
2014
Later among the works it cites.
A. Agarwal, A. Anandkumar, P. Jain, P. Netrapalli, and R. Tandon, “Learning sparsely used overcomplete dictionaries via alternating minimization,” SIAM Journal on Optimization , vol. 26, pp. 2775–99, 2016
2016
Later among the works it cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2016, pp. 770–8
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…
2010
Cited alongside, same era.
M. D. Zeiler, D. Krishnan, G. W. Taylor, and R. Fergus, “Deconvolutional networks,” in Proc. IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR) , 2010, pp. 2528–35
2010
Cited alongside, same era.
X. F. Zhu, B. Li, and J. D. Wang, “L1-norm sparse learning and its application,” Applied Mechanics and Materials , vol. 88-89, pp. 379–85, 2011
2011
Cited alongside, same era.
S. P. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends in Machine Learning , vol. 3, pp. 1–122, 2011
2011
Cited alongside, same era.
X. Glorot, A. Bordes, and Y. Bengio, “Deep sparse rectifier neural networks,” in Proc. the 14th International Conference on Artificial Intelligence and Statistics , 2011, pp. 315–23
2011
Cited alongside, same era.
M. Everingham, L. Van Gool, C. K. I. Williams, J. Winn, and A. Zisserman, “The PASCAL Visual Object Classes Challenge 2012 (VOC2012) Results,” 2012
2012
Cited alongside, same era.
J. T. Rolfe and Y. LeCun, “Discriminative recurrent sparse auto-encoders,” in Proc. International Conference on Learning Representations (ICLR) , 2013, pp. 1–15
2013
Cited alongside, same era.
A. Makhzani and B. J. Frey, “k-sparse autoencoders,” in Proc. International Conference on Learning Representations (ICLR) , 2014, pp. 1–9
2014
Cited alongside, same era.
2016
Later among the works it cites.
V. Papyan, Y. Romano, and M. Elad, “Convolutional neural networks analyzed via convolutional sparse coding,” Journal of Machine Learning Research , vol. 18, pp. 1–52, 2017
2017
Later among the works it cites.
L. N. Smith, “Cyclical learning rates for training neural networks,” in Proc. IEEE Winter Conference on Applications of Computer Vision (WACV) , vol. 1, 2017, pp. 464–72
2017
Later among the works it cites.
A. Krizhevsky, I. Sutskever, and G. Hinton, “Imagenet classification with deep convolutional neural networks,” in Proc. Advances in Neural Information Processing Systems 25 (NIPS) , 2017, pp. 1097–105
2017
Later among the works it cites.
B. Wohlberg, “SPORCO: A Python package for standard and convolutional sparse representations,” in Proc. 15th Python in Science Conference , Austin, TX, USA, 2017, pp. 1–8
2017
Later among the works it cites.
C. Garcia-Cardona and B. Wohlberg, “Convolutional dictionary learning: A comparative review and new algorithms,” IEEE Transactions on Computational Imaging , vol. 4, no. 3, pp. 366–81, Sep. 2018, there are errors in Equations (18) and (19) in the published version of the paper. These have been corrected in the most recent arXiv version
2018
Later among the works it cites.
H. Sreter and R. Giryes, “Learned convolutional sparse coding,” in Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , 2018, pp. 2191–95
2018
Later among the works it cites.
B. Tolooshams, S. Dey, and D. Ba, “Scalable convolutional dictionary learning with constrained recurrent sparse auto-encoders,” in Proc. IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP) , 2018, pp. 1–6
2018
Later among the works it cites.
M. Mardani, Q. Sun, D. Donoho, V. Papyan, H. Monajemi, S. Vasanawala, and J. Pauly, “Neural proximal gradient descent for compressive imaging,” in Proc. Advances in Neural Information Processing Systems 31 , S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, Eds. Curran Associates, Inc., 2018, pp. 9573–83
2018
Later among the works it cites.
D. Simon and M. Elad, “Rethinking the csc model for natural images,” in Proc. Advances in Neural Information Processing Systems 33 (NeurIPS) , 2019
2019
Closest in time.