{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T21:35:17Z","timestamp":1784842517174,"version":"3.55.0"},"reference-count":50,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T00:00:00Z","timestamp":1765324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2210561"],"award-info":[{"award-number":["DMS-2210561"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["SES-2241575"],"award-info":[{"award-number":["SES-2241575"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2239448"],"award-info":[{"award-number":["DMS-2239448"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"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":["CCF-1934924"],"award-info":[{"award-number":["CCF-1934924"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,7,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Random forests are popular methods for regression and classification analysis, and many different variants have been proposed in recent years. One interesting example is the Mondrian random forest, in which the underlying constituent trees are constructed via a Mondrian process. We give precise bias and variance characterizations, along with a Berry\u2013Esseen-type central limit theorem, for the Mondrian random forest regression estimator. By combining these results with a carefully crafted debiasing approach and an accurate variance estimator, we present valid statistical inference methods for the unknown regression function. These methods come with explicit error bounds in terms of the sample size, tree complexity parameter, and number of trees in the forest, and include coverage error rates for feasible confidence interval estimators. Our debiasing procedure for the Mondrian random forest also allows it to achieve the minimax-optimal point estimation convergence rate in mean squared error for multivariate \u03b2-H\u00f6lder regression functions, for all \u03b2&amp;gt;0 , provided that the underlying tuning parameters are chosen appropriately. Efficient and implementable algorithms are devised for both batch and online learning settings, and we study the computational complexity of different Mondrian random forest implementations. Finally, simulations with synthetic data validate our theory and methodology, demonstrating their excellent finite-sample properties.<\/jats:p>","DOI":"10.1093\/jrsssb\/qkaf077","type":"journal-article","created":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T13:07:55Z","timestamp":1763644075000},"page":"1060-1085","source":"Crossref","is-referenced-by-count":3,"title":["Inference with Mondrian random forests"],"prefix":"10.1093","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0493-7506","authenticated-orcid":false,"given":"Matias Damian","family":"Cattaneo","sequence":"first","affiliation":[{"name":"Department of Operations Research and Financial Engineering, Princeton University , Princeton, NJ 08544 ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jason Matthew","family":"Klusowski","sequence":"additional","affiliation":[{"name":"Department of Operations Research and Financial Engineering, Princeton University , Princeton, NJ 08544 ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4604-1548","authenticated-orcid":false,"given":"William George","family":"Underwood","sequence":"additional","affiliation":[{"name":"Statistical Laboratory, Centre for Mathematical Sciences, University of Cambridge , Wilberforce Rd, Cambridge CB3 0WB ,","place":["UK"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2025,12,10]]},"reference":[{"issue":"1","key":"2026071507124029300_qkaf077-B1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/TKDE.2010.36","article-title":"Classification using streaming random forests","volume":"23","author":"Abdulsalam","year":"2010","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2026071507124029300_qkaf077-B2","author":"Arnould","year":"2023"},{"key":"2026071507124029300_qkaf077-B3","article-title":"TrIM: Transformed iterative Mondrian forests for gradient-based dimension reduction and high-dimensional regression","author":"Baptista","year":"2024"},{"key":"2026071507124029300_qkaf077-B4","first-page":"1063","article-title":"Analysis of a random forests model","volume":"13","author":"Biau","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"2026071507124029300_qkaf077-B5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1214\/lnms\/1215090065","article-title":"An alternative point of view on Lepski\u2019s method","volume":"36","author":"Birg\u00e9","year":"2001","journal-title":"Lecture Notes\u2013Monograph Series"},{"key":"2026071507124029300_qkaf077-B6","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration inequalities: A nonasymptotic theory of independence","author":"Boucheron","year":"2013"},{"issue":"1","key":"2026071507124029300_qkaf077-B7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random forests","volume":"45","author":"Breiman","year":"2001","journal-title":"Machine Learning"},{"key":"2026071507124029300_qkaf077-B8","volume-title":"Classification and regression trees","author":"Breiman","year":"1984"},{"issue":"522","key":"2026071507124029300_qkaf077-B9","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1080\/01621459.2017.1285776","article-title":"On the effect of bias estimation on coverage accuracy in nonparametric inference","volume":"113","author":"Calonico","year":"2018","journal-title":"Journal of the American Statistical Association"},{"issue":"4","key":"2026071507124029300_qkaf077-B10","doi-asserted-by":"publisher","first-page":"2998","DOI":"10.3150\/21-BEJ1445","article-title":"Coverage error optimal confidence intervals for local polynomial regression","volume":"28","author":"Calonico","year":"2022","journal-title":"Bernoulli"},{"key":"2026071507124029300_qkaf077-B11","author":"Caruana","year":"2004"},{"issue":"2","key":"2026071507124029300_qkaf077-B12","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1214\/24-AOS2354","article-title":"Convergence rates of oblique regression trees for flexible function libraries","volume":"52","author":"Cattaneo","year":"2024","journal-title":"Annals of Statistics"},{"issue":"3","key":"2026071507124029300_qkaf077-B13","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1214\/19-AOS1865","article-title":"Large sample properties of partitioning-based series estimators","volume":"48","author":"Cattaneo","year":"2020","journal-title":"Annals of Statistics"},{"key":"2026071507124029300_qkaf077-B14","article-title":"On the pointwise behavior of recursive partitioning and its implications for heterogeneous causal effect estimation","author":"Cattaneo","year":"2024"},{"key":"2026071507124029300_qkaf077-B15","author":"Cattaneo","year":"2025"},{"key":"2026071507124029300_qkaf077-B16","article-title":"The honest truth about causal trees: Accuracy limits for heterogeneous treatment effect estimation","author":"Cattaneo","year":"2025"},{"issue":"6","key":"2026071507124029300_qkaf077-B17","doi-asserted-by":"publisher","first-page":"3415","DOI":"10.1214\/22-AOS2234","article-title":"Asymptotic properties of high-dimensional random forests","volume":"50","author":"Chi","year":"2022","journal-title":"Annals of Statistics"},{"key":"2026071507124029300_qkaf077-B18","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1051\/ps\/2018008","article-title":"Impact of subsampling and tree depth on random forests","volume":"22","author":"Duroux","year":"2018","journal-title":"ESAIM: Probability and Statistics"},{"issue":"18","key":"2026071507124029300_qkaf077-B19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103788","article-title":"Towards convergence rate analysis of random forests for classification","volume":"313","author":"Gao","year":"2022","journal-title":"Artificial Intelligence"},{"issue":"4","key":"2026071507124029300_qkaf077-B20","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.3150\/08-BEJ144","article-title":"Universal pointwise selection rule in multivariate function estimation","volume":"14","author":"Goldenshluger","year":"2008","journal-title":"Bernoulli"},{"issue":"9\u201310","key":"2026071507124029300_qkaf077-B21","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1007\/s10994-017-5642-8","article-title":"Adaptive random forests for evolving data stream classification","volume":"106","author":"Gomes","year":"2017","journal-title":"Machine Learning"},{"issue":"5","key":"2026071507124029300_qkaf077-B22","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1214\/aos\/1065705120","article-title":"Local asymptotics for polynomial spline regression","volume":"31","author":"Huang","year":"2003","journal-title":"Annals of Statistics"},{"key":"2026071507124029300_qkaf077-B23","volume-title":"Independent and stationary sequences of random variables","author":"Ibragimov","year":"1975"},{"key":"2026071507124029300_qkaf077-B24","author":"Klusowski","year":"2021"},{"issue":"545","key":"2026071507124029300_qkaf077-B25","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1080\/01621459.2022.2126782","article-title":"Large scale prediction with decision trees","volume":"119","author":"Klusowski","year":"2024","journal-title":"Journal of the American Statistical Association"},{"issue":"2","key":"2026071507124029300_qkaf077-B26","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.ejor.2016.10.031","article-title":"Deep neural networks, gradient-boosted trees, random forests: Statistical arbitrage on the S&P 500","volume":"259","author":"Krauss","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2026071507124029300_qkaf077-B27","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1214\/009053607000000811","article-title":"Rodeo: Sparse, greedy nonparametric regression","volume":"36","author":"Lafferty","year":"2008","journal-title":"Annals of Statistics"},{"key":"2026071507124029300_qkaf077-B28","volume-title":"Advances in Neural Information Processing Systems","author":"Lakshminarayanan","year":"2014"},{"issue":"4","key":"2026071507124029300_qkaf077-B29","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1137\/1136085","article-title":"Asymptotically minimax adaptive estimation I: Upper bounds. Optimally adaptive estimates","volume":"36","author":"Lepski","year":"1992","journal-title":"Theory of Probability & its Applications"},{"key":"2026071507124029300_qkaf077-B30","doi-asserted-by":"publisher","first-page":"45071","DOI":"10.1109\/Access.6287639","article-title":"A multi-dimensional context-aware recommendation approach based on improved random forest algorithm","volume":"6","author":"Li","year":"2018","journal-title":"IEEE Access: Practical Innovations, Open Solutions"},{"key":"2026071507124029300_qkaf077-B31","author":"Ma","year":"2020"},{"issue":"6","key":"2026071507124029300_qkaf077-B32","doi-asserted-by":"publisher","first-page":"315","DOI":"10.3390\/info11060315","article-title":"Ensemble-based online machine learning algorithms for network intrusion detection systems using streaming data","volume":"11","author":"Martindale","year":"2020","journal-title":"Information"},{"key":"2026071507124029300_qkaf077-B33","article-title":"Early stopping for regression trees","author":"Miftachov","year":"2025"},{"issue":"4","key":"2026071507124029300_qkaf077-B34","doi-asserted-by":"publisher","first-page":"2253","DOI":"10.1214\/19-AOS1886","article-title":"Minimax optimal rates for Mondrian trees and forests","volume":"48","author":"Mourtada","year":"2020","journal-title":"Annals of Statistics"},{"issue":"3","key":"2026071507124029300_qkaf077-B35","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1111\/rssb.12425","article-title":"AMF: Aggregated Mondrian forests for online learning","volume":"83","author":"Mourtada","year":"2021","journal-title":"Journal of the Royal Statistical Society: Series B, Statistical Methodology"},{"issue":"366","key":"2026071507124029300_qkaf077-B36","first-page":"1","article-title":"Confidence and uncertainty assessment for distributional random forests","volume":"24","author":"N\u00e4f","year":"2023","journal-title":"Journal of Machine Learning Research"},{"key":"2026071507124029300_qkaf077-B37","article-title":"Statistical advantages of oblique randomized decision trees and forests","author":"O\u2019Reilly","year":"2024"},{"issue":"2","key":"2026071507124029300_qkaf077-B38","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/20M1354490","article-title":"Stochastic geometry to generalize the Mondrian process","volume":"4","author":"O\u2019Reilly","year":"2022","journal-title":"SIAM Journal on Mathematics of Data Science"},{"issue":"89","key":"2026071507124029300_qkaf077-B39","first-page":"1","article-title":"Minimax rates for high-dimensional random tessellation forests","volume":"25","author":"O\u2019Reilly","year":"2024","journal-title":"Journal of Machine Learning Research"},{"key":"2026071507124029300_qkaf077-B40","article-title":"The uniformly rotated Mondrian kernel","author":"Osborne","year":"2025"},{"key":"2026071507124029300_qkaf077-B41","volume-title":"Limit theorems of probability theory: Sequences of independent random variables","author":"Petrov","year":"1995"},{"key":"2026071507124029300_qkaf077-B42","volume-title":"Advances in Neural Information Processing Systems","author":"Roy","year":"2008"},{"issue":"358","key":"2026071507124029300_qkaf077-B43","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1080\/01621459.1977.10481012","article-title":"Improvement of kernel type density estimators","volume":"72","author":"Schucany","year":"1977","journal-title":"Journal of the American Statistical Association"},{"issue":"4","key":"2026071507124029300_qkaf077-B44","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2021.110116","article-title":"Uncertainty quantification for data-driven turbulence modelling with Mondrian forests","volume":"430","author":"Scillitoe","year":"2021","journal-title":"Journal of Computational Physics"},{"issue":"4","key":"2026071507124029300_qkaf077-B45","doi-asserted-by":"publisher","first-page":"1716","DOI":"10.1214\/15-AOS1321","article-title":"Consistency of random forests","volume":"43","author":"Scornet","year":"2015","journal-title":"Annals of Statistics"},{"issue":"4","key":"2026071507124029300_qkaf077-B46","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1214\/aos\/1176345969","article-title":"Optimal global rates of convergence for nonparametric regression","volume":"10","author":"Stone","year":"1982","journal-title":"Annals of Statistics"},{"key":"2026071507124029300_qkaf077-B47","author":"Vicuna","year":"2021"},{"issue":"523","key":"2026071507124029300_qkaf077-B48","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1080\/01621459.2017.1319839","article-title":"Estimation and inference of heterogeneous treatment effects using random forests","volume":"113","author":"Wager","year":"2018","journal-title":"Journal of the American Statistical Association"},{"key":"2026071507124029300_qkaf077-B49","article-title":"Non-asymptotic properties of generalized Mondrian forests in statistical learning","author":"Zhan","year":"2024"},{"issue":"1","key":"2026071507124029300_qkaf077-B50","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1093\/nsr\/nwy108","article-title":"Deep forest","volume":"6","author":"Zhou","year":"2019","journal-title":"National Science Review"}],"container-title":["Journal of the Royal Statistical Society Series B: Statistical Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/88\/3\/1060\/65824218\/qkaf077.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/88\/3\/1060\/65824218\/qkaf077.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T11:12:51Z","timestamp":1784113971000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jrsssb\/article\/88\/3\/1060\/8375729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,10]]},"references-count":50,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,12,10]]},"published-print":{"date-parts":[[2026,7,15]]}},"URL":"https:\/\/doi.org\/10.1093\/jrsssb\/qkaf077","relation":{},"ISSN":["1369-7412","1467-9868"],"issn-type":[{"value":"1369-7412","type":"print"},{"value":"1467-9868","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,7]]},"published":{"date-parts":[[2025,12,10]]}}}