Fetching the paper…
Reading the bibliography…
Sparse coding is typically solved by iterative optimization techniques, such as the Iterative Shrinkage-Thresholding Algorithm (ISTA).
Distribution of eigenvalues for some sets of random matrices
Vladimir A Marchenko and Leonid Andreevich Pastur · 1967
Earlier work this paper cites.
Convergence conditions for nonlinear programming algorithms
Willard I Zangwill · 1969
Earlier work this paper cites.
A method for solving a convex programming problem with rate of convergence O ( 1 / k 2 ) {O}(1/k^{2})
Yurii Nesterov · 1983
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
Robert Tibshirani · 1996
Earlier work this paper cites.
Sparse coding with an incomplete basis set: a strategy employed by V1, 1997
Bruno A. Olshausen and David J Field · 1997
Earlier work this paper cites.
Convergence of a block coordinate descent method for nondifferentiable minimization
Paul Tseng · 2001
Earlier work this paper cites.
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
Ingrid Daubechies, Michel Defrise, and Christine De Mol · 2004
Earlier work this paper cites.
Least angle regression
Bradley Efron, Trevor Hastie, Iain Johnstone, and Robert Tibshirani · 2004
Earlier work this paper cites.
Boosting as a regularized path to a maximum margin classifier
Saharon Rosset, Ji Zhu, and Trevor Hastie · 2004
Earlier work this paper cites.
Pathwise coordinate optimization
Jerome Friedman, Trevor Hastie, Holger Höfling, and Robert Tibshirani · 2007
Earlier work this paper cites.
Fixed-point continuation for ℓ 1 \ell_{1} -minimization: Methodology and convergence
Elaine Hale, Wotao Yin, and Yin Zhang · 2008
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Amir Beck and Marc Teboulle · 2009
Earlier work this paper cites.
Learning Fast Approximations of Sparse Coding
Karol Gregor and Yann Le Cun · 2010
Earlier work this paper cites.
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Patrick L Combettes and Heinz H. Bauschke · 2011
Earlier work this paper cites.
Scikit-learn: Machine learning in Python
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay · 2011
Cited alongside, same era.
Safe feature elimination in sparse supervised learning
Laurent El Ghaoui, Vivian Viallon, and Tarek Rabbani · 2012
Cited alongside, same era.
Learning efficient structured sparse models
Pablo Sprechmann, Alex M. Bronstein, and Guillermo Sapiro · 2012
Cited alongside, same era.
Efficient supervised sparse analysis and synthesis operators
Pablo Sprechmann, Roee Litman, and TB Yakar · 2013
Cited alongside, same era.
The lasso problem and uniqueness
Ryan Tibshirani · 2013
Cited alongside, same era.
Deep unfolding: Model-based inspiration of novel deep architectures
John R. Hershey, Jonathan Le Roux, and Felix Weninger · 2014
Cited alongside, same era.
Understanding neural sparse coding with matrix factorization
Thomas Moreau and Joan Bruna · 2017
Later among the works it cites.
Gap safe screening rules for sparsity enforcing penalties
Eugene Ndiaye, Olivier Fercoq, Alexandre Gramfort, and Joseph Salmon · 2017
Later among the works it cites.
Automatic differentiation in PyTorch
Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer · 2017
Later among the works it cites.
Python Language Reference, version 3.6
Python Software Foundation · 2017
Later among the works it cites.
Deep ADMM-Net for compressive censing MRI
Yan Yang, Jian Sun, Huibin Li, and Zongben Xu · 2017
Later among the works it cites.
Theoretical linear convergence of unfolded ISTA and its practical weights and thresholds
Xiaohan Chen, Jialin Liu, Zhangyang Wang, and Wotao Yin · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Local linear convergence of forward–backward under partial smoothness
Jingwei Liang, Jalal Fadili, and Gabriel Peyré · 2014
Cited alongside, same era.
Statistical Learning with Sparsity: The Lasso and Generalizations
Trevor Hastie, Robert Tibshirani, and Martin Wainwright · 2015
Cited alongside, same era.
Blitz: A principled meta-algorithm for scaling sparse optimization
Tyler Johnson and Carlos Guestrin · 2015
Cited alongside, same era.
Learning deep ℓ 0 \ell_{0} encoders
Zhangyang Wang, Qing Ling, and Thomas S. Huang · 2015
Cited alongside, same era.
Maximal sparsity with deep networks?
Bo Xin, Yizhou Wang, Wen Gao, and David Wipf · 2016
Cited alongside, same era.
Learning to solve inverse problems using Wasserstein loss
Jonas Adler, Axel Ringh, Ozan Öktem, and Johan Karlsson · 2017
Cited alongside, same era.
Later among the works it cites.
Tradeoffs between convergence speed and reconstruction accuracy in inverse problems
Raja Giryes, Yonina C. Eldar, Alex M. Bronstein, and Guillermo Sapiro · 2018
Later among the works it cites.
Trainable ISTA for sparse signal recovery
Daisuke Ito, Satoshi Takabe, and Tadashi Wadayama · 2018
Later among the works it cites.
Celer: a Fast Solver for the Lasso with Dual Extrapolation
Mathurin Massias, Alexandre Gramfort, and Joseph Salmon · 2018
Later among the works it cites.
Local convergence properties of SAGA and prox-SVRG and acceleration
Clarice Poon, Jingwei Liang, and Carola-Bibiane Schönlieb · 2018
Later among the works it cites.
ISTA-Net: Interpretable optimization-inspired deep network for image compressive sensing
Jian Zhang and Bernard Ghanem · 2018
Later among the works it cites.
ALISTA: Analytic weights are as good as learned weigths in LISTA
Jialin Liu, Xiaohan Chen, Zhangyang Wang, and Wotao Yin · 2019
Closest in time.
Are we there yet? manifold identification of gradient-related proximal methods
Yifan Sun, Halyun Jeong, Julie Nutini, and Mark Schmidt · 2019
Closest in time.