{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:57Z","timestamp":1740107877191,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T00:00:00Z","timestamp":1566777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T00:00:00Z","timestamp":1566777600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"e Macau Science and Technology Development Funds","award":["003\/2016\/AFJ"],"award-info":[{"award-number":["003\/2016\/AFJ"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00500-019-04275-x","type":"journal-article","created":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T15:04:20Z","timestamp":1566831860000},"page":"5245-5253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A greedy screening test strategy to accelerate solving LASSO problems with small regularization parameters"],"prefix":"10.1007","volume":"24","author":[{"given":"Hai-Wei","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Chai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang-Yong","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Bing","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2858-2810","authenticated-orcid":false,"given":"Yong","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang-Tao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,26]]},"reference":[{"issue":"8","key":"4275_CR1","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1080\/17415970600971987","volume":"15","author":"V Agarwal","year":"2007","unstructured":"Agarwal V, Gribok AV, Abidi MA (2007) Image restoration using l1 norm penalty function. Inverse Problems Sci Eng 15(8):785\u2013809","journal-title":"Inverse Problems Sci Eng"},{"key":"4275_CR2","doi-asserted-by":"crossref","unstructured":"Angelosante D, Giannakis GB (2009) Rls-weighted lasso for adaptive estimation of sparse signals. In: IEEE international conference on acoustics, speech and signal processing, ICASSP 2009. IEEE, pp 3245\u20133248","DOI":"10.1109\/ICASSP.2009.4960316"},{"key":"4275_CR3","doi-asserted-by":"crossref","unstructured":"Angelosante D, Giannakis GB, Grossi E (2009) Compressed sensing of time-varying signals. In: 2009 16th international conference on digital signal processing. IEEE, pp 1\u20138","DOI":"10.1109\/ICDSP.2009.5201168"},{"issue":"1","key":"4275_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009a) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci 2(1):183\u2013202","journal-title":"SIAM J Imaging Sci"},{"key":"4275_CR5","doi-asserted-by":"crossref","unstructured":"Beck A, Teboulle M (2009b) A fast iterative shrinkage-thresholding algorithm with application to wavelet-based image deblurring. In: 2009 IEEE international conference on acoustics, speech and signal processing. IEEE, pp 693\u2013696","DOI":"10.1109\/ICASSP.2009.4959678"},{"issue":"12","key":"4275_CR6","doi-asserted-by":"publisher","first-page":"2992","DOI":"10.1109\/TIP.2007.909319","volume":"16","author":"JM Bioucas-Dias","year":"2007","unstructured":"Bioucas-Dias JM, Figueiredo MA (2007) A new twist: two-step iterative shrinkage\/thresholding algorithms for image restoration. IEEE Trans Image Process 16(12):2992\u20133004","journal-title":"IEEE Trans Image Process"},{"key":"4275_CR7","unstructured":"Bonnefoy A, Emiya V, Ralaivola L, Gribonval R (2014) A dynamic screening principle for the lasso. In: 2014 22nd European signal processing conference (EUSIPCO). IEEE, pp 6\u201310"},{"key":"4275_CR8","doi-asserted-by":"crossref","unstructured":"Bottou L (2010) Large-scale machine learning with stochastic gradient descent. In: Proceedings of COMPSTAT\u20192010. Springer, pp 177\u2013186","DOI":"10.1007\/978-3-7908-2604-3_16"},{"issue":"1","key":"4275_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle A, Pock T (2011) A first-order primal-dual algorithm for convex problems with applications to imaging. J Math Imaging Vis 40(1):120\u2013145","journal-title":"J Math Imaging Vis"},{"issue":"11","key":"4275_CR10","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies I, Defrise M, De Mol C (2004) An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun Pure Appl Math 57(11):1413\u20131457","journal-title":"Commun Pure Appl Math"},{"issue":"11","key":"4275_CR11","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.1158\/1078-0432.CCR-06-2765","volume":"13","author":"C Desmedt","year":"2007","unstructured":"Desmedt C, Piette F, Loi S, Wang Y, Lallemand F, Haibe-Kains B, Viale G, Delorenzi M, Zhang Y, d\u2019Assignies MS et al (2007) Strong time dependence of the 76-gene prognostic signature for node-negative breast cancer patients in the transbig multicenter independent validation series. Clin Cancer Res 13(11):3207\u20133214","journal-title":"Clin Cancer Res"},{"issue":"2","key":"4275_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron B, Hastie T, Johnstone I, Tibshirani R et al (2004) Least angle regression. Ann stat 32(2):407\u2013499","journal-title":"Ann stat"},{"issue":"2","key":"4275_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1214\/07-AOAS131","volume":"1","author":"J Friedman","year":"2007","unstructured":"Friedman J, Hastie T, H\u00f6fling H, Tibshirani R et al (2007) Pathwise coordinate optimization. Ann Appl Stat 1(2):302\u2013332","journal-title":"Ann Appl Stat"},{"key":"4275_CR14","unstructured":"Ghaoui LE, Viallon V, Rabbani T (2010) Safe feature elimination for the lasso and sparse supervised learning problems. arXiv preprint arXiv:1009.4219 ,"},{"key":"4275_CR15","unstructured":"LeCun Y, Cortes C, Burges CJ (1998) The mnist database of handwritten digits. http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"key":"4275_CR16","unstructured":"Lee H, Battle A, Raina R, Ng AY (2006) Efficient sparse coding algorithms. In: Advances in neural information processing systems, pp 801\u2013808"},{"issue":"11","key":"4275_CR17","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1089\/cmb.2011.0171","volume":"18","author":"W Li","year":"2011","unstructured":"Li W, Feng J, Jiang T (2011) Isolasso: a lasso regression approach to rna-seq based transcriptome assembly. J Comput Biol 18(11):1693\u20131707","journal-title":"J Comput Biol"},{"key":"4275_CR18","unstructured":"Ndiaye E (2018) Safe optimization algorithms for variable selection and hyperparameter tuning, Ph.D. dissertation, Universit\u00e9 Paris-Saclay"},{"key":"4275_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2007","unstructured":"Nesterov Y et al (2007) Gradient methods for minimizing composite objective function. Math Programm 140:125\u2013161","journal-title":"Math Programm"},{"key":"4275_CR20","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.ins.2018.10.031","volume":"477","author":"X Pan","year":"2019","unstructured":"Pan X, Xu Y (2019) A safe reinforced feature screening strategy for lasso based on feasible solutions. Inf Sci 477:132\u2013147","journal-title":"Inf Sci"},{"issue":"19","key":"4275_CR21","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1093\/bioinformatics\/btm344","volume":"23","author":"Y Saeys","year":"2007","unstructured":"Saeys Y, Inza I, Larra\u00f1aga P (2007) A review of feature selection techniques in bioinformatics. Bioinformatics 23(19):2507\u20132517","journal-title":"Bioinformatics"},{"issue":"Jun","key":"4275_CR22","first-page":"1865","volume":"12","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz S, Tewari A (2011) Stochastic methods for l1-regularized loss minimization. J Mach Learn Res 12(Jun):1865\u20131892","journal-title":"J Mach Learn Res"},{"key":"4275_CR23","unstructured":"Shalev-Shwartz S, Zhang T (2014) Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization. In: ICML, pp 64\u201372"},{"key":"4275_CR24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani R (1996) Regression shrinkage and selection via the lasso. J R Stat Soc Ser B Methodol 58:267\u2013288","journal-title":"J R Stat Soc Ser B Methodol"},{"key":"4275_CR25","unstructured":"Wang Y (2015) Feature screening for the lasso, Ph.D. dissertation, Princeton University"},{"key":"4275_CR26","unstructured":"Wang J, Zhou J, Wonka P, Ye J (2013) Lasso screening rules via dual polytope projection. In: Advances in neural information processing systems, pp 1070\u20131078"},{"issue":"7","key":"4275_CR27","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright SJ, Nowak RD, Figueiredo MA (2009) Sparse reconstruction by separable approximation. IEEE Trans Signal Process 57(7):2479\u20132493","journal-title":"IEEE Trans Signal Process"},{"key":"4275_CR28","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1214\/07-AOAS147","volume":"2","author":"TT Wu","year":"2008","unstructured":"Wu TT, Lange K (2008) Coordinate descent algorithms for lasso penalized regression. Ann Appl Stat 2:224\u2013244","journal-title":"Ann Appl Stat"},{"key":"4275_CR29","unstructured":"Xiang ZJ, Ramadge PJ (2012)Fast lasso screening tests based on correlations. In: 2012 IEEE international conference on acoustics, speech and signal processing (ICASSP). IEEE, pp 2137\u20132140"},{"key":"4275_CR30","unstructured":"Xiang ZJ, Xu H, Ramadge PJ (2011) Learning sparse representations of high dimensional data on large scale dictionaries. In: Advances in neural information processing systems, pp 900\u2013908"},{"key":"4275_CR31","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1109\/TPAMI.2016.2568185","volume":"39","author":"ZJ Xiang","year":"2014","unstructured":"Xiang ZJ, Wang Y, Ramadge PJ (2014) Screening tests for lasso problems. IEEE Trans Pattern Anal Mach Intell 39:1008\u20131027","journal-title":"IEEE Trans Pattern Anal Mach Intell"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04275-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04275-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04275-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T15:33:32Z","timestamp":1721662412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04275-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,26]]},"references-count":31,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["4275"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04275-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2019,8,26]]},"assertion":[{"value":"26 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declared that they have no conflicts of interest to this work. We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}