RandomMachine: Random Base-Learner Selection for Newton Gradient Boosting Ensembles

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. RandomMachineis available under the MIT license at https://github.com/ghiffaryr/randommachine.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-02-19
DOI
https://doi.org/10.5281/zenodo.18687465
Primary Topic
Stochastic Gradient Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

RandomMachine: Random Base-Learner Selection for Newton Gradient Boosting Ensembles

Ghiffary Rifqialdi
Zenodo (CERN European Organization for Nuclear Research)
Stochastic Gradient Optimization Techniques
article

RandomMachine: Random Base-Learner Selection for Newton Gradient Boosting Ensembles

Ghiffary Rifqialdi
article en

Abstract

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. RandomMachineis available under the MIT license at https://github.com/ghiffaryr/randommachine.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 54%
Stochastic Gradient Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

RandomMachine: Random Base-Learner Selection for Newton Gradient Boosting Ensembles — Ghiffary Rifqialdi · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS