{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T14:36:27Z","timestamp":1772721387517,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:00:00Z","timestamp":1769558400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:00:00Z","timestamp":1769558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12401430"],"award-info":[{"award-number":["12401430"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Middle-aged and Young Teachers\u2019 Basic Ability Promotion Project of Guangxi","award":["2025KY0025"],"award-info":[{"award-number":["2025KY0025"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s11222-026-10828-6","type":"journal-article","created":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T10:59:49Z","timestamp":1769597989000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Safe Feature Identification Rule for Fused Lasso by An Extra Dual Variable"],"prefix":"10.1007","volume":"36","author":[{"given":"Pan","family":"Shang","sequence":"first","affiliation":[]},{"given":"Huangyue","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Lingchen","family":"Kong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,28]]},"reference":[{"issue":"29","key":"10828_CR1","doi-asserted-by":"publisher","first-page":"11878","DOI":"10.1073\/pnas.0901910106","volume":"106","author":"A Ahmed","year":"2009","unstructured":"Ahmed, A., Xing, E.P.: Recovering time-varying networks of dependencies in social and biological studies. Proc. Natl. Acad. Sci. 106(29), 11878\u201311883 (2009). https:\/\/doi.org\/10.1073\/pnas.0901910106","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10828_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-order Methods in Optimization. SIAM, Philadelphia (2017)"},{"key":"10828_CR3","unstructured":"Bao, R., Gu, B., Huang, H.: Fast oscar and owl regression via safe screening rules. In: Proceedings of the 37th International Conference on Machine Learning, pp. 653\u2013663 (2020). PMLR"},{"key":"10828_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125500","volume":"386","author":"H Chen","year":"2020","unstructured":"Chen, H., Kong, L., Shang, P.: Safe feature screening rules for the regularized huber regression. Appl. Math. Comput. 386, 125500 (2020). https:\/\/doi.org\/10.1016\/j.amc.2020.125500","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"10828_CR5","first-page":"10665","volume":"22","author":"CF Dantas","year":"2021","unstructured":"Dantas, C.F., Soubies, E., F\u00e9votte, C.: Expanding boundaries of gap safe screening. J. Mach. Learn. Res. 22(1), 10665\u201310721 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"10828_CR6","volume-title":"Large-scale Inference: Empirical Bayes Methods for Estimation, Testing, and Prediction","author":"B Efron","year":"2012","unstructured":"Efron, B.: Large-scale Inference: Empirical Bayes Methods for Estimation, Testing, and Prediction. Cambridge University Press, Cambridge (2012)"},{"issue":"5","key":"10828_CR7","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1111\/j.1467-9868.2008.00674.x","volume":"70","author":"J Fan","year":"2008","unstructured":"Fan, J., Lv, J.: Sure independence screening for ultrahigh dimensional feature space. J. R. Stat. Soc. Ser. B Stat Methodol. 70(5), 849\u2013911 (2008). https:\/\/doi.org\/10.1111\/j.1467-9868.2008.00674.x","journal-title":"J. R. Stat. Soc. Ser. B Stat Methodol."},{"issue":"4","key":"10828_CR8","first-page":"667","volume":"8","author":"LE Ghaoui","year":"2012","unstructured":"Ghaoui, L.E., Viallon, V., Rabbani, T.: Safe feature elimination in sparse supervised learning. Pacific J. Optim. 8(4), 667\u2013698 (2012)","journal-title":"Pacific J. Optim."},{"issue":"2","key":"10828_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"B He","year":"2012","unstructured":"He, B., Tao, M., Yuan, X.: Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J. Optim. 22(2), 313\u2013340 (2012). https:\/\/doi.org\/10.1137\/110822347","journal-title":"SIAM J. Optim."},{"key":"10828_CR10","volume-title":"Convex Analysis and Minimization Algorithms I: Fundamentals","author":"JB Hiriart-Urruty","year":"2013","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I: Fundamentals. Springer, Berlin Heidelberg (2013)"},{"issue":"121","key":"10828_CR11","first-page":"1","volume":"20","author":"B Hong","year":"2019","unstructured":"Hong, B., Zhang, W., Liu, W.: Scaling up sparse support vector machines by simultaneous feature and sample reduction. J. Mach. Learn. Res. 20(121), 1\u201339 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"10828_CR12","unstructured":"Kuang, Z., Geng, S., Page, D.: A screening rule for $$\\ell _1$$-regularized ising model estimation. Advances in Neural Information Processing Systems 30 (2017)"},{"issue":"6","key":"10828_CR13","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1038\/89044","volume":"7","author":"J Khan","year":"2001","unstructured":"Khan, J., Wei, J.S., Ringner, M.: Classification and diagnostic prediction of cancers using gene expression profiling and artificial neural networks. Nat. Med. 7(6), 673\u2013679 (2001). https:\/\/doi.org\/10.1038\/89044","journal-title":"Nat. Med."},{"issue":"12","key":"10828_CR14","doi-asserted-by":"publisher","first-page":"2841","DOI":"10.1109\/TPAMI.2017.2765321","volume":"40","author":"S Lee","year":"2017","unstructured":"Lee, S., G\u00f6rnitz, N., Xing, E.P.: Ensembles of Lasso screening rules. IEEE Trans. Pattern Anal. Mach. Intell. 40(12), 2841\u20132852 (2017). https:\/\/doi.org\/10.1109\/TPAMI.2017.2765321","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"491","key":"10828_CR15","first-page":"7","volume":"6","author":"J Liu","year":"2009","unstructured":"Liu, J., Ji, S., Ye, J.: SLEP: Sparse learning with efficient projections. Arizona State University 6(491), 7 (2009)","journal-title":"Arizona State University"},{"issue":"9","key":"10828_CR16","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1093\/bioinformatics\/btn081","volume":"24","author":"C Li","year":"2008","unstructured":"Li, C., Li, H.: Network-constrained regularization and variable selection for analysis of genomic data. Bioinformatics 24(9), 1175\u20131182 (2008). https:\/\/doi.org\/10.1093\/bioinformatics\/btn081","journal-title":"Bioinformatics"},{"issue":"2","key":"10828_CR17","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/17M1136390","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., Toh, K.-C.: On efficiently solving the subproblems of a level-set method for fused Lasso problems. SIAM J. Optim. 28(2), 1842\u20131866 (2018). https:\/\/doi.org\/10.1137\/17M1136390","journal-title":"SIAM J. Optim."},{"key":"10828_CR18","doi-asserted-by":"publisher","unstructured":"Liu, J., Yuan, L., Ye, J.: An efficient algorithm for a class of fused Lasso problems. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 323\u2013332 (2010). https:\/\/doi.org\/10.1145\/1835804.1835847","DOI":"10.1145\/1835804.1835847"},{"issue":"1","key":"10828_CR19","first-page":"4671","volume":"18","author":"E Ndiaye","year":"2017","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A.: Gap safe screening rules for sparsity enforcing penalties. J. Mach. Learn. Res. 18(1), 4671\u20134703 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"10828_CR20","unstructured":"Ouyang, H., He, N., Tran, L., : Stochastic alternating direction method of multipliers. In: Proceedings of the 30th International Conference on Machine Learning, pp. 80\u201388 (2013). PMLR"},{"issue":"8","key":"10828_CR21","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1109\/TNNLS.2018.2879800","volume":"30","author":"X Pan","year":"2018","unstructured":"Pan, X., Xu, Y.: A novel and safe two-stage screening method for support vector machine. IEEE Trans. Neural Netw. Learn. Syst. 30(8), 2263\u20132274 (2018). https:\/\/doi.org\/10.1109\/TNNLS.2018.2879800","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"9","key":"10828_CR22","doi-asserted-by":"publisher","first-page":"4544","DOI":"10.1109\/TPAMI.2021.3071138","volume":"44","author":"X Pan","year":"2021","unstructured":"Pan, X., Xu, Y.: A safe feature elimination rule for $$l_{1}$$-regularized logistic regression. IEEE Trans. Pattern Anal. Mach. Intell. 44(9), 4544\u20134554 (2021). https:\/\/doi.org\/10.1109\/TPAMI.2021.3071138","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10828_CR23","unstructured":"Rakotomamonjy, A., Gasso, G., Salmon, J.: Screening rules for Lasso with non-convex sparse regularizers. In: Proceedings of the 36th International Conference on Machine Learning, pp. 5341\u20135350 (2019). PMLR"},{"issue":"12","key":"10828_CR24","doi-asserted-by":"publisher","first-page":"2992","DOI":"10.1109\/TPAMI.2017.2776267","volume":"40","author":"S Ren","year":"2018","unstructured":"Ren, S., Huang, S., Ye, J.: Safe feature screening for generalized Lasso. IEEE Trans. Pattern Anal. Mach. Intell. 40(12), 2992\u20133006 (2018). https:\/\/doi.org\/10.1109\/TPAMI.2017.2776267","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10828_CR25","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, New Jersey (1970)"},{"issue":"10","key":"10828_CR26","doi-asserted-by":"publisher","first-page":"6254","DOI":"10.1109\/TPAMI.2021.3087160","volume":"44","author":"P Shang","year":"2022","unstructured":"Shang, P., Kong, L.: $$\\ell _{1}$$-norm quantile regression screening rule via the dual circumscribed sphere. IEEE Trans. Pattern Anal. Mach. Intell. 44(10), 6254\u20136263 (2022). https:\/\/doi.org\/10.1109\/TPAMI.2021.3087160","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10828_CR27","unstructured":"Shibagaki, A., Karasuyama, M., Hatano, K., : Simultaneous safe screening of features and samples in doubly sparse modeling. In: Proceedings of the 33rd International Conference on Machine Learning, pp. 1577\u20131586 (2016). PMLR"},{"key":"10828_CR28","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1109\/LSP.2022.3167918","volume":"29","author":"P Shang","year":"2022","unstructured":"Shang, P., Kong, L., Liu, D.: A safe feature screening rule for rank Lasso. IEEE Signal Process. Lett. 29, 1062\u20131066 (2022). https:\/\/doi.org\/10.1109\/LSP.2022.3167918","journal-title":"IEEE Signal Process. Lett."},{"issue":"2","key":"10828_CR29","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1111\/j.1467-9868.2011.01004.x","volume":"74","author":"R Tibshirani","year":"2012","unstructured":"Tibshirani, R., Bien, J., Friedman, J.: Strong rules for discarding predictors in Lasso-type problems. J. R. Stat. Soc. Ser. B Stat Methodol. 74(2), 245\u2013266 (2012). https:\/\/doi.org\/10.1111\/j.1467-9868.2011.01004.x","journal-title":"J. R. Stat. Soc. Ser. B Stat Methodol."},{"issue":"1","key":"10828_CR30","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"Tibshirani, R., Saunders, M., Rosset, S.: Sparsity and smoothness via the fused Lasso. J. R. Stat. Soc. Ser. B Stat Methodol. 67(1), 91\u2013108 (2005). https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00490.x","journal-title":"J. R. Stat. Soc. Ser. B Stat Methodol."},{"issue":"9","key":"10828_CR31","doi-asserted-by":"publisher","first-page":"1806","DOI":"10.1109\/TPAMI.2014.2388203","volume":"37","author":"J Wang","year":"2015","unstructured":"Wang, J., Fan, W., Ye, J.: Fused Lasso screening rules via the monotonicity of subdifferentials. IEEE Trans. Pattern Anal. Mach. Intell. 37(9), 1806\u20131820 (2015). https:\/\/doi.org\/10.1109\/TPAMI.2014.2388203","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"15","key":"10828_CR32","doi-asserted-by":"publisher","first-page":"4043","DOI":"10.1109\/TSP.2019.2924580","volume":"67","author":"H Wang","year":"2019","unstructured":"Wang, H., Pan, X., Xu, Y.: Simultaneous safe feature and sample elimination for sparse support vector regression. IEEE Trans. Signal Process. 67(15), 4043\u20134054 (2019). https:\/\/doi.org\/10.1109\/TSP.2019.2924580","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"10828_CR33","first-page":"1063","volume":"16","author":"J Wang","year":"2015","unstructured":"Wang, J., Wonka, P., Ye, J.: Lasso screening rules via dual polytope projection. J. Mach. Learn. Res. 16(1), 1063\u20131101 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"10828_CR34","unstructured":"Wang, J., Wonka, P., Ye, J.: Scaling svm and least absolute deviations via exact data reduction. In: Proceedings of the 31st International Conference on Machine Learning, pp. 523\u2013531 (2014). PMLR"},{"issue":"163","key":"10828_CR35","first-page":"1","volume":"20","author":"J Wang","year":"2019","unstructured":"Wang, J., Zhang, Z., Ye, J.: Two-layer feature reduction for sparse-group Lasso via decomposition of convex sets. J. Mach. Learn. Res. 20(163), 1\u201342 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"10828_CR36","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/s10489-018-1295-y","volume":"49","author":"Y Xu","year":"2019","unstructured":"Xu, Y., Tian, Y., Pan, X.: E-ENDPP: A safe feature selection rule for speeding up elastic net. Appl. Intell. 49, 592\u2013604 (2019). https:\/\/doi.org\/10.1007\/s10489-018-1295-y","journal-title":"Appl. Intell."},{"key":"10828_CR37","doi-asserted-by":"publisher","unstructured":"Xiang, Z.J., Wang, Y., Ramadge, P.J.: Screening tests for Lasso problems. IEEE Trans. Pattern Anal. Mach. Intell. 39(5), 1008\u20131027 (2016). https:\/\/doi.org\/10.1109\/TPAMI.2016.2568185","DOI":"10.1109\/TPAMI.2016.2568185"},{"issue":"1","key":"10828_CR38","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TIP.2011.2160072","volume":"21","author":"M Zhou","year":"2012","unstructured":"Zhou, M., Chen, H., Paisley, J.: Nonparametric bayesian dictionary learning for analysis of noisy and incomplete images. IEEE Trans. Image Process. 21(1), 130\u2013144 (2012). https:\/\/doi.org\/10.1109\/TIP.2011.2160072","journal-title":"IEEE Trans. Image Process."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-026-10828-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-026-10828-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-026-10828-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T13:26:05Z","timestamp":1772717165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-026-10828-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,28]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["10828"],"URL":"https:\/\/doi.org\/10.1007\/s11222-026-10828-6","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,28]]},"assertion":[{"value":"28 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"Our implementation is available at\n                      \n                      .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"76"}}