{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/consistency-of-online-random-forests","title":"Consistency of Online Random Forests","arxiv_id":"1302.4853","date":"2013-02-20","proceeding":null,"authors":["Misha Denil","David Matheson","Nando de Freitas"],"abstract":"As a testament to their success, the theory of random forests has long been\noutpaced by their application in practice. In this paper, we take a step\ntowards narrowing this gap by providing a consistency result for online random\nforests.","url_abs":"http://arxiv.org/abs/1302.4853v2","url_pdf":"http://arxiv.org/pdf/1302.4853v2.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":"consistency-of-online-random-forests","repo_url":"https://github.com/david-matheson/rftk-colrf-icml2013","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}