论文信息 - Local Rademacher Complexities and Empirical Minimization - 字舞流文

Local Rademacher Complexities and Empirical Minimization

[1] M. Talagrand. Sharper Bounds for Gaussian and Empirical Processes , 1994 .

[2] Peter L. Bartlett,et al. Efficient agnostic learning of neural networks with bounded fan-in , 1996, IEEE Trans. Inf. Theory.

[3] Shahar Mendelson,et al. Improving the sample complexity using global data , 2002, IEEE Trans. Inf. Theory.

[4] A. Tsybakov,et al. Optimal aggregation of classifiers in statistical learning , 2003 .

[5] S. Mendelson. On weakly bounded empirical processes , 2005, math/0512554.

[6] Peter L. Bartlett,et al. Optimal Sample-Based Estimates of the Expectation of the Empirical Minimizer , 2005 .

[7] P. Bartlett,et al. Empirical minimization , 2006 .

[8] Michael I. Jordan,et al. Convexity, Classification, and Risk Bounds , 2006 .

[9] S. Mendelson,et al. Reconstruction and Subgaussian Operators in Asymptotic Geometric Analysis , 2007 .

[10] P. Bartlett. Fast Rates of Uniform Convergence and Oracle Inequalities for Model Selection , 2022 .