Papers › CatBoost: unbiased boosting with categorical features

CatBoost: unbiased boosting with categorical features

28 Jun 2017NeurIPS 2018 12arXiv:1706.09516archive 2025-07-28

Liudmila Prokhorenkova, Gleb Gusev, Aleksandr Vorobev, Anna Veronika Dorogush, Andrey Gulin

This paper presents the key algorithmic techniques behind CatBoost, a new gradient boosting toolkit. Their combination leads to CatBoost outperforming other publicly available boosting implementations in terms of quality on a variety of datasets. Two critical algorithmic advances introduced in CatBoost are the implementation of ordered boosting, a permutation-driven alternative to the classic algorithm, and an innovative algorithm for processing categorical features. Both techniques were created to fight a prediction shift caused by a special kind of target leakage present in all currently existing implementations of gradient boosting algorithms. In this paper, we provide a detailed analysis of this problem and demonstrate that proposed algorithms solve it effectively, leading to excellent empirical results.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

catboost/catboost officialmentioned in papermentioned on GitHubApache-2.0Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to CatBoost: gradient boosting with categorical features support (arXiv:1810.11363; that paper's own run record: 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
anantgupta129/CatBoost-in-Python-ML mentioned on GitHubSyntology: not harvested report
hananlibpost/ml_final_project mentioned on GitHubSyntology: not harvested report
jiangzhongkai/ifly-algorithm_challenge mentioned on GitHubSyntology: not harvested report
kazeevn/catboost mentioned on GitHubSyntology: not harvested report
sgsonu/SoftBank-Forex-Algorithm-Challenge mentioned on GitHubSyntology: not harvested report
sswetank-CS/MIL mentioned on GitHubSyntology: not harvested report
vj-thakur/catboost mentioned on GitHubSyntology: not harvested report
xiadanqing/Binary mentioned on GitHubSyntology: not harvested report
yumoh/catboost_iter mentioned on GitHubSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

ClusteringDimensionality ReductionGeneral Classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections