MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Localized Rademacher Complexities." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

10 documents found, showing 1 through 10.

ATOM

Local Rademacher complexities
by Peter L. Bartlett, Olivier Bousquet, Shahar Mendelson — 2002 — Annals of Statistics
…Local Rademacher Complexities Peter L. Bartlett Department of Statistics and Division of Computer…
Cited by 49 (16 self) – Add To MetaCart

DISCUSSION: LOCAL RADEMACHER COMPLEXITIES AND ORACLE INEQUALITIES IN RISK MINIMIZATION
by Stéphan Clémençon, Gábor Lugosi, Nicolas Vayatis
… RADEMACHER COMPLEXITIES AND ORACLE INEQUALITIES IN RISK MINIMIZATION BY STÉPHAN CLÉMENÇON, GÁBOR LUGOSI 1…
Add To MetaCart

Some local measures of complexity of convex hulls and generalization bounds
by Olivier Bousquet, Vladimir Koltchinskii, Dmitriy Panchenko — 2002 — Proceedings of the 15th Annual Conference on Computational Learning Theory
… on generalization error in terms of localized Rademacher complexities. This allows us to prove new results about…
Cited by 11 (3 self) – Add To MetaCart

Model selection by resampling penalization
by Sylvain Arlot, Inria Futurs, Projet Select — 2007
… lead to penalties close in spirit to local Rademacher complexities (the link between global Rademacher…
Cited by 1 (1 self) – Add To MetaCart

Submitted to the Annals of Statistics MARGIN-ADAPTIVE MODEL SELECTION IN STATISTICAL LEARNING
by Sylvain Arlot, Peter L. Bartlett
…, in a very general framework, that some penalization procedures (including local Rademacher complexities…
Add To MetaCart

Learning bounds for kernel regression using effective data dimensionality
by Tong Zhang — 2005 — Neural Computation
… and localized Rademacher complexity measures by Bartlett et al. (2002). This approach simplifies more…
Cited by 3 (0 self) – Add To MetaCart

1 Relating Empirical and Real Structures: Additive and Multiplicative Results
by Peter L. Bartlett, Shahar Mendelson — 2006
…Local Rademacher Complexities and Empirical Minimization Peter L. Bartlett Computer Science…
Add To MetaCart

Mathematical Modelling of Generalization
by Martin Anthony
…(h) + Rademacher Complexity For z ∈ Z n , E sup f∈F � 8 n (ln N∞(H, � � 2 γ/2, 2n)) + ln . (5) δ � � 2n −1 � n i=1…
Add To MetaCart

On the complexity of learning the kernel matrix
by Olivier Bousquet, Daniel J. L. Herrmann — 2003 — In Advances in Neural Information Processing Systems 15
… Machines. We provide generalization error bounds by estimating the Rademacher complexities…
Cited by 44 (1 self) – Add To MetaCart

Computable shell decomposition bounds
by John Langford, David Mcallester, Pack Kaelbling, David Cohn — 2000 — In Proceedings of the International Conference on Computational Learning Theory
… for the removal of slack from these more sophisticated bounds. Indeed, various localized Rademacher complexity…
Cited by 8 (0 self) – Add To MetaCart

Showing 1 through 10.

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB