{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/adaptive-concentration-of-regression-trees","title":"Adaptive Concentration of Regression Trees, with Application to Random Forests","arxiv_id":"1503.06388","date":"2015-03-22","proceeding":null,"authors":["Stefan Wager","Guenther Walther"],"abstract":"We study the convergence of the predictive surface of regression trees and\nforests. To support our analysis we introduce a notion of adaptive\nconcentration for regression trees. This approach breaks tree training into a\nmodel selection phase in which we pick the tree splits, followed by a model\nfitting phase where we find the best regression model consistent with these\nsplits. We then show that the fitted regression tree concentrates around the\noptimal predictor with the same splits: as d and n get large, the discrepancy\nis with high probability bounded on the order of sqrt(log(d) log(n)/k)\nuniformly over the whole regression surface, where d is the dimension of the\nfeature space, n is the number of training examples, and k is the minimum leaf\nsize for each tree. We also provide rate-matching lower bounds for this\nadaptive concentration statement. From a practical perspective, our result\nenables us to prove consistency results for adaptively grown forests in high\ndimensions, and to carry out valid post-selection inference in the sense of\nBerk et al. [2013] for subgroups defined by tree leaves.","url_abs":"http://arxiv.org/abs/1503.06388v3","url_pdf":"http://arxiv.org/pdf/1503.06388v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"adaptive-concentration-of-regression-trees","repo_url":"https://github.com/celiaescribe/guess_and_check","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"adaptive-concentration-of-regression-trees","repo_url":"https://github.com/gaspardbe/guess_and_check","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"model-selection","task_name":"Model Selection"},{"task_slug":"regression-1","task_name":"regression"},{"task_slug":null,"task_name":"valid"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1503.06388","atlas_url":"https://app.syntology.ai/?focus=1503.06388","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1503.06388"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1503.06388\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1503.06388"},"call":"get_concepts_for_paper(arxiv_id=\"1503.06388\")"}],"by_repo":[{"repo":"celiaescribe/guess_and_check","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"gaspardbe/guess_and_check","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"16ee3ef2af6aedd139da5c8bf537127247fd33fe1329e00c0aff0465374ea06d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}