We present RandomMachine, an open-source Python library that extends classicalsecond-order (Newton) gradient boosting by randomly sampling the next base learner from auser-defined pool at each boosting iteration. Unlike standard gradient boosted trees, where ev-ery iteration adds a fresh clone of a single fixed model type, RandomMachine stochasticallymixes multiple learner families—LightGBM, CatBoost, XGBoost, and arbitrary sklearn-compatible estimators—according to per-model sampling probabilities. This randomisedselection increases ensemble diversity, acts as an implicit regulariser, and allows the user toleverage complementary inductive biases of different algorithms within a single coherent boost-ing procedure. We describe the algorithm, its theoretical motivation, and the software design,and report empirical results on synthetic regression and classification tasks demonstratingimprovements of 1.55 % in R2 on regression and 2.03 % in accuracy on binary classificationover three fixed-family baselines at comparable hyper-parameter budgets.
Ghiffary Rifqialdi (Tue,) studied this question.