{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T15:08:22Z","timestamp":1771340902494,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T00:00:00Z","timestamp":1627689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T00:00:00Z","timestamp":1627689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"US Department of Energy"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s42979-021-00788-1","type":"journal-article","created":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T06:02:58Z","timestamp":1627711378000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Backward Stepwise Elimination: Approximation Guarantee, a Batched GPU Algorithm, and Empirical Investigation"],"prefix":"10.1007","volume":"2","author":[{"given":"Benjamin","family":"Sauk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2087-9131","authenticated-orcid":false,"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"788_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(97)00115-1","volume":"209","author":"E Amaldi","year":"1998","unstructured":"Amaldi, E., Kann, V.: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theoretical Computer Science 209, 237\u2013260 (1998).","journal-title":"Theoret Comput Sci"},{"key":"788_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK users\u2019 guide","author":"E Anderson","year":"1999","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, L.S., Demmel, J., Dongarra, J., Croz, J.D., Hammarling, S., Greenbaum, A., McKenney, A., Sorensen, D.: LAPACK Users\u2019 Guide (Third ed.). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1999).","edition":"3"},{"key":"788_CR3","first-page":"46","volume":"72","author":"R Bendel","year":"1977","unstructured":"Bendel, R., Afifi, A.: Comparison of stopping rules in forward \u201cstepwise\u201d regression. Journal of the American Statistical Association 72, 46\u201353 (1977).","journal-title":"J Am Stat Assoc"},{"key":"788_CR4","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. The Annals of Statistics 44, 813\u2013852 (2016).","journal-title":"Ann Stat"},{"key":"788_CR5","first-page":"555","volume":"35","author":"D Bertsimas","year":"2020","unstructured":"Bertsimas, D., Pauphilet, J., Parys, B.V.: Sparse regression: Scalable algorithms and empirical performance. Statistical Science 35, 555\u2013578 (2020).","journal-title":"Stat Sci"},{"key":"788_CR6","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1137\/S089547989222895X","volume":"15","author":"A Bj\u00f6rck","year":"1994","unstructured":"Bj\u00f6rck, A., Park, H., Eld\u00e9n, L.: Accurate downdating of least squares solutions. SIAM Journal Matrix Analysis and Applications 15, 549\u2013568 (1994).","journal-title":"SIAM J Matrix Anal Appl"},{"key":"788_CR7","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S0895479898332928","volume":"21","author":"C Couvreur","year":"2000","unstructured":"Couvreur, C., Bresler, Y.: On the optimality of the backward greedy algorithm for the subset selection problem. SIAM Journal on Matrix Analysis and Applications 21, 797\u2013808 (2000).","journal-title":"SIAM J Matrix Anal Appl"},{"key":"788_CR8","doi-asserted-by":"publisher","first-page":"2211","DOI":"10.1002\/aic.14418","volume":"60","author":"A Cozad","year":"2014","unstructured":"Cozad, A., Sahinidis, N.V., Miller, D.C.: Automatic learning of algebraic models for optimization. AIChE Journal 60, 2211\u20132227 (2014).","journal-title":"AIChE J"},{"key":"788_CR9","first-page":"74","volume":"19","author":"A Das","year":"2018","unstructured":"Das, A., Kempe, D.: Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection. The Journal of Machine Learning Research 19, 74\u2013107 (2018).","journal-title":"J Mach Learn Res"},{"key":"788_CR10","unstructured":"Dong T, Haidar A, Luszczek P, Tomov S, Abdelfattah A, Dongarra J. MAGMA batched: a batched BLAS approach for small matrix factorizations and applications on GPUs. Tech. rep., Technical Report (2016)."},{"key":"788_CR11","first-page":"191","volume-title":"Mathematical methods for digital computers","author":"M Efroymson","year":"1960","unstructured":"Efroymson, M.: Multiple regression analysis. In A. Ralston and H.S. Wilf (eds.), Mathematical Methods for Digital Computers, Wiley, New York pp. 191\u2013203 (1960)."},{"key":"788_CR12","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1080\/00401706.1974.10489231","volume":"16","author":"G Furnival","year":"1974","unstructured":"Furnival, G., Wilson, R.: Regressions by leaps and bounds. Technometrics 16, 499\u2013511 (1974).","journal-title":"Technometrics"},{"key":"788_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1198\/106186006X100290","volume":"15","author":"C Gatu","year":"2006","unstructured":"Gatu, C., Kontoghiorghes, E.J.: Branch-and-bound algorithms for computing the best-subset regression models. Journal of Computational and Graphical Statistics 15, 139\u2013156 (2006).","journal-title":"J Comput Graph Stat"},{"key":"788_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s11222-012-9318-8","volume":"23","author":"C Gatu","year":"2013","unstructured":"Gatu, C., Kontoghiorghes, E.J.: A fast algorithm for non-negativity model selection. Statistics and Computing 23, 403\u2013411 (2013).","journal-title":"Stat Comput"},{"key":"788_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1177\/1094342014567546","volume":"29","author":"A Haidar","year":"2015","unstructured":"Haidar, A., Dong, T., Luszczek, P., Tomov, S., Dongarra, J.: Batched matrix computations on hardware accelerators based on GPUs. The International Journal of High Performance Computing Applications 29, 193\u2013208 (2015).","journal-title":"Int J High Perform Comput Appl"},{"key":"788_CR16","first-page":"579","volume":"35","author":"T Hastie","year":"2020","unstructured":"Hastie, T., Tibshirani, R., Tibshirani, R.J.: Best subset, forward stepwise or lasso? Analysis and recommendations based on extensive comparisons. Statistical Science 35, 579\u2013592 (2020).","journal-title":"Stat Sci"},{"key":"788_CR17","unstructured":"ICL. MAGMA. 2020. http:\/\/icl.cs.utk.edu\/projectsfiles\/magma\/doxygen\/. Accessed Feb 2020."},{"key":"788_CR18","doi-asserted-by":"crossref","unstructured":"Karaca O, Kamgarpour M. Exploiting weak supermodularity for coalition-proof mechanisms. In: Proceedings 2018 IEEE Conference on decision and control (CDC), IEEE, Miami Beach, FL, 2018; p. 1118\u2013123.","DOI":"10.1109\/CDC.2018.8619337"},{"key":"788_CR19","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi, R., John, G.: Wrappers for feature subset selection. Artificial intelligence 97, 273\u2013324 (1997).","journal-title":"Artif Intell"},{"key":"788_CR20","unstructured":"Liberty, E., Sviridenko, M.: Greedy minimization of weakly supermodular set functions. In: Jansen, K., Rolim, J., Williamson, D., Vempala, S. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), pp. 19:1\u201319:11 (2017)."},{"key":"788_CR21","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1080\/00401706.1970.10488701","volume":"12","author":"N Mantel","year":"1970","unstructured":"Mantel, N.: Why stepdown procedures in variable selection. Technometrics 12, 621\u2013625 (1970).","journal-title":"Technometrics"},{"key":"788_CR22","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.csda.2006.12.019","volume":"52","author":"N Meinshausen","year":"2007","unstructured":"Meinshausen, N.: Relaxed lasso. Computational Statistics & Data Analysis 52, 374\u2013393 (2007).","journal-title":"Comput Stat Data Anal"},{"key":"788_CR23","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035933","volume-title":"Subset selection in regression","author":"A Miller","year":"2002","unstructured":"Miller, A.: Subset selection in regression. CRC Press, Boca Roton (2002)."},{"key":"788_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of approximations for maximizing submodular set functions-I. Mathematical Programming 14, 265\u2013294 (1978).","journal-title":"Math Program"},{"key":"788_CR25","unstructured":"NVIDIA Corporation: cuBLAS. 2020. https:\/\/docs.nvidia.com\/cuda\/cublas\/index.html. Accessed Feb 2020."},{"key":"788_CR26","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1057\/jt.2009.26","volume":"18","author":"B Ratner","year":"2010","unstructured":"Ratner, B.: Variable selection methods in regression: Ignorable problem, outing notable solution. Journal of Targeting, Measurement and Analysis for Marketing 18, 65\u201375 (2010).","journal-title":"J Target Meas Anal Mark"},{"key":"788_CR27","unstructured":"Sakaue S. Weak supermodularity assists submodularity-based approaches to non-convex constrained optimization. Arxiv preprint arXiv pp. 1\u201326 (2019)."},{"key":"788_CR28","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1214\/20-STS806","volume":"35","author":"O Sarwar","year":"2020","unstructured":"Sarwar, O., Sauk, B., Sahinidis, N.V.: A discussion on practical considerations with sparse regression methodologies. Statistical Science 35, 593\u2013601 (2020).","journal-title":"Stat Sci"},{"key":"788_CR29","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11222-007-9048-5","volume":"18","author":"W Sauerbrei","year":"2008","unstructured":"Sauerbrei, W., Holl\u00e4nder, N., Buchholz, A.: Investigation about a screening step in model selection. Statistics and Computing 18, 195\u2013208 (2008).","journal-title":"Stat Comput"},{"key":"788_CR30","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1080\/10556788.2018.1527331","volume":"35","author":"B Sauk","year":"2020","unstructured":"Sauk, B., Ploskas, N., Sahinidis, N.V.: GPU paramter tuning for tall and skinny dense linear least squares problems. Optimization Methods and Software 35, 638\u2013660 (2020).","journal-title":"Optim Methods Softw"},{"key":"788_CR31","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.: Regression shrinkage and selection via the lasso. Royal Statistical Society 58, 267\u2013288 (1996).","journal-title":"R Stat Soc"},{"key":"788_CR32","first-page":"1265","volume":"25","author":"R Tibshirani","year":"2015","unstructured":"Tibshirani, R.: Degrees of freedom and model search. Statistica Sinica 25, 1265\u20131296 (2015).","journal-title":"Stat Sin"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00788-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-021-00788-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00788-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:29:16Z","timestamp":1725546556000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-021-00788-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,31]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["788"],"URL":"https:\/\/doi.org\/10.1007\/s42979-021-00788-1","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,31]]},"assertion":[{"value":"17 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"396"}}