Fully corrective boosting with arbitrary loss and regularization

DOI10.1016/J.NEUNET.2013.07.006zbMATH Open1297.68206OpenAlexW1991849741WikidataQ45958806 ScholiaQ45958806MaRDI QIDQ460675FDOQ460675

Authors: Chunhua Shen, Hanxi Li, Anton van den Hengel 

Publication date: 14 October 2014

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2440/78929

Recommendations

• Boosting as a regularized path to a maximum margin classifier
• scientific article; zbMATH DE number 2089370
• On the Bayes-risk consistency of regularized boosting methods.
• Boosting as a kernel-based method
• Statistical behavior and consistency of classification methods based on convex risk minimization.

zbMATH Keywords

boostingconvex optimizationensemble learningcolumn generation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Convex programming (90C25) Pattern recognition, speech recognition (68T10)

Cites Work

• Algorithm 778: L-BFGS-B
• Greedy function approximation: A gradient boosting machine.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Statistical comparisons of classifiers over multiple data sets
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Boosting with early stopping: convergence and consistency
• Boosting as a regularized path to a maximum margin classifier
• Prediction Games and Arcing Algorithms
• Improved boosting algorithms using confidence-rated predictions
• Soft margins for AdaBoost
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory of the learnable
• The \(F_{\infty}\)-norm support vector machine
• Linear programming boosting via column generation
• Efficient margin maximizing with boosting
• Title not available (Why is that?)
• Deformation of log-likelihood loss function for multiclass boosting
• Entropy Regularized LPBoost

Cited In (2)

• Learned-loss boosting
• Solving multiscale elliptic problems by sparse radial basis function neural networks

Uses Software

• L-BFGS-B
• UCI-ml
• Mosek
• foba

This page was built for publication: Fully corrective boosting with arbitrary loss and regularization

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