{"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/catboost-unbiased-boosting-with-categorical","title":"CatBoost: unbiased boosting with categorical features","arxiv_id":"1706.09516","date":"2017-06-28","proceeding":"NeurIPS 2018 12","authors":["Liudmila Prokhorenkova","Gleb Gusev","Aleksandr Vorobev","Anna Veronika Dorogush","Andrey Gulin"],"abstract":"This paper presents the key algorithmic techniques behind CatBoost, a new\ngradient boosting toolkit. Their combination leads to CatBoost outperforming\nother publicly available boosting implementations in terms of quality on a\nvariety of datasets. Two critical algorithmic advances introduced in CatBoost\nare the implementation of ordered boosting, a permutation-driven alternative to\nthe classic algorithm, and an innovative algorithm for processing categorical\nfeatures. Both techniques were created to fight a prediction shift caused by a\nspecial kind of target leakage present in all currently existing\nimplementations of gradient boosting algorithms. In this paper, we provide a\ndetailed analysis of this problem and demonstrate that proposed algorithms\nsolve it effectively, leading to excellent empirical results.","url_abs":"http://arxiv.org/abs/1706.09516v5","url_pdf":"http://arxiv.org/pdf/1706.09516v5.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":"catboost-unbiased-boosting-with-categorical","repo_url":"https://github.com/catboost/catboost","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"catboost-unbiased-boosting-with-categorical","repo_url":"https://github.com/anantgupta129/CatBoost-in-Python-ML","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"catboost-unbiased-boosting-with-categorical","repo_url":"https://github.com/hananlibpost/ml_final_project","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"catboost-unbiased-boosting-with-categorical","repo_url":"https://github.com/jiangzhongkai/ifly-algorithm_challenge","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"catboost-unbiased-boosting-with-categorical","repo_url":"https://github.com/kazeevn/catboost","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"catboost-unbiased-boosting-with-categorical","repo_url":"https://github.com/sgsonu/SoftBank-Forex-Algorithm-Challenge","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"catboost-unbiased-boosting-with-categorical","repo_url":"https://github.com/sswetank-CS/MIL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"catboost-unbiased-boosting-with-categorical","repo_url":"https://github.com/vj-thakur/catboost","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"catboost-unbiased-boosting-with-categorical","repo_url":"https://github.com/xiadanqing/Binary","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"catboost-unbiased-boosting-with-categorical","repo_url":"https://github.com/yumoh/catboost_iter","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.09516","atlas_url":"https://app.syntology.ai/?focus=1706.09516","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":"1706.09516"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.09516\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.09516"},"call":"get_concepts_for_paper(arxiv_id=\"1706.09516\")"}],"by_repo":[{"repo":"catboost/catboost","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1810.11363"],"harvested_for_calls":[{"arxiv_id":"1810.11363","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1810.11363"},"call":"get_harvested_code_for_paper(arxiv_id=\"1810.11363\")"}]},{"repo":"anantgupta129/CatBoost-in-Python-ML","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"hananlibpost/ml_final_project","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jiangzhongkai/ifly-algorithm_challenge","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"kazeevn/catboost","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sgsonu/SoftBank-Forex-Algorithm-Challenge","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sswetank-CS/MIL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vj-thakur/catboost","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xiadanqing/Binary","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"yumoh/catboost_iter","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"0f81316f72d95c327e348f86afb5a566427f35ce06f4098fe3090cccc65fcc2f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}