Optimization by Gradient Boosting
From MaRDI portal
Publication:5870986
DOI10.1007/978-3-030-73249-3_2OpenAlexW2736861147MaRDI QIDQ5870986
Publication date: 24 January 2023
Published in: Advances in Contemporary Statistics and Econometrics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.05023
Related Items (4)
Explainable subgradient tree boosting for prescriptive analytics in operations management ⋮ Infinitesimal gradient boosting ⋮ Accelerated gradient boosting ⋮ Gradient boosting for extreme quantile regression
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy function approximation: A gradient boosting machine.
- Boosting algorithms: regularization, prediction and model fitting
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
- Statistics for high-dimensional data. Methods, theory and applications.
- A decision-theoretic generalization of on-line learning and an application to boosting
- Arcing classifiers. (With discussion)
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Population theory for boosting ensembles.
- On the Bayes-risk consistency of regularized boosting methods.
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Boosting a weak learning algorithm by majority
- Weak greedy algorithms
- Boosting for high-dimensional linear models
- Boosting with early stopping: convergence and consistency
- Boosting With theL2Loss
- 10.1162/1532443041424319
- 10.1162/153244304773936108
- Matching pursuits with time-frequency dictionaries
- Convexity, Classification, and Risk Bounds
- Prediction Games and Arcing Algorithms
- Stochastic gradient boosting.
This page was built for publication: Optimization by Gradient Boosting
