Method for improving gradient boosting learning efficiency based on modified loss functions

DOI10.1134/S00051179220120074MaRDI QIDQ2691539zbMATH OpenOpenAlexFDO

Authors N. S. Korolev, O. V. Sen'ko

Publication date 29 March 2023

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s00051179220120074

zbMATH Keywords

data analysisdecision treegradient boostingloss functionmachine learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09)

Recommendations

• Greedy function approximation: A gradient boosting machine.
• Stochastic gradient boosting.
• Accelerated gradient boosting
• On a robust gradient boosting scheme based on aggregation functions insensitive to outliers
• Random gradient boosting for predicting conditional quantiles

Cites work

• Optimal convex correcting procedures in problems of high dimension
• Random forests
• Stochastic gradient boosting.
• Two-level regression method using ensembles of trees with optimal divergence

Cited in

(5)

• Extending models via gradient boosting: an application to Mendelian models
• Wavelet-based gradient boosting
• Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping
• A novel multi-scale loss function for classification problems in machine learning
• QBoost: an iteratively weighted adiabatic trained classifier

Describes a project that uses

Uses Software

• XGBoost
• CatBoost

This page was built for publication: Method for improving gradient boosting learning efficiency based on modified loss functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2691539)