paper-with-me

Papers

Automatic Gradient Boosting

2018-07-10 · Janek Thomas, Stefan Coors, Bernd Bischl

Automatic machine learning performs predictive modeling with high performing machine learning tools without human interference. This is achieved by making machine learning applications parameter-free, i.e. only a dataset is provided while the complete model selection and model building process is handled internally through (often meta) optimization. Projects like Auto-WEKA and auto-sklearn aim to solve the Combined Algorithm Selection and Hyperparameter optimization (CASH) problem resulting in huge configuration spaces. However, for most real-world applications, the optimization over only a few different key learning algorithms can not only be sufficient, but also potentially beneficial. The latter becomes apparent when one considers that models have to be validated, explained, deployed and maintained. Here, less complex model are often preferred, for validation or efficiency reasons, or even a strict requirement. Automatic gradient boosting simplifies this idea one step further, using only gradient boosting as a single learning algorithm in combination with model-based hyperparameter tuning, threshold optimization and encoding of categorical features. We introduce this general framework as well as a concrete implementation called autoxgboost. It is compared to current AutoML projects on 16 datasets and despite its simplicity is able to achieve comparable results on about half of the datasets as well as performing best on two.

📄 PDF Abstract BibTeX arXiv:1807.03873

Code (3)

ja-thomas/autoxgboost 공식 구현
ja-thomas/autoxgboostMC
pfistfl/autoxgboostMC

Tasks

AutoMLBIG-bench Machine LearningHyperparameter OptimizationModel Selection

Similar Papers 제목 키워드 기반

agtboost: Adaptive and Automatic Gradient Tree Boosting Computations

2020-08-28 · Berent Ånund Strømnes Lunde, Tore Selland Kleppe

agtboost is an R package implementing fast gradient tree boosting computations in a manner similar to other established frameworks such as xgboost and LightGBM, but with significant decreases in computation time and requ…

Feature Importance

An information criterion for automatic gradient tree boosting

2020-08-13 · Berent Ånund Strømnes Lunde, Tore Selland Kleppe, Hans Julius Skaug

An information theoretic approach to learning the complexity of classification and regression trees and the number of trees in gradient tree boosting is proposed. The optimism (test loss minus training loss) of the greed…

Model Selectionregression

MorphBoost: Self-Organizing Universal Gradient Boosting with Adaptive Tree Morphing

2025-11-17 · Boris Kriuk arxiv

Traditional gradient boosting algorithms employ static tree structures with fixed splitting criteria that remain unchanged throughout training, limiting their ability to adapt to evolving gradient distributions and probl…

Feature Importance

TF Boosted Trees: A scalable TensorFlow based framework for gradient boosting

2017-10-31 · Natalia Ponomareva, Soroush Radpour, Gilbert Hendry, Salem Haykal 외

TF Boosted Trees (TFBT) is a new open-sourced frame-work for the distributed training of gradient boosted trees. It is based on TensorFlow, and its distinguishing features include a novel architecture, automatic loss dif…

Morphological Classification of Extragalactic Radio Sources Using Gradient Boosting Methods

2023-04-25 · Abdollah Masoud Darya, Ilias Fernini, Marley Vellasco, Abir Hussain

The field of radio astronomy is witnessing a boom in the amount of data produced per day due to newly commissioned radio telescopes. One of the most crucial problems in this field is the automatic classification of extra…

AstronomyClassification