CatBoost-inspired gradient boosting in pure Python with a numba backend
Project description
chimeraboost
What if CatBoost was slightly worse, 4× faster, and all in Python?
📖 Documentation: bbstats.github.io/chimeraboost
- Installation
pip install chimeraboost
- Sample code:
from chimeraboost import ChimeraBoostClassifier, ChimeraBoostRegressor
# classification (n_ensembles=8 is the benchmarked accuracy mode; avoid 2)
clf = ChimeraBoostClassifier(early_stopping=True, n_ensembles=8)
clf.fit(X, y, cat_features=[0, 1], sample_weight=w)
proba = clf.predict_proba(X_test)
# regression (RMSE, MAE, or Quantile)
reg = ChimeraBoostRegressor(loss="Quantile", alpha=0.9, early_stopping=True, n_ensembles=8)
reg.fit(X, y)
-
What?
- Exceedingly opinionated GBDT library that only depends on common Python libraries
- Categorical features (catboost-like processing) and sample weights
- Bagging as a first-class feature (
n_ensembles) - Automatic early stopping, with optional grouped splitting for the validation set
- Supports regression, quantile regression, binary and multiclass classification
- Exact SHAP explanations (
model.shap_values(X)) — interventional TreeSHAP computed exactly thanks to the oblivious tree structure
- Exceedingly opinionated GBDT library that only depends on common Python libraries
-
Tuning tips
- Interaction-heavy regression: raise
depthto 8–10 (default 6 is conservative to protect small data).
- Interaction-heavy regression: raise
-
Inspirations / Citations
- CatBoost — Prokhorenkova et al., NeurIPS 2018 — ordered boosting, ordered target statistics, oblivious trees
- XGBoost — Chen & Guestrin, KDD 2016 — regularized objective, Newton leaf estimation, column subsampling
- LightGBM — Ke et al., NeurIPS 2017 — histogram-based split finding
- Linear-leaf trees — Shi et al., IJCAI 2019 (arXiv:1802.05640) — piece-wise-linear regression trees (
linear_leaves) - TreeSHAP — Lundberg et al., Nature Machine Intelligence 2020 (orig. SHAP, NeurIPS 2017) — exact additive feature attributions (
shap_values) - OpenFE — Zhang et al., ICML 2023 (arXiv:2211.12507) — automated pairwise feature generation (
cross_features) - TabArena — Erickson et al., NeurIPS 2025 (arXiv:2506.16791) — tabular benchmark used for evaluation
-
Why?
- I want to be able to modify my GBDT library at will
- I know Python and I don't know C
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
chimeraboost-0.16.1.tar.gz
(102.4 kB
view details)
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file chimeraboost-0.16.1.tar.gz.
File metadata
- Download URL: chimeraboost-0.16.1.tar.gz
- Upload date:
- Size: 102.4 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.13.13
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
961eb4bfbed9e15be6c5431720f4b8c5d0274e7bbc12d3d8201619c39d56eea7
|
|
| MD5 |
43d7deab9819779eab000c82ce5cd3b1
|
|
| BLAKE2b-256 |
0408e194c4a46eef9eebc1644e48cd2649487b1f7095d8878f8c76b5bf6c7a65
|
File details
Details for the file chimeraboost-0.16.1-py3-none-any.whl.
File metadata
- Download URL: chimeraboost-0.16.1-py3-none-any.whl
- Upload date:
- Size: 67.1 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.13.13
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
783ea64b34abe3a66f76adbb42fcda180136d1bade14623c306bc2d5680e2000
|
|
| MD5 |
dd88ba98694677894868a4cbef96bf9e
|
|
| BLAKE2b-256 |
045837900f28cfde337424f56711825963bbdc4f2649a204703ba0be67c1dc61
|