Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model

Cite

Text

Takeuchi. "Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model." International Conference on Algorithmic Learning Theory, 1992. doi:10.1007/3-540-57369-0_40

Markdown

[Takeuchi. "Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model." International Conference on Algorithmic Learning Theory, 1992.](https://mlanthology.org/alt/1992/takeuchi1992alt-some/) doi:10.1007/3-540-57369-0_40

BibTeX

@inproceedings{takeuchi1992alt-some,
  title     = {{Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model}},
  author    = {Takeuchi, Jun'ichi},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1992},
  pages     = {208-219},
  doi       = {10.1007/3-540-57369-0_40},
  url       = {https://mlanthology.org/alt/1992/takeuchi1992alt-some/}
}