Pages that link to "Item:Q2583410"

The following pages link to Complexities of convex combinations and bounding the generalization error in classification (Q2583410):

Displaying 8 items.

• Further results on the margin explanation of boosting: new algorithm and experiments (Q439827) (← links)
• Sparsity in penalized empirical risk minimization (Q838303) (← links)
• Concentration estimates for learning with unbounded sampling (Q1946480) (← links)
• A precise high-dimensional asymptotic theory for boosting and minimum-\(\ell_1\)-norm interpolated classifiers (Q2148995) (← links)
• 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)
• Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints (Q6038637) (← links)