scientific article; zbMATH DE number 1445318
From MaRDI portal
zbMATH Open0956.68127MaRDI QIDQ4952633FDOQ4952633
Authors: Yi Li, Philip M. Long, Aravind Srinivasan 
Publication date: 10 May 2000
Title of this publication is not available (Why is that?)
Recommendations
- Improved bounds on the sample complexity of learning
- Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
- A general lower bound on the number of examples needed for learning
- scientific article; zbMATH DE number 2087696
- The optimal sample complexity of PAC learning
Cited In (20)
- Lower bound methods and separation results for on-line learning models
- Microchoice bounds and self bounding learning algorithms
- The sample complexity of learning linear predictors with the squared loss
- The optimal sample complexity of PAC learning
- Title not available (Why is that?)
- Characterizing the sample complexity of private learners
- Title not available (Why is that?)
- A general lower bound on the number of examples needed for learning
- Improved bounds on the sample complexity of learning
- Learning big (image) data via coresets for dictionaries
- The true sample complexity of active learning
- Improving the sample complexity using global data
- PAC-MDL bounds.
- Entropy samplers and strong generic lower bounds for space bounded learning
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- Refined error bounds for several learning algorithms
- The Learning Rate of lp -coefficient Regularized Shannon Sampling Algorithm
- On the sample complexity of weak learning
- Title not available (Why is that?)
- Computational sample complexity and attribute-efficient 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 Q4952633)
