Rademacher complexity

In computational learning theory (machine learning and theory of computation), Rademacher complexity, named after Hans Rademacher, measures richness… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2003-2018
0102020032018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In the framework of agnostic learning, one of the main open problems of the theory of multi-category pattern classification is… (More)
Is this relevant?
2016
2016
We analyze the local Rademacher complexity of empirical risk minimization-based multi-label learning algorithms, and in doing so… (More)
  • figure 1
  • table I
  • table II
  • figure 2
  • table IV
Is this relevant?
2015
2015
Great successes of deep neural networks have been witnessed in various real applications. Many algorithmic and implementation… (More)
Is this relevant?
2015
2015
In Machine Learning (ML), the learning process of an algorithm given a set of evidences is studied via complexity measures. The… (More)
  • figure 1
Is this relevant?
2013
2013
We use the notion of local Rademacher complexity to design new algorithms for learning kernels. Our algorithms thereby benefit… (More)
  • figure 1
  • figure 2
Is this relevant?
Review
2009
Review
2009
We propose to use Rademacher complexity, originally developed in computational learning theory, as a measure of human learning… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
2008
2008
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar… (More)
Is this relevant?
2007
2007
We develop a technique for deriving data-dependent error bounds for transductive learning algorithms based on transductive… (More)
  • figure 1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In the multi-view approach to semisupervised learning, we choose one predictor from each of multiple hypothesis classes, and we… (More)
  • figure 1
Is this relevant?
2006
2006
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H… (More)
Is this relevant?