Sciweavers

180 search results - page 1 / 36
» Improved bounds on the sample complexity of learning
Sort
View
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 6 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
COLT
2008
Springer
13 years 6 months ago
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 believed that active learning does not help, we sh...
Maria-Florina Balcan, Steve Hanneke, Jennifer Wort...
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
14 years 1 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
PRIS
2004
13 years 6 months ago
Neural Network Learning: Testing Bounds on Sample Complexity
Several authors have theoretically determined distribution-free bounds on sample complexity. Formulas based on several learning paradigms have been presented. However, little is kn...
Joaquim Marques de Sá, Fernando Sereno, Lu&...