{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:34:18Z","timestamp":1776886458378,"version":"3.51.2"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030865221","type":"print"},{"value":"9783030865238","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-86523-8_31","type":"book-chapter","created":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T06:05:16Z","timestamp":1631253916000},"page":"510-526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotic Statistical Analysis of Sparse Group LASSO via Approximate Message Passing"],"prefix":"10.1007","author":[{"given":"Kan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqi","family":"Bu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,11]]},"reference":[{"key":"31_CR1","unstructured":"Bayati, M., Erdogdu, M.A., Montanari, A.: Estimating lasso risk and noise level. In: Advances in Neural Information Processing Systems, pp. 944\u2013952 (2013)"},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1214\/14-AAP1010","volume":"25","author":"M Bayati","year":"2015","unstructured":"Bayati, M., Lelarge, M., Montanari, A., et al.: Universality in polytope phase transitions and message passing algorithms. Ann. Appl. Probab. 25(2), 753\u2013822 (2015)","journal-title":"Ann. Appl. Probab."},{"issue":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1109\/TIT.2010.2094817","volume":"57","author":"M Bayati","year":"2011","unstructured":"Bayati, M., Montanari, A.: The dynamics of message passing on dense graphs, with applications to compressed sensing. IEEE Trans. Inf. Theory 57(2), 764\u2013785 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1109\/TIT.2011.2174612","volume":"58","author":"M Bayati","year":"2011","unstructured":"Bayati, M., Montanari, A.: The lasso risk for gaussian matrices. IEEE Trans. Inf. Theory 58(4), 1997\u20132017 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"31_CR5","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. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"31_CR6","unstructured":"Berthier, R., Montanari, A., Nguyen, P.M.: State evolution for approximate message passing with non-separable functions. arXiv preprint arXiv:1708.03950 (2017)"},{"key":"31_CR7","unstructured":"Bu, Z., Klusowski, J., Rush, C., Su, W.: Algorithmic analysis and statistical estimation of slope via approximate message passing. arXiv preprint arXiv:1907.07502 (2019)"},{"key":"31_CR8","unstructured":"Celentano, M.: Approximate separability of symmetrically penalized least squares in high dimensions: characterization and consequences. arXiv preprint arXiv:1906.10319 (2019)"},{"key":"31_CR9","unstructured":"Celentano, M., Montanari, A.: Fundamental barriers to high-dimensional regression with convex penalties. arXiv preprint arXiv:1903.10603 (2019)"},{"issue":"11","key":"31_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.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. J. Issued Courant Inst. Math. Sci. 57(11), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math. J. Issued Courant Inst. Math. Sci."},{"issue":"45","key":"31_CR11","doi-asserted-by":"publisher","first-page":"18914","DOI":"10.1073\/pnas.0909892106","volume":"106","author":"DL Donoho","year":"2009","unstructured":"Donoho, D.L., Maleki, A., Montanari, A.: Message-passing algorithms for compressed sensing. Proc. Natl. Acad. Sci. 106(45), 18914\u201318919 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Donoho, D.L., Maleki, A., Montanari, A.: Message passing algorithms for compressed sensing: I. motivation and construction. In: 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo), pp. 1\u20135. IEEE (2010)","DOI":"10.1109\/ITWKSPS.2010.5503193"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Donoho, D.L., Maleki, A., Montanari, A.: How to design message passing algorithms for compressed sensing. preprint (2011)","DOI":"10.1109\/ITWKSPS.2010.5503193"},{"issue":"10","key":"31_CR14","doi-asserted-by":"publisher","first-page":"6920","DOI":"10.1109\/TIT.2011.2165823","volume":"57","author":"DL Donoho","year":"2011","unstructured":"Donoho, D.L., Maleki, A., Montanari, A.: The noise-sensitivity phase transition in compressed sensing. IEEE Trans. Inf. Theory 57(10), 6920\u20136941 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"31_CR15","unstructured":"Foygel, R., Drton, M.: Exact block-wise optimization in group lasso and sparse group lasso for linear regression. arXiv preprint arXiv:1010.3320 (2010)"},{"key":"31_CR16","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: A note on the group lasso and a sparse group lasso. arXiv preprint arXiv:1001.0736 (2010)"},{"issue":"8","key":"31_CR17","doi-asserted-by":"publisher","first-page":"2130","DOI":"10.1109\/TSP.2015.2408569","volume":"63","author":"C Guo","year":"2015","unstructured":"Guo, C., Davies, M.E.: Near optimal compressed sensing without priors: parametric sure approximate message passing. IEEE Trans. Signal Process. 63(8), 2130\u20132141 (2015)","journal-title":"IEEE Trans. Signal Process."},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Hu, H., Lu, Y.M.: Asymptotics and optimal designs of slope for sparse linear regression. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 375\u2013379. IEEE (2019)","DOI":"10.1109\/ISIT.2019.8849836"},{"key":"31_CR19","unstructured":"Ida, Y., Fujiwara, Y., Kashima, H.: Fast sparse group lasso (2019)"},{"key":"31_CR20","unstructured":"Doob, J.L.: Stochastic Processes, vol. 101. Wiley, New York (1953)"},{"key":"31_CR21","first-page":"202","volume":"96","author":"R Kohavi","year":"1996","unstructured":"Kohavi, R.: Scaling up the accuracy of naive-bayes classifiers: a decision-tree hybrid. KDD 96, 202\u2013207 (1996)","journal-title":"KDD"},{"issue":"08","key":"31_CR22","doi-asserted-by":"publisher","first-page":"P08009","DOI":"10.1088\/1742-5468\/2012\/08\/P08009","volume":"2012","author":"F Krzakala","year":"2012","unstructured":"Krzakala, F., M\u00e9zard, M., Sausset, F., Sun, Y., Zdeborov\u00e1, L.: Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices. J. Stat. Mech: Theory Exp. 2012(08), P08009 (2012)","journal-title":"J. Stat. Mech: Theory Exp."},{"key":"31_CR23","unstructured":"Manoel, A., Krzakala, F., Varoquaux, G., Thirion, B., Zdeborov\u00e1, L.: Approximate message-passing for convex optimization with non-separable penalties. arXiv preprint arXiv:1809.06304 (2018)"},{"issue":"1","key":"31_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"70","author":"L Meier","year":"2008","unstructured":"Meier, L., Van De Geer, S., B\u00fchlmann, P.: The group lasso for logistic regression. J. Roy. Stat. Soc. Ser. B (Statistical Methodology) 70(1), 53\u201371 (2008)","journal-title":"J. Roy. Stat. Soc. Ser. B (Statistical Methodology)"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Montanari, A., Eldar, Y., Kutyniok, G.: Graphical models concepts in compressed sensing. Compressed Sensing: Theory and Applications, pp. 394\u2013438 (2012)","DOI":"10.1017\/CBO9780511794308.010"},{"issue":"1","key":"31_CR26","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1214\/17-AOS1544","volume":"46","author":"A Mousavi","year":"2018","unstructured":"Mousavi, A., Maleki, A., Baraniuk, R.G., et al.: Consistent parameter estimation for lasso and approximate message passing. Ann. Stat. 46(1), 119\u2013148 (2018)","journal-title":"Ann. Stat."},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"Parikh, N., Boyd, S., et al.: Proximal algorithms. Foundations Trends Optimization 1(3), 127\u2013239 (2014)","DOI":"10.1561\/2400000003"},{"key":"31_CR28","doi-asserted-by":"crossref","unstructured":"Puig, A.T., Wiesel, A., Hero, A.O.: A multidimensional shrinkage-thresholding operator. In: 2009 IEEE\/SP 15th Workshop on Statistical Signal Processing, pp. 113\u2013116. IEEE (2009)","DOI":"10.1109\/SSP.2009.5278625"},{"key":"31_CR29","doi-asserted-by":"crossref","unstructured":"Rangan, S.: Generalized approximate message passing for estimation with random linear mixing. In: 2011 IEEE International Symposium on Information Theory Proceedings, pp. 2168\u20132172. IEEE (2011)","DOI":"10.1109\/ISIT.2011.6033942"},{"key":"31_CR30","doi-asserted-by":"crossref","unstructured":"Rangan, S., Schniter, P., Fletcher, A.K.: Vector approximate message passing. IEEE Trans. Inf. Theory 65, 6664\u20136684 (2019)","DOI":"10.1109\/TIT.2019.2916359"},{"issue":"9","key":"31_CR31","doi-asserted-by":"publisher","first-page":"5339","DOI":"10.1109\/TIT.2019.2913109","volume":"65","author":"S Rangana","year":"2019","unstructured":"Rangana, S., Schniterb, P., Fletcherc, A.K., Sarkar, S.: On the convergence of approximate message passing with arbitrary matrices. IEEE Trans. Inf. Theory 65(9), 5339\u20135351 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"31_CR32","unstructured":"Shi, H.J.M., Tu, S., Xu, Y., Yin, W.: A primer on coordinate descent algorithms. arXiv preprint arXiv:1610.00040 (2016)"},{"issue":"2","key":"31_CR33","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1080\/10618600.2012.681250","volume":"22","author":"N Simon","year":"2013","unstructured":"Simon, N., Friedman, J., Hastie, T., Tibshirani, R.: A sparse-group lasso. J. Comput. Graph. Stat. 22(2), 231\u2013245 (2013)","journal-title":"J. Comput. Graph. Stat."},{"issue":"5","key":"31_CR34","doi-asserted-by":"publisher","first-page":"2133","DOI":"10.1214\/16-AOS1521","volume":"45","author":"W Su","year":"2017","unstructured":"Su, W., Bogdan, M., Candes, E., et al.: False discoveries occur early on the lasso path. Ann. Stat. 45(5), 2133\u20132150 (2017)","journal-title":"Ann. Stat."},{"issue":"1","key":"31_CR35","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. J. Roy. Stat. Soc.: Ser. B (Methodol.) 58(1), 267\u2013288 (1996)","journal-title":"J. Roy. Stat. Soc.: Ser. B (Methodol.)"},{"key":"31_CR36","doi-asserted-by":"crossref","unstructured":"Vila, J., Schniter, P.: Expectation-maximization bernoulli-gaussian approximate message passing. In: 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), pp. 799\u2013803. IEEE (2011)","DOI":"10.1109\/ACSSC.2011.6190117"},{"key":"31_CR37","doi-asserted-by":"crossref","unstructured":"Vila, J., Schniter, P., Rangan, S., Krzakala, F., Zdeborov\u00e1, L.: Adaptive damping and mean removal for the generalized approximate message passing algorithm. In: 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 2021\u20132025. IEEE (2015)","DOI":"10.1109\/ICASSP.2015.7178325"},{"issue":"19","key":"31_CR38","doi-asserted-by":"publisher","first-page":"4658","DOI":"10.1109\/TSP.2013.2272287","volume":"61","author":"JP Vila","year":"2013","unstructured":"Vila, J.P., Schniter, P.: Expectation-maximization gaussian-mixture approximate message passing. IEEE Trans. Signal Process. 61(19), 4658\u20134672 (2013)","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"31_CR39","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1007\/s11222-014-9498-5","volume":"25","author":"Y Yang","year":"2014","unstructured":"Yang, Y., Zou, H.: A fast unified algorithm for solving group-lasso penalize learning problems. Stat. Comput. 25(6), 1129\u20131141 (2014). https:\/\/doi.org\/10.1007\/s11222-014-9498-5","journal-title":"Stat. Comput."},{"issue":"1","key":"31_CR40","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. Ser. B (Statistical Methodology) 68(1), 49\u201367 (2006)","journal-title":"J. Roy. Stat. Soc. Ser. B (Statistical Methodology)"},{"issue":"476","key":"31_CR41","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1198\/016214506000000735","volume":"101","author":"H Zou","year":"2006","unstructured":"Zou, H.: The adaptive lasso and its oracle properties. J. Am. Stat. Assoc. 101(476), 1418\u20131429 (2006)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"31_CR42","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. J. Roy. Stat. Soc. Ser. B (statistical methodology) 67(2), 301\u2013320 (2005)","journal-title":"J. Roy. Stat. Soc. Ser. B (statistical methodology)"}],"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-030-86523-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:03:48Z","timestamp":1757455428000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86523-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865221","9783030865238"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86523-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 September 2021","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":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2021.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"869","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"210","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}