New approaches to statistical learning theory
From MaRDI portal
Publication:1881402
zbMath1101.68076MaRDI QIDQ1881402
Publication date: 5 October 2004
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
Related Items (13)
Learning with Limited Samples: Meta-Learning and Applications to Communication Systems ⋮ Complexity regularization via localized random penalties ⋮ An oracle inequality for regularized risk minimizers with strongly mixing observations ⋮ Generalization bounds of ERM algorithm with Markov chain samples ⋮ Unnamed Item ⋮ Learning from regularized regression algorithms with \(p\)-order Markov chain sampling ⋮ Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains ⋮ The generalization performance of ERM algorithm with strongly mixing observations ⋮ Refined Rademacher Chaos Complexity Bounds with Applications to the Multikernel Learning Problem ⋮ The performance bounds of learning machines based on exponentially strongly mixing sequences ⋮ Semi-supervised learning based on high density region estimation ⋮ Learning from uniformly ergodic Markov chains ⋮ Adaptive learning rates for support vector machines working on data with low intrinsic dimension
This page was built for publication: New approaches to statistical learning theory
