CatBoost: Oblivious Tree Leaf Index
Beginner
The problem, from first principles
CatBoost uses oblivious trees: every node on the same level applies the same split. So a sample's leaf is fully determined by the outcome of each level's split, which is a binary code.
From theory to code
Implement oblivious_leaf_index(bits), converting the level outcomes into an integer leaf index.
Constraints
- Bit
khas weight2 ** k.
Hints
Hint 1
Sum each bit times its power of two.
Keywords
research-papersclassical-mlboostingcatboost
Python
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.