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

Haussler et al. "Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension." Annual Conference on Computational Learning Theory, 1991. doi:10.1007/BF00993163

[Haussler et al. "Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension." Annual Conference on Computational Learning Theory, 1991.](https://mlanthology.org/colt/1991/haussler1991colt-bounds/) doi:10.1007/BF00993163

@inproceedings{haussler1991colt-bounds,
  title     = {{Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension}},
  author    = {Haussler, David and Kearns, Michael J. and Schapire, Robert E.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1991},
  pages     = {61-74},
  doi       = {10.1007/BF00993163},
  url       = {https://mlanthology.org/colt/1991/haussler1991colt-bounds/}
}