We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1706.09516")
get_code_for_paper("1706.09516")
have("1706.09516")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1706.09516.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1706.09516)
Connect an agent — have() is free.