{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T02:53:37Z","timestamp":1783392817160,"version":"3.54.6"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"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":["J Syst Sci Complex"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s11424-023-1179-z","type":"journal-article","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T10:02:42Z","timestamp":1692784962000},"page":"1609-1625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal Poisson Subsampling for Softmax Regression"],"prefix":"10.1007","volume":"36","author":[{"given":"Yaqiong","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiahui","family":"Zou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haiying","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,23]]},"reference":[{"key":"1179_CR1","doi-asserted-by":"crossref","unstructured":"Drineas P, Mahoney M W, and Muthukrishnan S, Sampling algorithms for l2 regression and applications, Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pages 1127\u20131136, Society for Industrial and Applied Mathematics, 2006.","DOI":"10.1145\/1109557.1109682"},{"key":"1179_CR2","first-page":"3475","volume":"13","author":"P Drineas","year":"2012","unstructured":"Drineas P, Magdon-Ismail M, Mahoney M W, et al., Faster approximation of matrix coherence and statistical leverage, Journal of Machine Learning Research, 2012, 13): 3475\u20133506.","journal-title":"Journal of Machine Learning Research"},{"issue":"6","key":"1179_CR3","doi-asserted-by":"publisher","first-page":"54:1","DOI":"10.1145\/3019134","volume":"63","author":"K L Clarkson","year":"2017","unstructured":"Clarkson K L and Woodruff D P, Low-rank approximation and regression in input sparsity time, J. ACM, 2017, 63(6): 54:1\u201354:45.","journal-title":"J. ACM"},{"issue":"1","key":"1179_CR4","first-page":"861","volume":"16","author":"P Ma","year":"2015","unstructured":"Ma P, Mahoney M W, and Yu B, A statistical perspective on algorithmic leveraging, The Journal of Machine Learning Research, 2015, 16(1): 861\u2013911.","journal-title":"The Journal of Machine Learning Research"},{"key":"1179_CR5","doi-asserted-by":"crossref","unstructured":"Sarlos T, Improved approximation algorithms for large matrices via random projections, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), 2006, 143\u2013152.","DOI":"10.1109\/FOCS.2006.37"},{"key":"1179_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00211-010-0331-6","volume":"117","author":"P Drineas","year":"2011","unstructured":"Drineas P, Mahoney M W, Muthukrishnan S, et al., Faster least squares approximation, Numerische Mathematik, 2011, 117): 219\u2013249.","journal-title":"Numerische Mathematik"},{"issue":"2","key":"1179_CR7","first-page":"123","volume":"3","author":"M W Mahoney","year":"2011","unstructured":"Mahoney M W, Randomized algorithms for matrices and data, Foundations and Trends\u00ae in Machine Learning, 2011, 3(2): 123\u2013224.","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"issue":"525","key":"1179_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1080\/01621459.2017.1408468","volume":"114","author":"H Y Wang","year":"2019","unstructured":"Wang H Y, Yang M, and Stufken J, Information-based optimal subdata selection for big data linear regression, Journal of the American Statistical Association, 2019, 114(525): 393\u2013405.","journal-title":"Journal of the American Statistical Association"},{"issue":"3","key":"1179_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42519-019-0048-5","volume":"13","author":"H Y Wang","year":"2019","unstructured":"Wang H Y, Divide-and-conquer information-based optimalsubdata selection algorithm, Journal of Statistical Theory and Practice, 2019, 13(3): 1\u201319.","journal-title":"Journal of Statistical Theory and Practice"},{"issue":"5","key":"1179_CR10","first-page":"1693","volume":"42","author":"F William","year":"2014","unstructured":"William F and Trevor H, Local case-control sampling: Efficient subsampling in imbalanced data sets, Annals of Statistics, 2014, 42(5): 1693.","journal-title":"Annals of Statistics"},{"issue":"3","key":"1179_CR11","doi-asserted-by":"publisher","first-page":"1770","DOI":"10.1214\/19-AOS1867","volume":"48","author":"L Han","year":"2020","unstructured":"Han L, Tan K M, Yang T, et al., Local uncertainty sampling for large-scale multiclass logistic regression, Annals of Statistics, 2020, 48(3): 1770\u20131788.","journal-title":"Annals of Statistics"},{"issue":"522","key":"1179_CR12","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1080\/01621459.2017.1292914","volume":"113","author":"H Y Wang","year":"2018","unstructured":"Wang H Y, Zhu R, and Ma P, Optimal subsampling for large sample logistic regression, Journal of the American Statistical Association, 2018, 113(522): 829\u2013844.","journal-title":"Journal of the American Statistical Association"},{"issue":"132","key":"1179_CR13","first-page":"1","volume":"20","author":"H Y Wang","year":"2019","unstructured":"Wang H Y, More efficient estimation for logistic regression with optimal subsamples, Journal of Machine Learning Research, 2019, 20(132): 1\u201359.","journal-title":"Journal of Machine Learning Research"},{"key":"1179_CR14","first-page":"749","volume":"31","author":"M Y Ai","year":"2021","unstructured":"Ai M Y, Yu J, Zhang H M, et al., Optimal subsampling algorithms for big data regressions, Statistica Sinica, 2021, 31): 749\u2013772.","journal-title":"Statistica Sinica"},{"issue":"2","key":"1179_CR15","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00362-018-01068-6","volume":"60","author":"Y Q Yao","year":"2019","unstructured":"Yao Y Q and Wang H Y, Optimal subsampling for softmax regression, Statistical Papers, 2019, 60(2): 585\u2013599.","journal-title":"Statistical Papers"},{"issue":"3","key":"1179_CR16","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1007\/s11424-020-9335-1","volume":"34","author":"G Y Hu","year":"2021","unstructured":"Hu G Y and Wang H Y, Most likely optimal subsampled Markov chain Monte Carlo, Journal of Systems Science and Complexity, 2021, 34(3): 1121\u20131134.","journal-title":"Journal of Systems Science and Complexity"},{"issue":"1","key":"1179_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1093\/biomet\/asaa043","volume":"108","author":"H Y Wang","year":"2021","unstructured":"Wang H Y and Ma Y Y, Optimal subsampling for quantile regression in big data, Biometrika, 2021, 108(1): 99\u2013112.","journal-title":"Biometrika"},{"issue":"0","key":"1179_CR18","first-page":"1","volume":"0","author":"J Yu","year":"2020","unstructured":"Yu J, Wang H Y, Ai M Y, et al., Optimal distributed subsampling for maximum quasi-likelihood estimators with massive data, Journal of the American Statistical Association, 2020, 0(0): 1\u201312.","journal-title":"Journal of the American Statistical Association"},{"key":"1179_CR19","volume-title":"R: A Language and Environment for Statistical Computing","author":"Team R Core","year":"2020","unstructured":"Team R Core, R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing, Vienna, Austria, 2020."},{"key":"1179_CR20","unstructured":"Dheeru D and Casey G, UCI machine learning repository, 2017."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-023-1179-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-023-1179-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-023-1179-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T10:21:02Z","timestamp":1692786062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-023-1179-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1179"],"URL":"https:\/\/doi.org\/10.1007\/s11424-023-1179-z","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"3 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}