This package is an easy-to-use tool to train optimal model ensembles. Simply provide predictions from each of your models, and easy-ensemble will learn the optimal weights for combining them.
The easiest way to get started is by cloning the repository and installing it in your Python environment:
git clone https://github.com/iancovert/easy-ensemble.git
cd easy-ensemble
pip install .The usage pattern follows scikit-learn semantics: all you need to do is set up the ensemble object, fit it to your data using the fit() function, and then apply it using the predict() function.
A basic example looks like this:
from ensemble import Ensemble
# Prepare data and models
X_train, Y_train = ...
X_val, Y_val = ...
X_test, Y_test = ...
models = ...
# Fit ensemble with log-loss objective and non-negative ensemble weights
ensemble = Ensemble('binary:logloss_logits', 'nonnegative')
preds = [model.predict(X_val) for model in models]
ensemble.fit(preds, Y_val)
# Apply ensemble
ensemble.predict([model.predict(X_test) for model in models])For detailed examples, please see the following notebooks:
- Binary classification using the adult dataset (notebook)
- Regression using the boston housing dataset (notebook)
After training multiple models for a machine learning task, the most common next steps are model selection (identifying the best single model) or ensembling (combining the models). Ensembling can perform better by letting the models correct each other's mistakes, especially when the models are diverse or decorrelated (e.g., they're from different model classes). In the simplest version of ensembling, the predictions are simply averaged, but it makes sense to weight the models differently when some are more accurate than others.
This package provides a simple way to learn the optimal weights for your ensemble. And because such ensembles can overfit, you can set constraints on the learned weights. The constraint options are:
'nonnegative': the weights cannot have negative values'simplex': the weights must be in the probability simplex (non-negative and sum to one)'none': the weights are unconstrained (note that the weights may become large when using correlated models)
Additionally, you can optimize your ensemble using a couple different loss functions. The options currently supported are:
'reg:mse': mean squared error loss'binary:logloss_probs': log-loss for binary classification, with ensembling performed on the probabilities'binary:logloss_logits': log-loss for binary classification, with ensembling performed on the logits'multi:logloss_probs': log-loss for multi-class classification, with ensembling performed on the probabilities'multi:logloss_logits': log-loss for multi-class classification, with ensembling performed on the logits
The objective function and constraints are the two main arguments required when setting up your ensemble. For example, you might initialize your ensemble as follows:
from ensemble import Ensemble
ensemble = Ensemble('reg:mse', 'simplex')When your loss function is convex (e.g., mean squared error or log-loss), finding the optimal ensemble weights involves solving a convex optimization problem. Adding linear constraints to the ensemble weights does not affect the problem's convexity, but it does make finding the optimal solution a bit more difficult. Here, we find the optimal ensemble weights using sequential quadratic programming (SQP), which means that we solve a sequence of quadratic programs (QPs) that approximate the true objective around the current solution. To solve the underlying QPs, we use the excellent osqp package. You could instead find the optimal ensemble weights using projected gradient descent, but SQP is very fast and basically hyperparameter-free (no learning rate required).
If you have any questions about the package, feel free to email me at icovert@cs.washington.edu.