Complexity of pattern classes and the Lipschitz property

DOI10.1016/J.TCS.2007.03.047MaRDI QIDQ2381580zbMATH OpenOpenAlexFDO

Authors Amiran Ambroladze, Emilio Parrado-Hernández, John Shawe-Taylor

Publication date 18 September 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.03.047

zbMATH Keywords

Rademacher complexityLipschitz functionsempirical complexity

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Algorithmic Learning Theory
• Rademacher Margin Complexity
• 10.1162/153244303321897690
• scientific article; zbMATH DE number 1804106
• Local Rademacher complexities

Cites work

• scientific article; zbMATH DE number 49190 (Why is no real title available?)
• 10.1162/153244303321897690
• 10.1162/1532443041424300
• Distance-based classification with Lipschitz functions
• Empirical margin distributions and bounding the generalization error of combined classifiers
• Local Rademacher complexities
• Some comparisons for Gaussian processes

Cited in

(3)

• Rademacher Margin Complexity
• Algorithmic Learning Theory
• Asymptotic sequential Rademacher complexity of a finite function class

This page was built for publication: Complexity of pattern classes and the Lipschitz property

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