{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T05:44:41Z","timestamp":1785908681801,"version":"3.56.0"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571290"],"award-info":[{"award-number":["12571290"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["SWU-KU24002"],"award-info":[{"award-number":["SWU-KU24002"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.knosys.2026.116329","type":"journal-article","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:43:05Z","timestamp":1780674185000},"page":"116329","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Distributed algorithm for best subset selection in smoothed quantile regression"],"prefix":"10.1016","volume":"348","author":[{"given":"Jing","family":"Lv","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaohui","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2026.116329_b1","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1080\/10618600.2000.10474866","article-title":"Quantile regression via an MM algorithm","volume":"9","author":"Hunter","year":"2000","journal-title":"J. Comput. Graph. Statist."},{"key":"10.1016\/j.knosys.2026.116329_b2","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1214\/10-AOS827","article-title":"\u21131-penalized quantile regression in high-dimensional sparse models","volume":"39","author":"Belloni","year":"2011","journal-title":"Ann. Statist."},{"key":"10.1016\/j.knosys.2026.116329_b3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s13042-011-0031-2","article-title":"Gradient descent algorithms for quantile regression with smooth approximation","volume":"2","author":"Zheng","year":"2011","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"10.1016\/j.knosys.2026.116329_b4","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1080\/10618600.2016.1256816","article-title":"Semismooth Newton coordinate descent algorithm for elastic-net penalized Huber loss regression and quantile regression","volume":"26","author":"Yi","year":"2017","journal-title":"J. Comput. Graph. Statist."},{"key":"10.1016\/j.knosys.2026.116329_b5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/00401706.2017.1345703","article-title":"ADMM for high-dimensional sparse penalized quantile regression","volume":"60","author":"Gu","year":"2018","journal-title":"Technometrics"},{"key":"10.1016\/j.knosys.2026.116329_b6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v094.i04","article-title":"BeSS: an R package for best subset selection in linear, logistic and cox proportional hazards models","volume":"94","author":"Wen","year":"2020","journal-title":"J. Stat. Softw."},{"key":"10.1016\/j.knosys.2026.116329_b7","first-page":"1","article-title":"A constructive approach to \u21130 penalized regression","volume":"19","author":"Huang","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.knosys.2026.116329_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.spl.2020.108925","article-title":"Fitting sparse linear models under the sufficient and necessary condition for model identification","volume":"168","author":"Huang","year":"2021","journal-title":"Statist. Probab. Lett."},{"key":"10.1016\/j.knosys.2026.116329_b9","doi-asserted-by":"crossref","first-page":"2762","DOI":"10.1287\/ijoc.2022.1208","article-title":"\u21130-regularized learning for high-dimensional additive hazards regression","volume":"34","author":"Zheng","year":"2022","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.knosys.2026.116329_b10","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1109\/TSP.2016.2630028","article-title":"Group sparse recovery via the \u21130(\u21132) penalty: Theory and algorithm","volume":"65","author":"Jiao","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.knosys.2026.116329_b11","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/ijoc.2022.1241","article-title":"A splicing approach to best subset of groups selection","volume":"35","author":"Zhang","year":"2023","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.knosys.2026.116329_b12","doi-asserted-by":"crossref","first-page":"33117","DOI":"10.1073\/pnas.2014241117","article-title":"A polynomial algorithm for best-subset selection problem","volume":"117","author":"Zhu","year":"2020","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/j.knosys.2026.116329_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2023.110024","article-title":"\u21130 Regularized logistic regression for large-scale data","volume":"146","author":"Ming","year":"2024","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.knosys.2026.116329_b14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s11222-023-10302-7","article-title":"Communication-efficient estimation for distributed subset selection","volume":"33","author":"Chen","year":"2023","journal-title":"Stat. Comput."},{"key":"10.1016\/j.knosys.2026.116329_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2023.111309","article-title":"A fast robust best subset regression","volume":"284","author":"Ming","year":"2024","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.116329_b16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s11222-025-10588-9","article-title":"Robust \u21132,0-penalized rank regression for high-dimensional group selection","volume":"35","author":"Lv","year":"2025","journal-title":"Stat. Comput."},{"key":"10.1016\/j.knosys.2026.116329_b17","first-page":"3321","article-title":"Communication-efficient algorithms for statistical optimization","volume":"14","author":"Zhang","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.knosys.2026.116329_b18","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1080\/01621459.2018.1429274","article-title":"Communication-efficient distributed statistical inference","volume":"114","author":"Jordan","year":"2019","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/j.knosys.2026.116329_b19","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1080\/10618600.2021.1923517","article-title":"Least-square approximation for a distributed system","volume":"30","author":"Zhu","year":"2021","journal-title":"J. Comput. Graph. Statist."},{"key":"10.1016\/j.knosys.2026.116329_b20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1093\/biomet\/asab007","article-title":"Heterogeneity-aware and communication-efficient distributed statistical inference","volume":"109","author":"Duan","year":"2022","journal-title":"Biometrika"},{"key":"10.1016\/j.knosys.2026.116329_b21","first-page":"1","article-title":"Debiased distributed learning for sparse partial linear models in high dimensions","volume":"23","author":"Lv","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.knosys.2026.116329_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.124177","article-title":"Distributed non-convex regularization for generalized linear regression","volume":"252","author":"Sun","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.knosys.2026.116329_b23","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1016\/j.datak.2006.06.017","article-title":"Regression analysis for massive datasets","volume":"61","author":"Fan","year":"2007","journal-title":"Data Knowl. Eng."},{"key":"10.1016\/j.knosys.2026.116329_b24","doi-asserted-by":"crossref","first-page":"3244","DOI":"10.1214\/18-AOS1777","article-title":"Quantile regression under memory constraint","volume":"47","author":"Chen","year":"2019","journal-title":"Ann. Statist."},{"key":"10.1016\/j.knosys.2026.116329_b25","doi-asserted-by":"crossref","first-page":"2658","DOI":"10.1080\/01621459.2022.2070070","article-title":"Rank-based greedy model averaging for high-dimensional survival data","volume":"118","author":"He","year":"2023","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/j.knosys.2026.116329_b26","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.jeconom.2019.04.013","article-title":"On the predictive risk in misspecified quantile regression","volume":"213","author":"Giessing","year":"2019","journal-title":"J. Econometrics"},{"key":"10.1016\/j.knosys.2026.116329_b27","article-title":"Distributed algorithm for best subset regression","volume":"227","author":"Ming","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.knosys.2026.116329_b28","first-page":"1","article-title":"Distributed high-dimensional regression under a quantile loss function","volume":"21","author":"Chen","year":"2020","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"10.1016\/j.knosys.2026.116329_b29","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1111\/j.1467-9868.2008.00674.x","article-title":"Sure independence screening for ultrahigh dimensional feature space","volume":"70","author":"Fan","year":"2008","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"10.1016\/j.knosys.2026.116329_b30","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/s11222-024-10438-0","article-title":"Group sparse structural smoothing recovery model, statistical properties and algorithm","volume":"34","author":"Tan","year":"2024","journal-title":"Stat. Comput."},{"issue":"488","key":"10.1016\/j.knosys.2026.116329_b31","doi-asserted-by":"crossref","first-page":"1512","DOI":"10.1198\/jasa.2008.tm08516","article-title":"Forward regression for ultra-high dimensional variable screening","volume":"104","author":"Wang","year":"2009","journal-title":"J. Amer. Statist. Assoc."}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126010555?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126010555?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T04:47:59Z","timestamp":1785905279000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126010555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":31,"alternative-id":["S0950705126010555"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116329","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Distributed algorithm for best subset selection in smoothed quantile regression","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116329","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116329"}}