{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T13:04:40Z","timestamp":1770728680408,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"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":["62076138"],"award-info":[{"award-number":["62076138"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10994-023-06339-4","type":"journal-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T21:02:36Z","timestamp":1685566956000},"page":"3077-3104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A new large-scale learning algorithm for generalized additive models"],"prefix":"10.1007","volume":"112","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7165-3143","authenticated-orcid":false,"given":"Bin","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenkang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhouyuan","family":"Huo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"key":"6339_CR1","unstructured":"Allen-Zhu, Z., & Li, Y. (2016). Lazysvd: Even faster svd decomposition yet without agonizing pain. In: Advances in Neural Information Processing Systems, pp. 974\u2013982."},{"key":"6339_CR2","unstructured":"Aravkin, A. Y., Kambadur, A., Lozano, A. C., & Luss, R. (2014). Sparse quantile huber regression for efficient and robust estimation. arXiv preprint arXiv:1402.4624"},{"issue":"1","key":"6339_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/13094829X","volume":"25","author":"A Beck","year":"2015","unstructured":"Beck, A. (2015). On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes. SIAM Journal on Optimization, 25(1), 185\u2013209.","journal-title":"SIAM Journal on Optimization"},{"key":"6339_CR4","doi-asserted-by":"crossref","unstructured":"Bottou, L. (2010) Large-scale machine learning with stochastic gradient descent. In: Proceedings of COMPSTAT\u20192010, Springer, pp. 177\u2013186","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"6339_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge University Press."},{"issue":"3","key":"6339_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/0022-247X(65)90016-8","volume":"12","author":"D Callebaut","year":"1965","unstructured":"Callebaut, D. (1965). Generalization of the Cauchy\u2013Schwarz inequality. Journal of Mathematical Analysis and Applications, 12(3), 491\u2013494.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"6339_CR7","unstructured":"Chen, H., Wang, X., Deng, C., & Huang, H. (2017). Group sparse additive machine. In: Advances in Neural Information Processing Systems, pp. 197\u2013207."},{"key":"6339_CR8","unstructured":"Chouldechova, A., & Hastie, T. (2015). Generalized additive model selection. arXiv preprint arXiv:1506.03850"},{"issue":"03","key":"6339_CR9","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1142\/S0219530515500050","volume":"14","author":"A Christmann","year":"2016","unstructured":"Christmann, A., & Zhou, D. X. (2016). Learning rates for the risk of Kernel-based quantile regression estimators in additive models. Analysis and Applications, 14(03), 449\u2013477.","journal-title":"Analysis and Applications"},{"issue":"3","key":"6339_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1093\/aje\/kwf062","volume":"156","author":"F Dominici","year":"2002","unstructured":"Dominici, F., McDermott, A., Zeger, S. L., & Samet, J. M. (2002). On the use of generalized additive models in time-series studies of air pollution and health. American Journal of Epidemiology, 156(3), 193\u2013203.","journal-title":"American Journal of Epidemiology"},{"key":"6339_CR11","unstructured":"Fang, C., Li, C. J., Lin, Z., & Zhang, T. (2018). Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator. In: Advances in Neural Information Processing Systems, pp. 687\u2013697."},{"issue":"1","key":"6339_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/18M1168480","volume":"29","author":"O Fercoq","year":"2019","unstructured":"Fercoq, O., & Bianchi, P. (2019). A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions. SIAM Journal on Optimization, 29(1), 100\u2013134.","journal-title":"SIAM Journal on Optimization"},{"key":"6339_CR13","doi-asserted-by":"crossref","unstructured":"Gu, B., Huo, Z., & Huang, H. (2018). Asynchronous doubly stochastic group regularized learning. In: International Conference on Artificial Intelligence and Statistics, (AISTATS 2018)","DOI":"10.1609\/aaai.v32i1.11803"},{"key":"6339_CR14","doi-asserted-by":"crossref","unstructured":"Gu, B., Xin, M., Huo, Z., & Huang, H. (2018). Asynchronous doubly stochastic sparse kernel learning. In: Thirty-Second AAAI Conference on Artificial Intelligence.","DOI":"10.1609\/aaai.v32i1.11803"},{"key":"6339_CR15","first-page":"297","volume":"1","author":"T Hastie","year":"1986","unstructured":"Hastie, T., & Tibshirani, R. (1986). Generalized additive models. Statistical Science, 1, 297\u2013318.","journal-title":"Statistical Science"},{"issue":"3","key":"6339_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1177\/096228029500400302","volume":"4","author":"T Hastie","year":"1995","unstructured":"Hastie, T., & Tibshirani, R. (1995). Generalized additive models for medical research. Statistical Methods in Medical Research, 4(3), 187\u2013196.","journal-title":"Statistical Methods in Medical Research"},{"key":"6339_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R. A., & Johnson, C. R. (2012). Matrix analysis. Cambridge University Press."},{"key":"6339_CR18","unstructured":"Kandasamy, K., & Yu, Y. (2016). Additive approximations in high dimensional nonparametric regression via the salsa. In: International Conference on Machine Learning."},{"issue":"5","key":"6339_CR19","doi-asserted-by":"publisher","first-page":"2272","DOI":"10.1214\/009053606000000722","volume":"34","author":"Y Lin","year":"2006","unstructured":"Lin, Y., & Zhang, H. H. (2006). Component selection and smoothing in multivariate nonparametric regression. Annals of Statistics, 34(5), 2272\u20132297.","journal-title":"Annals of Statistics"},{"issue":"1","key":"6339_CR20","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/140961134","volume":"25","author":"J Liu","year":"2015","unstructured":"Liu, J., & Wright, S. J. (2015). Asynchronous stochastic coordinate descent: Parallelism and convergence properties. SIAM Journal on Optimization, 25(1), 351\u2013376.","journal-title":"SIAM Journal on Optimization"},{"key":"6339_CR21","doi-asserted-by":"crossref","unstructured":"Meng, Q., Chen, W., Yu, J., Wang, T., Ma, Z., & Liu, T. Y. (2017). Asynchronous stochastic proximal optimization algorithms with variance reduction. In: AAAI, pp. 2329\u20132335.","DOI":"10.1609\/aaai.v31i1.10910"},{"key":"6339_CR22","unstructured":"Ouyang, H., He, N., Tran, L., & Gray, A. (2013). Stochastic alternating direction method of multipliers. In: International Conference on Machine Learning, pp. 80\u201388."},{"issue":"2","key":"6339_CR23","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1093\/biostatistics\/kxaa032","volume":"23","author":"H Park","year":"2022","unstructured":"Park, H., Petkova, E., Tarpey, T., & Ogden, R. T. (2022). A sparse additive model for treatment effect-modifier selection. Biostatistics, 23(2), 412\u2013429.","journal-title":"Biostatistics"},{"key":"6339_CR24","doi-asserted-by":"crossref","unstructured":"Piegl, L., & Tiller, W. (1995) B-spline basis functions. In: The NURBS Book, Springer, pp. 47\u201379.","DOI":"10.1007\/978-3-642-97385-7_2"},{"key":"6339_CR25","unstructured":"Rahimi, A., & Recht, B. (2008). Random features for large-scale Kernel machines. In: Advances in Neural Information Processing Systems, pp. 1177\u20131184."},{"key":"6339_CR26","unstructured":"Ravikumar, P., Liu, H., Lafferty, J., & Wasserman, L. (2007) Spam: Sparse additive models. In: Proceedings of the 20th international conference on neural information processing systems, Curran Associates Inc., pp. 1201\u20131208."},{"key":"6339_CR27","unstructured":"Shamir, O. (2015) A stochastic PCA and SVD algorithm with an exponential convergence rate. In: Proceedings of the 32nd international conference on machine learning (ICML-15), pp. 144\u2013152."},{"issue":"1","key":"6339_CR28","first-page":"139","volume":"64","author":"SN Wood","year":"2015","unstructured":"Wood, S. N., Goude, Y., & Shaw, S. (2015). Generalized additive models for large data sets. Journal of the Royal Statistical Society: Series C (Applied Statistics), 64(1), 139\u2013155.","journal-title":"Journal of the Royal Statistical Society: Series C (Applied Statistics)"},{"issue":"519","key":"6339_CR29","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1080\/01621459.2016.1195744","volume":"112","author":"SN Wood","year":"2017","unstructured":"Wood, S. N., Li, Z., Shaddick, G., & Augustin, N. H. (2017). Generalized additive models for Gigadata: Modeling the UK black smoke network daily data. Journal of the American Statistical Association, 112(519), 1199\u20131210.","journal-title":"Journal of the American Statistical Association"},{"key":"6339_CR30","unstructured":"Yin, J., Chen, X., & Xing, EP. (2012) Group sparse additive models. In: Proceedings of the international conference on machine learning. international conference on machine learning, NIH Public Access, vol 2012, p 871."},{"key":"6339_CR31","first-page":"1999","volume":"13","author":"GX Yuan","year":"2012","unstructured":"Yuan, G. X., Ho, C. H., & Lin, C. J. (2012). An improved glmnet for l1-regularized logistic regression. Journal of Machine Learning Research, 13, 1999\u20132030.","journal-title":"Journal of Machine Learning Research"},{"key":"6339_CR32","unstructured":"Zhao, T., Yu, M., Wang, Y., Arora, R., & Liu, H. (2014). Accelerated mini-batch randomized block coordinate descent method. In: Advances in Neural Information Processing Systems,"},{"key":"6339_CR33","unstructured":"Zhong, W., & Kwok, J. (2014). Fast stochastic alternating direction method of multipliers. In: International Conference on Machine Learning, pp. 46\u201354."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06339-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-023-06339-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06339-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:02:22Z","timestamp":1717113742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-023-06339-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,31]]},"references-count":33,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["6339"],"URL":"https:\/\/doi.org\/10.1007\/s10994-023-06339-4","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,31]]},"assertion":[{"value":"17 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not Applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not Applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not Applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The code will be publicly available once the work is published upon agreement of different sides.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}