A stochastic approximation view of boosting

DOI10.1016/J.CSDA.2007.06.020MaRDI QIDQ1020818zbMATH OpenOpenAlexFDO

Authors Chen-Hai Andy Tsao, Yuan-chin Ivan Chang

Publication date 2 June 2009

Published in Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.csda.2007.06.020

zbMATH Keywords

boostingstochastic approximationRobbins-Monro proceduresmooth early stopping

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Nonparametric regression and quantile regression (62G08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Stochastic approximation (62L20)

Recommendations

• Stochastic boosting algorithms
• Stochastic boosting algorithms
• Approximation stability and boosting
• Some theory for generalized boosting algorithms
• Stochastic approximation boosting for incomplete data problems
• The boosting approach to machine learning: an overview
• Boosted sampling
• scientific article; zbMATH DE number 2086343
• Boosting with Noisy Data: Some Views from Statistical Theory

Cites work

• scientific article; zbMATH DE number 976356 (Why is no real title available?)
• scientific article; zbMATH DE number 1950578 (Why is no real title available?)
• scientific article; zbMATH DE number 2121141 (Why is no real title available?)
• A Stochastic Approximation Method
• A decision-theoretic generalization of on-line learning and an application to boosting
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Boosting With theL₂Loss
• Boosting and instability for regression trees
• Boosting ridge regression
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Boosting with early stopping: convergence and consistency
• Greedy function approximation: A gradient boosting machine.
• Inverse boosting for monotone regression functions
• Knot selection by boosting techniques
• On weak base hypotheses and their implications for boosting regression and classification
• Parallelizing AdaBoost by weights dynamics
• Population theory for boosting ensembles.
• Prediction Games and Arcing Algorithms
• Process consistency for AdaBoost.
• Soft margins for AdaBoost
• Stochastic Estimation of the Maximum of a Regression Function
• Stochastic approximation
• Stochastic gradient boosting.

Cited in

(17)

• Boosted sampling
• A Bayesian boosting theorem
• Interpreting initial offset boosting via reconstitution in integral domain
• scientific article; zbMATH DE number 1966609 (Why is no real title available?)
• scientific article; zbMATH DE number 1977841 (Why is no real title available?)
• An empirical bias–variance analysis of DECORATE ensemble method at different training sample sizes
• scientific article; zbMATH DE number 6253924 (Why is no real title available?)
• Editorial: Machine learning and robust data mining
• scientific article; zbMATH DE number 2089370 (Why is no real title available?)
• SABoost
• Stochastic boosting algorithms
• Stochastic boosting algorithms
• Greedy function approximation: A gradient boosting machine.
• Using boosting to prune double-bagging ensembles
• Early stopping in \(L_{2}\)Boosting
• Taxonomy for characterizing ensemble methods in classification tasks: a review and annotated bibliography
• Algorithmic Learning Theory

Describes a project that uses

Uses Software

• AdaBoost.MH
• UsingR
• UCI

This page was built for publication: A stochastic approximation view of boosting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1020818)