Input
ExecutionExecution trigger that begins AdaBoost training
AI/ML/Classification
Fit/Train an AdaBoost classifier using multi-class SAMME boosting over shallow Decision Trees. Each learner focuses on the rows its predecessors got wrong, so boosting usually beats a single tree on weak signal, but it is far more sensitive to label noise and outliers than Random Forest. Estimators is a maximum, not a guarantee: boosting stops early once a learner is no better than random guessing.
Scores range from 0 to 10. Higher values mean more impact, exposure, or operational weight.
Execution trigger that begins AdaBoost training
Choose which backend supplies the training data
Maximum number of boosting rounds. Boosting stops early once a learner performs no better than random guessing, so the fitted model may hold fewer estimators than requested.
Shrinkage applied to each learner's vote. Must be positive. Values below 1 regularize the ensemble but need more estimators; 0.1 with 500 estimators is a common pairing.
Depth of each weak learner. AdaBoost is designed around shallow trees; 1 gives classic decision stumps. Deep base trees defeat the point of boosting and overfit quickly.
Seed for the base learner sampling. Fixing it makes the sampling reproducible. Note that the base trees are not bit-exact across processes: linfa resolves modal-class ties in hash-map iteration order, which Rust re-randomizes on every run.
Activated once training completes
Thread-safe handle to the trained AdaBoost classifier
Number of estimators actually retained after early stopping, which may be lower than the requested maximum