MSBoost: Using Model Selection with Multiple Base Estimators for Gradient Boosting
Gradient boosting is a widely used machine learning algorithm for tabular regression, classification and ranking. Although, most of the open source implementations of gradient boosting such as XGBoost, LightGBM and others have used decision trees as the sole base estimator for gradient boosting. This paper, for the first time, takes an alternative path of not just relying on a static base estimator (usually decision tree), and rather trains a list of models in parallel on the residual errors of the previous layer and then selects the model with the least validation error as the base estimator for a particular layer. This paper has achieved state-of-the-art results when compared to other gradient boosting implementations on 50+ tabular regression and classification datasets. Furthermore, ablation studies show that MSBoost is particularly effective for small and noisy datasets. Thereby, it has a significant social impact especially in tabular machine learning problems in the domains where it is not feasible to obtain large high quality datasets.
Code (1)
Tasks
ClassificationModel Selectionregressiontabular-classificationtabular-regressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Revisiting Score Function Estimators for $k$-Subset Sampling
Are score function estimators an underestimated approach to learning with $k$-subset sampling? Sampling $k$-subsets is a fundamental operation in many machine learning tasks that is not amenable to differentiable paramet…
feature selectionVariational InferenceA Machine Learning Approach to DoA Estimation and Model Order Selection for Antenna Arrays with Subarray Sampling
In this paper, we study the problem of direction of arrival estimation and model order selection for systems employing subarray sampling. Thereby, we focus on scenarios, where the number of active sources is not smaller …
Direction of Arrival EstimationModel SelectionGradient Estimation with Stochastic Softmax Tricks
The Gumbel-Max trick is the basis of many relaxed gradient estimators. These estimators are easy to implement and low variance, but the goal of scaling them comprehensively to large combinatorial distributions is still o…
Improving Discrete Optimisation Via Decoupled Straight-Through Gumbel-Softmax
Discrete representations play a crucial role in many deep learning architectures, yet their non-differentiable nature poses significant challenges for gradient-based optimization. To address this issue, various gradient …
A Rule for Gradient Estimator Selection, with an Application to Variational Inference
Stochastic gradient descent (SGD) is the workhorse of modern machine learning. Sometimes, there are many different potential gradient estimators that can be used. When so, choosing the one with the best tradeoff between …
Variational Inference