A new accelerated proximal boosting machine with convergence rate \(O(1/t^2)\)

DOI10.1007/s12190-021-01684-wzbMath1499.68311OpenAlexW4200583499MaRDI QIDQ2103099

Jin-Xiang Li, Na Zhen, Yiming Yang, Fu-Sheng Wang

Publication date: 13 December 2022

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-021-01684-w

zbMATH Keywords

convergence rateboosting machinecorrected pseudo-residualmomentum sequenceproximal boosting algorithm

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• Scikit
• TensorFlow
• MLlib
• XGBoost
• LightGBM
• Apache Spark

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy function approximation: A gradient boosting machine.
• A decision-theoretic generalization of on-line learning and an application to boosting
• Introductory lectures on convex optimization. A basic course.
• 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.
• Boosting a weak learning algorithm by majority
• Accelerated gradient boosting
• Boosting with early stopping: convergence and consistency
• Boosting With theL₂Loss
• Randomized Gradient Boosting Machine
• A Primal-Dual Convergence Analysis of Boosting
• Prediction Games and Arcing Algorithms
• Stochastic gradient boosting.
• Logistic regression, AdaBoost and Bregman distances

This page was built for publication: A new accelerated proximal boosting machine with convergence rate \(O(1/t^2)\)