Pages that link to "Item:Q2583410"
From MaRDI portal
The following pages link to Complexities of convex combinations and bounding the generalization error in classification (Q2583410):
Displayed 3 items.
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder) (Q2373576) (← links)
- Analysis of boosting algorithms using the smooth margin function (Q2473080) (← links)
- Boosting with early stopping: convergence and consistency (Q2583412) (← links)