Sample complexity

The sample complexity of a machine learning algorithm represents the number of training-samples that it needs in order to successfully learn a target… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1988-2018
010020019882018

Related topics

Related topics

10 relations
Empirical risk minimizationNo free lunch in search and optimizationOnline machine learningProbably approximately correct learning
(More)

Broader (1)

Machine learning

Related mentions per year

Related mentions per year

1946-2019
1960198020002020
Sample complexity
Machine learning
Reinforcement learning
Semi-supervised learning
Online machine learning
VC dimension

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
The Sample Complexity of Revenue Maximization
In the design and analysis of revenue-maximizing auctions, auction performance is typically measured with respect to a prior… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The true sample complexity of active learning
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally… (More)
  • figure 1.1
  • figure 5.1
  • figure 5.2
  • figure 5.3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Coarse sample complexity bounds for active learning
We characterize the sample complexity of active learning problems in terms of a parameter which takes into account the specific… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
On the Sample Complexity of Reinforcement Learning Sham
  • Machandranath Kakade Gatsby
  • 2003
This thesis is a detailed investigation into the following question: how much data must an agent collect in order to perform… (More)
  • figure 2.5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
We consider the multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al… (More)
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Improved bounds on the sample complexity of learning
1 I n t r o d u c t i o n Many important applied problems can be modeled as learning from random examples. Examples include text… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The Sample Complexity of Pattern Classification with Neural Networks: The Size of the Weights is More Important than the Size of the Network
Sample complexity results from computational learning theory, when applied to neural network learning for pattern classification… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
On the Sample Complexity of Learning Bayesian Networks
In recent years there has been an increasing in­ terest in learning Bayesian networks from data. One of the most effective… (More)
  • figure 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
On the Relationship between Generalization Error, Hypothesis Complexity, and Sample Complexity for Radial Basis Functions
Feedforward networks together with their training algorithms are a class of regression techniques that can be used to learn to… (More)
Is this relevant?