Randomized Gradient Boosting Machine
type: Item
instance of: scholarly article
title: Randomized Gradient Boosting Machine
zbMATH Open document ID: 1451.90122
DOI: 10.1137/18M1223277
author: Haihao Lu
author: Rahul Mazumder
published in: SIAM Journal on Optimization
publication date: 2020-10-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/1810.10158
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 68U01
zbMATH DE Number: 7258113
zbMATH Keywords: gradient boosting
zbMATH Keywords: ensemble methods
zbMATH Keywords: convex optimization
zbMATH Keywords: coordinate descent
zbMATH Keywords: computational guarantees
zbMATH Keywords: first order methods
describes a project that uses: XGBoost
describes a project that uses: L0Learn
describes a project that uses: LIBSVM
describes a project that uses: AdaBoost.MH
describes a project that uses: LightGBM
describes a project that uses: Scikit
describes a project that uses: randomForest
describes a project that uses: ElemStatLearn
describes a project that uses: TensorFlow
describes a project that uses: MLlib
describes a project that uses: Apache Spark
MaRDI profile type: Publication
arXiv ID: 1810.10158
cites work: On the Convergence of Block Coordinate Descent Type Methods
cites work: Q4001523
cites work: Q3093367
cites work: SLOPE-adaptive variable selection via convex optimization
cites work: Q3327527
cites work: A new condition number for linear programming
cites work: Logistic regression, AdaBoost and Bregman distances
cites work: Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
cites work: A new perspective on boosting in linear regression via subgradient optimization and relatives
cites work: A decision-theoretic generalization of on-line learning and an application to boosting
cites work: Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
cites work: Greedy function approximation: A gradient boosting machine.
cites work: Stochastic gradient boosting.
cites work: Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms
cites work: On the convergence of the coordinate descent method for convex differentiable minimization
cites work: Error bounds and convergence analysis of feasible descent methods: A general approach
cites work: MLlib: machine learning in Apache Spark
cites work: The Rate of Convergence of AdaBoost
cites work: Efficiency of coordinate descent methods on huge-scale optimization problems
cites work: Q5396710
cites work: Towards a deeper geometric, analytic and algorithmic understanding of margins
cites work: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
cites work: Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
cites work: A Primal-Dual Convergence Analysis of Boosting
cites work: Coordinate descent algorithms
cites work: Boosting with early stopping: convergence and consistency
OpenAlex ID: W3091997330
Recommended article: Random gradient boosting for predicting conditional quantiles
Recommended article: Stochastic gradient boosting.
Recommended article: Stochastic boosting algorithms
Recommended article: Accelerated gradient boosting
Recommended article: Randomized machine learning procedures
Recommended article: Optimization by Gradient Boosting
Recommended article: Ensemble of fast learning stochastic gradient boosting
description: scientific article; zbMATH DE number 7258113