MP-Boost boosts accuracy faster and more interpretable than AdaBoost.
problem Developing a faster, more interpretable boosting method.
method Adaptive selection of minipatches (small subsets of instances and features) at each iteration.
result Achieves comparable accuracy to AdaBoost and gradient boosting but faster and more interpretable.
ABHT boosts regression by filtering regions with different smoothness.
problem Improving regression performance through local adaptivity.
method Gradient boosting with adaptive histogram transform.
result ABHT converges faster than PEHT in Hölder continuous spaces.
Fair MP-Boost improves fairness and interpretability in boosting methods.
problem Improving fairness and interpretability in boosting methods.
method Fair MP-Boost uses adaptive sampling of minipatches to balance accuracy and fairness.
result Fair MP-Boost enhances fairness and accuracy while providing interpretable feature importance.
This paper examines the role and efficiency of the non-convex loss functions for binary classification problems. In particular, we investigate how to design a simple and effective boosting algorithm that is robust to the outliers in the data. The analysis of the role of a particular non-convex loss for prediction accur…
Recent work has extended the theoretical analysis of boosting algorithms to multiclass problems and to online settings. However, the multiclass extension is in the batch setting and the online extensions only consider binary classification. We fill this gap in the literature by defining, and justifying, a weak learning…
Python library for boosting statistical relational models.
problem Expressing learning and inference problems in statistical relational models.
method Adapting scikit-learn interface for boosted statistical relational models.
result Provides examples for using srlearn.
Paper explores methods to improve web search ranking.
problem Improving web search ranking accuracy with varied test data.
method Model Interpolation and Boosting Algorithm.
result Model Interpolation achieves best results on open test sets.
Boosting ridge regression for high-dimensional data classification reduces computational cost and improves learning time.
problem High computational demand of inverting regularised covariance matrix in ridge regression for high-dimensional problems.
method Train an ensemble of ridge regressors in randomly projected subspaces, then combine them using adaptive boosting.
result Effective in terms of learning time and improved predictive performance in some cases.
Ant colonies and boosting algorithms both reduce bias and variance through adaptive mechanisms.
problem Understanding the mathematical principles behind ensemble learning and ant colony behavior.
method Developed a formal mapping between AdaBoost's adaptive reweighting and ant recruitment dynamics.
result Proved that the fundamental theorem of weak learnability has a direct analog in colony decision-making.
The paper provides convergence guarantees for multicalibration gradient boosting.
problem Understanding the convergence properties of multicalibration gradient boosting.
method Computational guarantees for multicalibration gradient boosting algorithms, including adaptive variants.
result The magnitude of successive prediction updates decays at O ( 1 / T ) O(1/\sqrt{T}) O ( 1/ T ) , leading to convergence in empirical multicalibration error. New algorithm improves convergence of gradient boosting trees.
problem Global convergence of Newton boosting in tabular machine learning.
method Introduces Gradient Regularized Newton Descent for GBDTs, proving linear convergence for smooth, strongly convex losses and O ( 1 k 2 ) \mathcal{O}(\frac{1}{k^2}) O ( k 2 1 ) rate for general convex losses. result Achieves globally convergent second-order GBDT algorithm with rate matching first-order boosting.
Boosting Variational Inference improves posterior approximations with adaptive step-sizes.
problem Limited resources hinder the widespread adoption of Boosting Variational Inference.
method Characterized global curvature impact, introduced local curvature, and developed an approximate backtracking algorithm.
result New theoretical convergence rates and experimental validation demonstrate improved performance.
Gradient boosting adapted for multi-label and multi-output tasks.
problem Joint prediction of multiple classification or regression outputs.
method Gradient tree boosting with random output projections.
result Random projection improves adaptation to different output correlation patterns.
sGBM speeds up gradient boosting by parallelizing and adapting base learners.
problem Infeasibility of parallelizing GBM training and sub-optimal performance in online settings.
method Integrates multiple differentiable base learners, jointly optimizing them with linear speed-up.
result sGBM achieves higher time efficiency and better accuracy than traditional GBM.
agtboost speeds up gradient tree boosting with automatic complexity adjustment.
problem Speeding up and simplifying gradient tree boosting computations.
method Adaptive gradient tree boosting with automatic complexity adjustment and feature importance.
result Significant decrease in computation time and simplification of model complexity.
Boosting method for causal SEMs from observational data.
problem Learning causal order among variables from observational data.
method Boosting-based approach with early stopping and component-wise gradient descent.
result Boosting with early stopping consistently favors the true causal ordering.
A new gradient tree boosting framework reduces variance and accelerates performance.
problem High variance in stochastic gradient boosting.
method Combining gradient tree boosting with importance sampling and a regularizer.
result Achieves a linear convergence rate on logistic loss and 2.5x--18x acceleration on LogitBoost and LambdaMART.
We present a new online boosting algorithm for adapting the weights of a boosted classifier, which yields a closer approximation to Freund and Schapire's AdaBoost algorithm than previous online boosting algorithms. We also contribute a new way of deriving the online algorithm that ties together previous online boosting…
We study the task of online boosting--combining online weak learners into an online strong learner. While batch boosting has a sound theoretical foundation, online boosting deserves more study from the theoretical perspective. In this paper, we carefully compare the differences between online and batch boosting, and pr…
Proposes a Gradient Boosting method for learning adaptive kernel functions.
problem Learning a versatile ensemble of kernel functions for better performance.
method Approximates kernel functions as a weighted sum of Random Fourier Features and optimizes their barycenter at each iteration.
result Shows improved performance compared to Boosting-based and kernel-learning methods.
FGBoost boosts gradient boosting for complex data.
problem Gradient boosting struggles with non-Euclidean data.
method Introduces FGBoost for geodesic metric spaces.
result FGBoost performs well on complex data.
CoLoRA leverages task similarity to boost fine-tuning efficiency.
problem Efficiently fine-tuning large foundation models with scarce labeled data.
method CoLoRA trains a shared adapter for task similarity and personalized adapters for user-specific tasks.
result CoLoRA significantly boosts fine-tuning performance when tasks are similar.
Boosting algorithm improved by DRO framework for financial prediction.
problem Improving boosting algorithms for robust financial prediction.
method Proposes DRO-Boosting algorithm to solve DRO formulation.
result DRO-Boosting algorithm recovers AdaBoost and performs well on financial data.
This paper introduces Deep Incremental Boosting, a new technique derived from AdaBoost, specifically adapted to work with Deep Learning methods, that reduces the required training time and improves generalisation. We draw inspiration from Transfer of Learning approaches to reduce the start-up time to training each incr…
Simulation study evaluates tree-based imputation methods for multi-level data.
problem Ignoring dependencies in hierarchical data can compromise imputation accuracy.
method Chained Random Forests and Extreme Gradient Boosting (mixgb) adapted for multi-level data.
result Adapted boosting methods outperform traditional MICE for Level-1 variables at higher missingness rates.
AF improves classification models by adaptively weighting trees.
problem Improving classification model performance.
method AF combines OP2T for input-dependent weights and MIO for dynamic refinement.
result AF consistently outperforms RF, XGBoost, and other weighted RF.
Gradient boosting adapted for vector inputs.
problem Applying gradient boosting to multi-class classification problems.
method Extended gradient boosting framework to vector inputs using histogram-based decision trees.
result Efficient algorithm for vector-valued objectives.
Enhanced Random Forests outperform XGBoost across binary classification datasets.
problem Improving performance of Random Forests in binary classification.
method Adaptive sample and model weighting, iterative algorithm for sample weights, personalized tree weighting schemes.
result Significantly outperforms XGBoost across 15 binary classification datasets.
LoBoost improves local conformal prediction for gradient-boosted trees without extra data splits.
problem Quantifying uncertainty in gradient-boosted tree predictions.
method Model-native local conformal prediction using leaf structure.
result Competitive interval quality and improved test MSE with large calibration speedups.
New algorithms improve boosting by optimizing chance-corrected measures.
problem Improving boosting algorithms to use chance-corrected measures effectively.
method Developed new algorithms (AdaBook and Multibook) that optimize chance-corrected measures.
result AdaBook and Multibook outperform standard Multiboost or AdaBoost in multiclass situations.
Recently, Factorization Machines (FM) has become more and more popular for recommendation systems, due to its effectiveness in finding informative interactions between features. Usually, the weights for the interactions is learnt as a low rank weight matrix, which is formulated as an inner product of two low rank matri…
LiteMORT reduces memory usage for GBDT models by 30% with improved accuracy.
problem Memory inefficiency in GBDT models, especially with adaptive compact distributions.
method Share memory, implicit merging, adaptive histogram resizing.
result Significant reduction in memory usage with improved accuracy.
GBMixed boosts mixed models for clustered data, estimating mean and variance flexibly.
problem Flexible estimation of mean and variance components in clustered data.
method Gradient Boosting framework for linear mixed models with likelihood-based gradients.
result GBMixed accurately recovers complex nonlinear fixed effects and covariances.
We consider the multi-label ranking approach to multi-label learning. Boosting is a natural method for multi-label ranking as it aggregates weak predictions through majority votes, which can be directly used as scores to produce a ranking of the labels. We design online boosting algorithms with provable loss bounds for…
Package implements ABC-Boost for multi-class classification.
problem Improving accuracy in multi-class classification.
method Combines histogram-based binning and explicit gain formula for efficient tree splitting.
result ABC-Boost significantly improves multi-class classification accuracy.
Boosting improves data fitting while maintaining fairness guarantees.
problem Ensuring fairness in data preprocessing.
method Boosting algorithm to learn sufficient statistics of exponential families.
result The learned distribution maintains fairness guarantees while fitting the data better.
PathBoost boosts graph-level predictions using path-based features.
problem Graph-level classification and regression challenges.
method Gradient tree boosting method for graph-level prediction.
result PathBoost outperforms graph neural networks and graph kernel approaches in many cases.
Better boosting with bandits improves probability estimation in online learning.
problem Poor calibration of probability estimates from boosting ensembles in online learning.
method Use bandit optimization to decide between updating ensemble or calibrator parameters.
result Superior performance in probability estimation compared to uncalibrated and naively-calibrated online boosting.
Boosting techniques improved uplift modeling performance.
problem Predicting causal effects of actions on individuals.
method Adapted boosting techniques to uplift modeling.
result Proposed algorithms improved performance of base models.
BAE uses boosting to improve autoencoder ensembles for robust outlier detection.
problem Overfitting in autoencoders limits their effectiveness in unsupervised outlier detection.
method Boosting-based Autoencoder Ensemble (BAE) trains autoencoders sequentially with weighted sampling to reduce outliers and inject diversity.
result BAE outperforms state-of-the-art approaches in various outlier detection conditions.
Gradient Boosted Mixed Models estimate mean and variance components for clustered data.
problem Limited flexibility in linear mixed models for complex settings.
method Gradient Boosting extended to mixed models with likelihood-based gradients and flexible base learners.
result Accurate recovery of variance components and improved predictive accuracy.
Boosted decision trees enjoy popularity in a variety of applications; however, for large-scale datasets, the cost of training a decision tree in each round can be prohibitively expensive. Inspired by ideas from the multi-arm bandit literature, we develop a highly efficient algorithm for computing exact greedy-optimal d…
Paper proposes adaptive margin loss to improve few-shot learning.
problem Few-shot learning's difficulty in generalizing from a few examples.
method Develops class-relevant and task-relevant additive margin losses.
result Boosts performance of metric-based meta-learning approaches.
Boosting method adapted for non-square loss functions.
problem Applying gradient boosting to non-square loss functions.
method Introducing column measure ν^(L_2) to adapt L2-Boosting for different loss functions.
result L2-Boosting can be modified to select variables according to different loss functions.
Logitboost is an influential boosting algorithm for classification. In this paper, we develop robust logitboost to provide an explicit formulation of tree-split criterion for building weak learners (regression trees) for logitboost. This formulation leads to a numerically stable implementation of logitboost. We then pr…
Boosting Nyström improves accuracy of matrix approximations.
problem Generating low-rank approximations of large matrices efficiently.
method Iteratively generate multiple weak Nyström approximations, combine them to form a strong approximation.
result Boosting Nyström yields more efficient and accurate low-rank approximations.
Boosting methods for interval-censored data improve predictive accuracy in survival analysis.
problem Handling interval-censored data in survival analysis and time-to-event studies.
method Nonparametric boosting methods using censoring unbiased transformations and functional gradient descent.
result Effective boosting methods for regression and classification with interval-censored data, offering robust performance.
Online boosting for multilabel ranking with limited feedback.
problem Multilabel ranking with top-k feedback.
method Surrogate loss function and unbiased estimator for weak learners.
result Adapted full information multilabel ranking algorithms to top-k feedback setting with theoretical and experimental support.