{"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/to-tune-or-not-to-tune-the-number-of-trees-in","title":"To tune or not to tune the number of trees in random forest?","arxiv_id":"1705.05654","date":"2017-05-16","proceeding":null,"authors":["Philipp Probst","Anne-Laure Boulesteix"],"abstract":"The number of trees T in the random forest (RF) algorithm for supervised\nlearning has to be set by the user. It is controversial whether T should simply\nbe set to the largest computationally manageable value or whether a smaller T\nmay in some cases be better. While the principle underlying bagging is that\n\"more trees are better\", in practice the classification error rate sometimes\nreaches a minimum before increasing again for increasing number of trees. The\ngoal of this paper is four-fold: (i) providing theoretical results showing that\nthe expected error rate may be a non-monotonous function of the number of trees\nand explaining under which circumstances this happens; (ii) providing\ntheoretical results showing that such non-monotonous patterns cannot be\nobserved for other performance measures such as the Brier score and the\nlogarithmic loss (for classification) and the mean squared error (for\nregression); (iii) illustrating the extent of the problem through an\napplication to a large number (n = 306) of datasets from the public database\nOpenML; (iv) finally arguing in favor of setting it to a computationally\nfeasible large number, depending on convergence properties of the desired\nperformance measure.","url_abs":"http://arxiv.org/abs/1705.05654v1","url_pdf":"http://arxiv.org/pdf/1705.05654v1.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":"to-tune-or-not-to-tune-the-number-of-trees-in","repo_url":"https://github.com/PhilippPro/OOBCurve","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification","task_name":"General Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.05654","atlas_url":"https://app.syntology.ai/?focus=1705.05654","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":"1705.05654"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.05654\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.05654"},"call":"get_concepts_for_paper(arxiv_id=\"1705.05654\")"}],"by_repo":[{"repo":"PhilippPro/OOBCurve","kind":"official","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":"16dcc2f3ae6fbd1bd1c7ac9446e1a35ca14c386ae90fcfff3875ee0dccf90185","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}