{"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-boost-or-not-to-boost-on-the-limits-of","title":"To Boost or Not to Boost? On the Limits of Boosted Trees for Object Detection","arxiv_id":"1701.01692","date":"2017-01-06","proceeding":null,"authors":["Eshed Ohn-Bar","Mohan M. Trivedi"],"abstract":"We aim to study the modeling limitations of the commonly employed boosted\ndecision trees classifier. Inspired by the success of large, data-hungry visual\nrecognition models (e.g. deep convolutional neural networks), this paper\nfocuses on the relationship between modeling capacity of the weak learners,\ndataset size, and dataset properties. A set of novel experiments on the Caltech\nPedestrian Detection benchmark results in the best known performance among\nnon-CNN techniques while operating at fast run-time speed. Furthermore, the\nperformance is on par with deep architectures (9.71% log-average miss rate),\nwhile using only HOG+LUV channels as features. The conclusions from this study\nare shown to generalize over different object detection domains as demonstrated\non the FDDB face detection benchmark (93.37% accuracy). Despite the impressive\nperformance, this study reveals the limited modeling capacity of the common\nboosted trees model, motivating a need for architectural changes in order to\ncompete with multi-level and very deep architectures.","url_abs":"http://arxiv.org/abs/1701.01692v1","url_pdf":"http://arxiv.org/pdf/1701.01692v1.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":[],"tasks":[{"task_slug":"face-detection","task_name":"Face Detection"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"pedestrian-detection","task_name":"Pedestrian Detection"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/face-detection-on-wider-face-hard","task":"Face Detection","dataset":"WIDER Face (Hard)","model":"LDCF+","rank_in_archive_order":35,"of":40,"metrics":{"AP":"0.564"},"uses_additional_data":false},{"leaderboard":"/sota/face-detection-on-wider-face-medium","task":"Face Detection","dataset":"WIDER Face (Medium)","model":"LDCF+","rank_in_archive_order":32,"of":37,"metrics":{"AP":"0.772"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1a5f2a575358bd1b82720ffcde1629495c66bd5908d41193303eaa606e1834c3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}