A new accelerated proximal boosting machine with convergence rate O(1/t^2)
DOI10.1007/S12190-021-01684-WzbMATH Open1499.68311OpenAlexW4200583499MaRDI QIDQ2103099FDOQ2103099
Jinxiang Li, Fu-Sheng Wang, Na Zhen, Yiming Yang
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
Recommendations
convergence rateboosting machinecorrected pseudo-residualmomentum sequenceproximal boosting algorithm
Nonparametric regression and quantile regression (62G08) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- A decision-theoretic generalization of on-line learning and an application to boosting
- MLlib: machine learning in Apache Spark
- Title not available (Why is that?)
- Greedy function approximation: A gradient boosting machine.
- Introductory lectures on convex optimization. A basic course.
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- A Primal-Dual Convergence Analysis of Boosting
- Boosting with early stopping: convergence and consistency
- Arcing classifiers. (With discussion)
- Boosting With theL2Loss
- Prediction Games and Arcing Algorithms
- Stochastic gradient boosting.
- Accelerated gradient boosting
- Randomized Gradient Boosting Machine
- Boosting a weak learning algorithm by majority
- Logistic regression, AdaBoost and Bregman distances
- Title not available (Why is that?)
- Population theory for boosting ensembles.
- Title not available (Why is that?)
Uses Software
This page was built for publication: A new accelerated proximal boosting machine with convergence rate \(O(1/t^2)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103099)