Learning under uniform distribution

1. A.Blumer,A.Ehrenfeucht,D.Haussler,M.Warmuth Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension Proc. 18th Acm Symposium on Theory of Computing (1987).

   Google Scholar 

2. P.Berman,R.Roos Learning one-counter languages in polynomial time Proc. 28th Symposium on Foundations of Computer Science (1987).

   Google Scholar 

3. A.Ehrenfeucht, D.Haussler,M.Kearns,L.Valiant A general lower bound on the number of examples needed for learning Information and Computation (1988).

   Google Scholar 

4. W.Feller An introduction to probability theory and its applications Vol.1 Wiley and Sons (1971).

   Google Scholar 

5. D.Haussler Quantifying inductive bias: AI learning and Valiant's learning framework Artificial Intelligence, 36 (1988).

   Google Scholar 

6. M.Kearns,M.Li,L.Pitt,L.G.Valiant On the learnability of boolean formulae Proc.19th Acm Symposium on Theory of Computing (1987).

   Google Scholar 

7. N.Linial,Y.Mansour,R.L.Rivest Results on learnability and Vapnik Chervonenkis dimension Proc. 29th Symposium on Foundations of Computer Science (1988).

   Google Scholar 

8. N.Littlestone Learning quickly when irrelevant attributes abound: a new linear threshold algorithm Machine learning 2,(4) (1988).

   Google Scholar 

9. T.M.Mitchell Generalization as search Artificial Intelligence, 18 (1982).

   Google Scholar 

10. B.K.Natarajan On learning boolean functions Proc. 19th Symposium on Theory of Computing (1987).

    Google Scholar 

11. L.G.Valiant A theory of learnable Comm.Acm, 27,(11) (1984).

    Google Scholar 

12. V.Vapnik,A.Y.Chervonenkis On the uniform convergence of relative frequencies of events to their probabilities Theor. Prob. and Appl., 16, (2) (1971).

    Google Scholar 

Download references