{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,9]],"date-time":"2026-10-09T21:59:30Z","timestamp":1791583170183,"version":"4.3.4"},"reference-count":42,"publisher":"Informa UK Limited","issue":"545","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2054808"],"award-info":[{"award-number":["DMS-2054808"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["HDR TRIPODS DATA-INSPIRE DCCF-1934924"],"award-info":[{"award-number":["HDR TRIPODS DATA-INSPIRE DCCF-1934924"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of the American Statistical Association"],"published-print":{"date-parts":[[2024,1,2]]},"DOI":"10.1080\/01621459.2022.2126782","type":"journal-article","created":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T13:21:21Z","timestamp":1699881681000},"page":"525-537","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":53,"title":["Large Scale Prediction with Decision Trees"],"prefix":"10.1080","volume":"119","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6484-8682","authenticated-orcid":false,"given":"Jason M.","family":"Klusowski","sequence":"first","affiliation":[{"name":"Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter M.","family":"Tian","sequence":"additional","affiliation":[{"name":"Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2884963"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1024691352"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/130385.130401"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058655"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_3_7_1","volume-title":"Classification and Regression Trees","author":"Breiman L.","year":"1984","unstructured":"Breiman, L., Friedman, J., Olshen, R. A., and Stone, C. J. (1984), Classification and Regression Trees, Boca Raton, FL: Chapman and Hall\/CRC."},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000000092"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS2045"},{"key":"e_1_3_3_10_1","unstructured":"Chi C.-M. Vossler P. Fan Y. and Lv J. (2020) \u201cAsymptotic Properties of High-Dimensional Random Forests \u201d arXiv preprint arXiv:2004.13953."},{"key":"e_1_3_3_11_1","first-page":"665","volume-title":"Proceedings of the 31st International Conference on Machine Learning, volume 32 of Proceedings of Machine Learning Research","author":"Denil M.","year":"2014","unstructured":"Denil, M., Matheson, D., and De Freitas, N. (2014), \u201cNarrowing the Gap: Random Forests in Theory and in Practice,\u201d in Proceedings of the 31st International Conference on Machine Learning, volume 32 of Proceedings of Machine Learning Research, eds. E. P. Xing and T. Jebara, pp. 665\u2013673, Bejing, China, 22\u201324 Jun 2014. PMLR. Available at https:\/\/proceedings.mlr.press\/v32\/denil14.html."},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1069362377"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1051\/ps\/2018008"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2006.06.002"},{"key":"e_1_3_3_16_1","unstructured":"Genuer R. Poggi J.-M. and Tuleau C. (2008) \u201cRandom Forests: Some Methodological Insights \u201d arXiv preprint arXiv:0811.3619."},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.840903"},{"key":"e_1_3_3_18_1","volume-title":"Generalized Additive Models","author":"Hastie T.","year":"1990","unstructured":"Hastie, T., and Tibshirani, R. (1990), Generalized Additive Models, London and New York: Chapman and Hall."},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1198\/106186007X237892"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053604000000814"},{"key":"e_1_3_3_21_1","unstructured":"Jeong S. and Ro\u010dkov\u00e1 V. (2020) \u201cThe Art of BART: On Flexibility of Bayesian Forests \u201d arXiv preprint arXiv:2008.06620."},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1543"},{"key":"e_1_3_3_23_1","first-page":"11612","volume-title":"Advances in Neural Information Processing Systems","author":"Klusowski J.","year":"2020","unstructured":"Klusowski, J. (2020), \u201cSparse Learning with CART,\u201d in Advances in Neural Information Processing Systems (Vol. 33), eds. H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin, pp. 11612\u201311622, Curran Associates, Inc. Available at https:\/\/proceedings.neurips.cc\/paper\/2020\/file\/85fc37b18c57097425b52fc7afbb6969-Paper.pdf."},{"key":"e_1_3_3_24_1","unstructured":"Louppe G. (2014) \u201cUnderstanding Random Forests: From Theory to Practice \u201d arXiv preprint: arXiv:1407.7502."},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0602035"},{"key":"e_1_3_3_26_1","first-page":"1","article-title":"\u201cRandomization as Regularization: A Degrees of Freedom Explanation for Random Forest Success,\u201d","volume":"21","author":"Mentch L.","year":"2020","unstructured":"Mentch, L., and Zhou, S. (2020), \u201cRandomization as Regularization: A Degrees of Freedom Explanation for Random Forest Success,\u201d Journal of Machine Learning Research, 21, 1\u201336. Available at http:\/\/jmlr.org\/papers\/v21\/19-905.html.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1214\/19-AOS1886"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12425"},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1301"},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-050058-4.50007-3"},{"key":"e_1_3_3_31_1","first-page":"389","article-title":"\u201cMinimax-Optimal Rates for Sparse Additive Models over Kernel Classes via Convex Programming,\u201d","volume":"13","author":"Raskutti G.","year":"2012","unstructured":"Raskutti, G., Wainwright, M. J., and Yu, B. (2012), \u201cMinimax-Optimal Rates for Sparse Additive Models over Kernel Classes via Convex Programming,\u201d Journal of Machine Learning Research, 13, 389\u2013427. Available at http:\/\/jmlr.org\/papers\/v13\/raskutti12a.html.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1214\/19-AOS1879"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176325632"},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1321"},{"key":"e_1_3_3_35_1","unstructured":"Segal M. R. (2004) \u201cMachine Learning Benchmarks and Random Forest Regression \u201d UCSF: Center for Bioinformatics and Molecular Biostatistics. Available at https:\/\/escholarship.org\/uc\/item\/35x3v9t4."},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176343886"},{"key":"e_1_3_3_37_1","first-page":"3453","volume-title":"Proceedings of Thirty Third Conference on Learning Theory, volume 125 of Proceedings of Machine Learning Research","author":"Syrgkanis V.","year":"2020","unstructured":"Syrgkanis, V., and Zampetakis, M. (2020), \u201cEstimation and Inference with Trees and Forests in High Dimensions,\u201d in Proceedings of Thirty Third Conference on Learning Theory, volume 125 of Proceedings of Machine Learning Research, eds. J. Abernethy and S. Agarwal, pp. 3453\u20133454. PMLR, 09\u201312 Jul 2020. Available at https:\/\/proceedings.mlr.press\/v125\/syrgkanis20a.html."},{"key":"e_1_3_3_38_1","unstructured":"Tan Y. S. Agarwal A. and Yu B. (2021) \u201cA Cautionary Tale on Fitting Decision Trees to Data from Additive Models: Generalization Lower Bounds \u201d arXiv preprint arXiv:2110.09626."},{"key":"e_1_3_3_39_1","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1757"},{"key":"e_1_3_3_40_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1541-0420.2006.00578.x"},{"key":"e_1_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1319839"},{"key":"e_1_3_3_42_1","unstructured":"Wager S. and Walther G. (2015) \u201cAdaptive Concentration of Regression Trees with Application to Random Forests \u201d arXiv preprint arXiv:1503.06388."},{"key":"e_1_3_3_43_1","doi-asserted-by":"crossref","unstructured":"Zhou S. and Mentch L. (2021) \u201cTrees Forests Chickens and Eggs: When and Why to Prune Trees in a Random Forest \u201d arXiv preprint arXiv:2103.16700.","DOI":"10.1002\/sam.11594"}],"container-title":["Journal of the American Statistical Association"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01621459.2022.2126782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T16:43:36Z","timestamp":1727196216000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01621459.2022.2126782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,18]]},"references-count":42,"journal-issue":{"issue":"545","published-print":{"date-parts":[[2024,1,2]]}},"alternative-id":["10.1080\/01621459.2022.2126782"],"URL":"https:\/\/doi.org\/10.1080\/01621459.2022.2126782","relation":{},"ISSN":["0162-1459","1537-274X"],"issn-type":[{"value":"0162-1459","type":"print"},{"value":"1537-274X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,18]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uasa20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uasa20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-07-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-07-05","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-08-16","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}