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

Cite

Text

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

Markdown

[Haussler et al. "Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension." Machine Learning, 1994.](https://mlanthology.org/mlj/1994/haussler1994mlj-bounds/) doi:10.1007/BF00993163

BibTeX

@article{haussler1994mlj-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.},
  journal   = {Machine Learning},
  year      = {1994},
  pages     = {83-113},
  doi       = {10.1007/BF00993163},
  volume    = {14},
  url       = {https://mlanthology.org/mlj/1994/haussler1994mlj-bounds/}
}