Multivariate Boosted Trees and Applications to Forecasting and Control
arXiv:2003.03835
Abstract
Gradient boosted trees are competition-winning, general-purpose, non-parametric regressors, which exploit sequential model fitting and gradient descent to minimize a specific loss function. The most popular implementations are tailored to univariate regression and classification tasks, precluding the possibility of capturing multivariate target cross-correlations and applying structured penalties to the predictions. In this paper, we present a computationally efficient algorithm for fitting multivariate boosted trees. We show that multivariate trees can outperform their univariate counterpart when the predictions are correlated. Furthermore, the algorithm allows to arbitrarily regularize the predictions, so that properties like smoothness, consistency and functional relations can be enforced. We present applications and numerical results related to forecasting and control.
References in corpus (5)
- Geometric deep learning: going beyond Euclidean data
- Efficient Computation of Sensitivity Coefficients of Node Voltages and Line Currents in Unbalanced Radial Electrical Distribution Networks
- N-BEATS: Neural basis expansion analysis for interpretable time series forecasting
- NGBoost: Natural Gradient Boosting for Probabilistic Prediction
- GBDT-MO: Gradient Boosted Decision Trees for Multiple Outputs