{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T10:10:09Z","timestamp":1758881409492,"version":"3.44.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032060952","type":"print"},{"value":"9783032060969","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T00:00:00Z","timestamp":1758931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T00:00:00Z","timestamp":1758931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-06096-9_7","type":"book-chapter","created":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T09:54:22Z","timestamp":1758880462000},"page":"113-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Proximal Gradient Methods with\u00a0Node Pruning for\u00a0Tree-Structured Sparse Regularization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4279-9503","authenticated-orcid":false,"given":"Yasutoshi","family":"Ida","sequence":"first","affiliation":[]},{"given":"Sekitoshi","family":"Kanai","sequence":"additional","affiliation":[]},{"given":"Atsutoshi","family":"Kumagai","sequence":"additional","affiliation":[]},{"given":"Tomoharu","family":"Iwata","sequence":"additional","affiliation":[]},{"given":"Yasuhiro","family":"Fujiwara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,27]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A Argyriou","year":"2008","unstructured":"Argyriou, A., Evgeniou, T., Pontil, M.: Convex multi-task feature learning. Mach. Learn. 73(3), 243\u2013272 (2008)","journal-title":"Mach. Learn."},{"issue":"11","key":"7_CR2","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TIP.2009.2028250","volume":"18","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. Trans. Imging. Proc. 18(11), 2419\u20132434 (2009)","journal-title":"Trans. Imging. Proc."},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging. Sci."},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1214\/11-AOAS514","volume":"6","author":"X Chen","year":"2012","unstructured":"Chen, X., Lin, Q., Kim, S., Carbonell, J.G., Xing, E.P.: Smoothing proximal gradient method for general structured sparse regression. Ann. Appl. Stat. 6(2), 719\u2013752 (2012)","journal-title":"Ann. Appl. Stat."},{"issue":"1\u20132","key":"7_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-013-0653-0","volume":"145","author":"Y Drori","year":"2014","unstructured":"Drori, Y., Teboulle, M.: Performance of first-order methods for smooth convex minimization: a novel approach. Math. Program. 145(1\u20132), 451\u2013482 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.14778\/3021924.3021938","volume":"10","author":"Y Fujiwara","year":"2016","unstructured":"Fujiwara, Y., Ida, Y., Arai, J., Nishimura, M., Iwamura, S.: Fast algorithm for the lasso based L1-graph construction. Proc. VLDB Endow. 10(3), 229\u2013240 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Ida, Y., Shiokawa, H., Iwamura, S.: Fast lasso algorithm via selective coordinate descent. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 1561\u20131567 (2016)","DOI":"10.1609\/aaai.v30i1.10232"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11220-020-00309-z","volume":"21","author":"ES Helou","year":"2020","unstructured":"Helou, E.S., Zibetti, M.V.W., Herman, G.T.: Fast proximal gradient methods for nonsmooth convex optimization for tomographic image reconstruction. Sens. Imaging 21(1), 1\u201331 (2020). https:\/\/doi.org\/10.1007\/s11220-020-00309-z","journal-title":"Sens. Imaging"},{"key":"7_CR9","unstructured":"Ida, Y., Fujiwara, Y., Kashima, H.: Fast sparse group lasso. In: Advances in Neural Information Processing Systems (NeurIPS), pp. 1702\u20131710 (2019)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Ida, Y., Kanai, S., Adachi, K., Kumagai, A., Fujiwara, Y.: Fast regularized discrete optimal transport with group-sparse regularizers. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 7980\u20137987 (2023)","DOI":"10.1609\/aaai.v37i7.25965"},{"key":"7_CR11","unstructured":"Ida, Y., Kanai, S., Fujiwara, Y., Iwata, T., Takeuchi, K., Kashima, H.: Fast deterministic CUR matrix decomposition with accuracy assurance. In: Proceedings of International Conference on Machine Learning (ICML), pp. 4594\u20134603 (2020)"},{"key":"7_CR12","unstructured":"Ida, Y., Kanai, S., Kumagai, A.: Fast block coordinate descent for non-convex group regularizations. In: International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 2481\u20132493 (2023)"},{"key":"7_CR13","unstructured":"Ida, Y., Kanai, S., Kumagai, A., Iwata, T., Fujiwara, Y.: Fast iterative hard thresholding methods with pruning gradient computations. In: Advances in Neural Information Processing Systems (NeurIPS), pp. 52836\u201352857 (2024)"},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/110832380","volume":"5","author":"A Gramfort","year":"2012","unstructured":"Gramfort, A., et al.: Multiscale mining of fMRI data with hierarchical structured sparsity. SIAM J. Imaging. Sci. 5(3), 835\u2013856 (2012)","journal-title":"SIAM J. Imaging. Sci."},{"key":"7_CR15","unstructured":"Jenatton, R., Mairal, J., Obozinski, G., Bach, F.: Proximal methods for sparse hierarchical dictionary learning. In: International Conference on Machine Learning (ICML), pp. 487\u2013494 (2010)"},{"issue":"67","key":"7_CR16","first-page":"2297","volume":"12","author":"R Jenatton","year":"2011","unstructured":"Jenatton, R., Mairal, J., Obozinski, G., Bach, F.: Proximal methods for hierarchical sparse coding. J. Mach. Learn. Res. (JMLR) 12(67), 2297\u20132334 (2011)","journal-title":"J. Mach. Learn. Res. (JMLR)"},{"issue":"3","key":"7_CR17","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1175\/1520-0477(1996)077<0437:TNYRP>2.0.CO;2","volume":"77","author":"E Kalnay","year":"1996","unstructured":"Kalnay, E., et al.: The NCEP\/NCAR 40-year reanalysis project. Bull. Am. Meteor. Soc. 77(3), 437\u2013472 (1996)","journal-title":"Bull. Am. Meteor. Soc."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Kim, D., Fessler, J.A.: An optimized first-order method for image restoration. In: IEEE International Conference on Image Processing (ICIP), pp. 3675\u20133679 (2015)","DOI":"10.1109\/ICIP.2015.7351490"},{"key":"7_CR19","unstructured":"Kim, S., Xing, E.P.: Tree-guided group lasso for multi-task regression with structured sparsity. In: International Conference on Machine Learning (ICML), pp. 543\u2013550 (2010)"},{"issue":"3","key":"7_CR20","doi-asserted-by":"publisher","first-page":"A1069","DOI":"10.1137\/21M1395685","volume":"44","author":"J Liang","year":"2022","unstructured":"Liang, J., Luo, T., Sch\u00f6nlieb, C.B.: Improving \u201cfast iterative shrinkage-thresholding algorithm\u2019\u2019: faster, smarter, and greedier. SIAM J. Sci. Comput. 44(3), A1069\u2013A1091 (2022)","journal-title":"SIAM J. Sci. Comput."},{"key":"7_CR21","unstructured":"Liu, J., Ye, J.: Moreau-Yosida Regularization for Grouped Tree Structure Learning. In: Advances in Neural Information Processing Systems (NeurIPS), pp. 1459\u20131467 (2010)"},{"issue":"4","key":"7_CR22","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1109\/TITS.2016.2598356","volume":"18","author":"X Lu","year":"2017","unstructured":"Lu, X., Wang, Y., Zhou, X., Zhang, Z., Ling, Z.: Traffic sign recognition via multi-modal tree-structure embedded multi-task learning. IEEE Trans. Intell. Transp. Syst. 18(4), 960\u2013972 (2017)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"1","key":"7_CR23","first-page":"4671","volume":"18","author":"E Ndiaye","year":"2017","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A., Salmon, J.: Gap safe screening rules for sparsity enforcing penalties. J. Mach. Learn. Res. (JMLR) 18(1), 4671\u20134703 (2017)","journal-title":"J. Mach. Learn. Res. (JMLR)"},{"key":"7_CR24","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $$\\cal{O} (1\/k^2)$$. Proc. USSR Acad. Sci. 269, 543\u2013547 (1983)","journal-title":"Proc. USSR Acad. Sci."},{"issue":"3","key":"7_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"issue":"3","key":"7_CR26","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1137\/16M108104X","volume":"27","author":"AB Taylor","year":"2017","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case performance of first-order methods for composite convex optimization. SIAM J. Optim. 27(3), 1283\u20131313 (2017)","journal-title":"SIAM J. Optim."},{"key":"7_CR27","doi-asserted-by":"publisher","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. J. Roy. Stat. Soc. 58, 267\u2013288 (1996)","journal-title":"J. Roy. Stat. Soc."},{"issue":"2","key":"7_CR28","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., et al.: Strong rules for discarding predictors in lasso-type problems. J. Roy. Stat. Soc. B 74(2), 245\u2013266 (2012)","journal-title":"J. Roy. Stat. Soc. B"},{"key":"7_CR29","series-title":"Classics in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61859-8","volume-title":"Functional Analysis","author":"K Yosida","year":"1995","unstructured":"Yosida, K.: Functional Analysis. CM, vol. 123. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/978-3-642-61859-8"},{"issue":"1","key":"7_CR30","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. Roy. Stat. Soc. 68(1), 49\u201367 (2006)","journal-title":"J. Roy. Stat. Soc."},{"key":"7_CR31","unstructured":"Zhao, P., Rocha, G., Yu, B.: Grouped and hierarchical model selection through composite absolute penalties. Department of Statistics, UC Berkeley, Tech. Rep., vol. 37 (2006)"},{"issue":"6A","key":"7_CR32","doi-asserted-by":"publisher","first-page":"3468","DOI":"10.1214\/07-AOS584","volume":"37","author":"P Zhao","year":"2009","unstructured":"Zhao, P., Rocha, G., Yu, B.: The composite absolute penalties family for grouped and hierarchical variable selection. Ann. Stat. 37(6A), 3468\u20133497 (2009)","journal-title":"Ann. Stat."},{"key":"7_CR33","doi-asserted-by":"publisher","DOI":"10.21236\/ADA473146","volume-title":"Boosted Lasso","author":"P Zhao","year":"2004","unstructured":"Zhao, P., Yu, B.: Boosted Lasso. Statistics Department, University of California, Berkeley, Tech. rep. (2004)"},{"key":"7_CR34","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TCI.2018.2882681","volume":"5","author":"MVW Zibetti","year":"2019","unstructured":"Zibetti, M.V.W., Helou, E.S., Regatte, R.R., Herman, G.T.: Monotone FISTA with variable acceleration for compressed sensing magnetic resonance imaging. IEEE Trans. Comput. Imaging 5, 109\u2013119 (2019)","journal-title":"IEEE Trans. Comput. Imaging"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06096-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T09:54:28Z","timestamp":1758880468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06096-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,27]]},"ISBN":["9783032060952","9783032060969"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06096-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,27]]},"assertion":[{"value":"27 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecmlpkdd.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}