Efficient margin maximizing with boosting
From MaRDI portal
Recommendations
Cited in
(26)- A Real generalization of discrete AdaBoost
- Improved generalization through explicit optimization of margins
- A re-weighting strategy for improving margins
- A new maximum margin algorithm for one-class problems and its boosting implementation
- On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
- A precise high-dimensional asymptotic theory for boosting and minimum-\(\ell_1\)-norm interpolated classifiers
- Boosting as a kernel-based method
- On the doubt about margin explanation of boosting
- Analysis of boosting algorithms using the smooth margin function
- scientific article; zbMATH DE number 2086353 (Why is no real title available?)
- scientific article; zbMATH DE number 2089372 (Why is no real title available?)
- Boosting as a regularized path to a maximum margin classifier
- The dynamics of adaboost: cyclic behavior and convergence of margins
- Further results on the margin explanation of boosting: new algorithm and experiments
- scientific article; zbMATH DE number 2044159 (Why is no real title available?)
- Fully corrective boosting with arbitrary loss and regularization
- Learning Theory
- scientific article; zbMATH DE number 1931831 (Why is no real title available?)
- Different Paradigms for Choosing Sequential Reweighting Algorithms
- A selective boosting algorithm for maximizing the soft margin
- scientific article; zbMATH DE number 6253924 (Why is no real title available?)
- Boosting over non-deterministic ZDDs
- Soft margins for AdaBoost
- Linear programming boosting via column generation
- Multiclass classification with potential function rules: margin distribution and generalization
- Extended formulations via decision diagrams
This page was built for publication: Efficient margin maximizing with boosting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093332)
