Stochastic boosting algorithms

DOI10.1007/s11222-010-9173-4zbMath1255.62177OpenAlexW2030606330MaRDI QIDQ5917853

Ajay Jasra, Christopher C. Holmes

Publication date: 31 December 2012

Published in: Statistics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11222-010-9173-4

zbMATH Keywords

Bayesian statisticssequential Monte Carlo

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Bayesian inference (62F15) Monte Carlo methods (65C05) Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• BayesTree
• AdaBoost.MH
• BartPy

Cites Work

• Unnamed Item
• Unnamed Item
• BART: Bayesian additive regression trees
• Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
• Boosting algorithms: regularization, prediction and model fitting
• 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)
• Generalization bounds for averaged classifiers
• Process consistency for AdaBoost.
• Boosting with early stopping: convergence and consistency
• Sequential Monte Carlo Methods in Practice
• Sequential Monte Carlo Samplers
• Improving ideals by means of quadratic transformations
• Boosting With theL₂Loss
• Probabilistic Forecasts, Calibration and Sharpness
• Random forests
• Stochastic gradient boosting.

This page was built for publication: Stochastic boosting algorithms