The following pages link to (Q3046695):
Displaying 18 items.
- Differentiability of \(t\)-functionals of location and scatter (Q1020987) (← links)
- Rademacher complexity in Neyman-Pearson classification (Q1034311) (← links)
- Complexity regularization via localized random penalties (Q1879970) (← links)
- On the optimality of the empirical risk minimization procedure for the convex aggregation problem (Q1943331) (← links)
- Estimation from nonlinear observations via convex programming with application to bilinear regression (Q2002578) (← links)
- From Gauss to Kolmogorov: localized measures of complexity for ellipses (Q2199701) (← links)
- ERM and RERM are optimal estimators for regression problems when malicious outliers corrupt the labels (Q2209821) (← links)
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder) (Q2373576) (← links)
- Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets (Q2381815) (← links)
- Empirical risk minimization is optimal for the convex aggregation problem (Q2435238) (← links)
- Aspects of discrete mathematics and probability in the theory of machine learning (Q2478432) (← links)
- Concentration inequalities and asymptotic results for ratio type empirical processes (Q2497173) (← links)
- Complexities of convex combinations and bounding the generalization error in classification (Q2583410) (← links)
- Local Rademacher complexities (Q2583411) (← links)
- Boosting with early stopping: convergence and consistency (Q2583412) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- (Q4998937) (← links)
- Minimax rates for conditional density estimation via empirical entropy (Q6117050) (← links)
