Fetching the paper…
Reading the bibliography…
Nonconvex sparse learning plays an essential role in many areas, such as signal processing and deep network compression.
A. Jalali, C. C. Johnson, and P. K. Ravikumar, “On learning discrete graphical models using greedy methods,” in Advances in Neural Information Processing Systems , 2011, pp. 1935–1943
1943
Earlier work this paper cites.
S. G. Mallat and Z. Zhang, “Matching pursuits with time-frequency dictionaries,” IEEE Transactions on signal processing , vol. 41, no. 12, pp. 3397–3415, 1993
1993
Earlier work this paper cites.
Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, “Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition,” in Proceedings of 27th Asilomar conference on signals, systems and computers . IEEE, 1993, pp. 40–44
1993
Earlier work this paper cites.
B. K. Natarajan, “Sparse approximate solutions to linear systems,” SIAM journal on computing , vol. 24, no. 2, pp. 227–234, 1995
1995
Earlier work this paper cites.
P. Zhou, X. Yuan, and J. Feng, “Efficient stochastic gradient hard thresholding,” in Advances in Neural Information Processing Systems , 2018, pp. 1988–1997
1997
Earlier work this paper cites.
D. Wahlsten, P. Metten, T. J. Phillips, S. L. Boehm, S. Burkhart-Kasch, J. Dorow, S. Doerksen, C. Downing, J. Fogarty, K. Rodd-Henricks et al. , “Different data from different labs: lessons from studies of gene–environment interaction,” Journal of neurobiology , vol. 54, no. 1, pp. 283–311, 2003
2003
Earlier work this paper cites.
D. D. Lewis, Y. Yang, T. G. Rose, and F. Li, “Rcv1: A new benchmark collection for text categorization research,” Journal of machine learning research , vol. 5, no. Apr, pp. 361–397, 2004
2004
Earlier work this paper cites.
D. L. Donoho et al. , “Compressed sensing,” IEEE Transactions on information theory , vol. 52, no. 4, pp. 1289–1306, 2006
2006
Earlier work this paper cites.
J. A. Tropp and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Transactions on information theory , vol. 53, no. 12, pp. 4655–4666, 2007
2007
Earlier work this paper cites.
F. K. Kavvoura and J. P. Ioannidis, “Methods for meta-analysis in genetic association studies: a review of their potential and pitfalls,” Human genetics , vol. 123, no. 1, pp. 1–14, 2008
2008
Earlier work this paper cites.
D. Needell and J. A. Tropp, “Cosamp: Iterative signal recovery from incomplete and inaccurate samples,” Applied and computational harmonic analysis , vol. 26, no. 3, pp. 301–321, 2009
2009
Earlier work this paper cites.
T. Blumensath and M. E. Davies, “Iterative hard thresholding for compressed sensing,” Applied and computational harmonic analysis , vol. 27, no. 3, pp. 265–274, 2009
2009
Cited alongside, same era.
S. Kogan, D. Levin, B. R. Routledge, J. S. Sagi, and N. A. Smith, “Predicting risk from financial reports with regression,” in Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics , 2009, pp. 272–280
2009
Cited alongside, same era.
S. Foucart, “Hard thresholding pursuit: an algorithm for compressive sensing,” SIAM Journal on Numerical Analysis , vol. 49, no. 6, pp. 2543–2563, 2011
2011
Cited alongside, same era.
Y.-G. Lee, W. S. Jeong, and G. Yoon, “Smartphone-based mobile health monitoring,” Telemedicine and e-Health , vol. 18, no. 8, pp. 585–590, 2012
2012
Cited alongside, same era.
X. Li, T. Zhao, R. Arora, H. Liu, and J. Haupt, “Stochastic variance reduced optimization for nonconvex sparse learning,” in International Conference on Machine Learning , 2016, pp. 917–925
2016
Later among the works it cites.
2016
Later among the works it cites.
N. Nguyen, D. Needell, and T. Woolf, “Linear convergence of stochastic iterative greedy algorithms with sparse constraints,” IEEE Transactions on Information Theory , vol. 63, no. 11, pp. 6869–6895, 2017
2017
Later among the works it cites.
J. Wang, M. Kolar, N. Srebro, and T. Zhang, “Efficient distributed learning with sparsity,” in International Conference on Machine Learning , 2017, pp. 3636–3645
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Bahmani, B. Raj, and P. T. Boufounos, “Greedy sparsity-constrained optimization,” Journal of Machine Learning Research , vol. 14, no. Mar, pp. 807–841, 2013
2013
Cited alongside, same era.
P. Jain, A. Tewari, and P. Kar, “On iterative hard thresholding methods for high-dimensional m-estimation,” in Advances in Neural Information Processing Systems , 2014, pp. 685–693
2014
Cited alongside, same era.
S. Patterson, Y. C. Eldar, and I. Keidar, “Distributed compressed sensing for static and time-varying networks,” IEEE Transactions on Signal Processing , vol. 62, no. 19, pp. 4931–4946, 2014
2014
Cited alongside, same era.
P.-L. Loh and M. J. Wainwright, “Regularized m-estimators with nonconvexity: Statistical and algorithmic theory for local optima,” The Journal of Machine Learning Research , vol. 16, no. 1, pp. 559–616, 2015
2015
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2018
Later among the works it cites.
Z. Qin, J. Fan, Y. Liu, Y. Gao, and G. Y. Li, “Sparse representation for wireless communications: A compressive sensing approach,” IEEE Signal Processing Magazine , vol. 35, no. 3, pp. 40–58, 2018
2018
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
L. Wang and Q. Gu, “Differentially private iterative gradient hard thresholding for sparse learning,” in 28th International Joint Conference on Artificial Intelligence , 2019
2019
Later among the works it cites.
2020
Closest in time.
X. Chen, Z. Qi, and J. Xu, “Hdiht: A high-accuracy distributed iterative hard thresholding algorithm for compressed sensing,” IEEE Access , vol. 8, pp. 49 180–49 186, 2020
2020
Closest in time.