Gradient Boosting Machine: A Survey

Danchen Lin; Mike Wu; Thomas Lau; Zhiyuan He

Gradient Boosting Machine: A Survey

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1908.06951 v1 pith:JCOG4RDR submitted 2019-08-19 stat.ML cs.LG

Gradient Boosting Machine: A Survey

Zhiyuan He , Danchen Lin , Thomas Lau , Mike Wu This is my paper

classification stat.ML cs.LG

keywords boostinggradientfunctionsurveyalgorithmsapplicationconstructionsdetail

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

In this survey, we discuss several different types of gradient boosting algorithms and illustrate their mathematical frameworks in detail: 1. introduction of gradient boosting leads to 2. objective function optimization, 3. loss function estimations, and 4. model constructions. 5. application of boosting in ranking.

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

From Handcrafted Features to Functional Edge Learning: Evolution of EEG Seizure Detection Frameworks
cs.LG 2026-06 unverdicted novelty 2.0

A review arguing that Kolmogorov-Arnold Networks address key limitations of deep learning models for EEG-based seizure detection through improved interpretability and efficiency.