Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jun-ichi Takeuchi. Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model. In Shuji Doshita, Koichi Furukawa, Klaus P. Jantke, Toyoaki Nishida, editors, Algorithmic Learning Theory, Third Workshop, ALT 92, Tokyo, Japan, October 20-22, 1992, Proceedings. Volume 743 of Lecture Notes in Computer Science, pages 208-219, Springer, 1992.

This author has not been identified. Look up 'Jun-ichi Takeuchi' in Google

runs on WebDSL