scientific article; zbMATH DE number 1804106

zbMATH Open0992.68106MaRDI QIDQ3148808FDOQ3148808

Authors: Peter L. Bartlett, Shahar Mendelson 

Publication date: 22 September 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2111/21110224

Title of this publication is not available (Why is that?)

Recommendations

• 10.1162/153244303321897690
• Local Rademacher complexities
• Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
• Rademacher penalties and structural risk minimization
• scientific article; zbMATH DE number 1552503

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cited In (26)

• Rademacher penalties and structural risk minimization
• Rademacher complexities and bounding the excess risk in active learning
• Learning with deep cascades
• Relative deviation learning bounds and generalization with unbounded loss functions
• Estimates of the approximation error using Rademacher complexity: Learning vector-valued functions
• Multilevel Fine-Tuning: Closing Generalization Gaps in Approximation of Solution Maps under a Limited Budget for Training Data
• VC dimension, fat-shattering dimension, Rademacher averages, and their applications
• An improved analysis of the Rademacher data-dependent bound using its self bounding property
• Title not available (Why is that?)
• Algorithmic Learning Theory
• Title not available (Why is that?)
• Local Rademacher complexities
• Researches on Rademacher complexities in statistical learning theory: a survey
• Transductive Rademacher Complexity and Its Applications
• Structure learning via unstructured kernel-based M-estimation
• Complexity of pattern classes and the Lipschitz property
• Matrixized learning machine with modified pairwise constraints
• Selective Rademacher penalization and reduced error pruning of decision trees
• Rademacher Chaos Complexities for Learning the Kernel Problem
• Complexity of approximating Hölder classes from information with varying Gaussian noise
• A Vector-Contraction Inequality for Rademacher Complexities
• Generalization bounds for learning weighted automata
• On the Rademacher complexity of weighted automata
• 10.1162/153244303321897690
• Targeted deep learning: framework, methods, and applications
• Aspects of discrete mathematics and probability in the theory of machine learning

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148808)