Improved Bounds on the Sample Complexity of Learning

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.62, Iss.3, 2001-05, pp. : 516-527

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension

By Haussler D.

Machine Learning, Vol. 14, Iss. 1, 1994-01 ,pp. : 83-113

Springer Publishing Company

Access to resources Recommend Favorite

Bounds on the sample complexity for private learning and private data release

By Beimel Amos Brenner Hai Kasiviswanathan Shiva Nissim Kobbi

Machine Learning, Vol. 94, Iss. 3, 2014-03 ,pp. : 401-437

Springer Publishing Company

Access to resources Recommend Favorite

Sample size lower bounds in PAC learning by Algorithmic Complexity Theory

By Apolloni B. Gentile C.

Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. : 141-162

Elsevier

Access to resources Recommend Favorite

Improved Bounds on Quantum Learning Algorithms

By Atici Alp Servedio Rocco

Quantum Information Processing, Vol. 4, Iss. 5, 2005-11 ,pp. : 355-386

Springer Publishing Company

Access to resources Recommend Favorite

The true sample complexity of active learning

By Balcan Maria-Florina

Machine Learning, Vol. 80, Iss. 2-3, 2010-09 ,pp. : 111-139

Springer Publishing Company

Access to resources Recommend Favorite