PAC-like Upper Bounds for the Sample Complexity of Leave-One-Out Cross-Validation

Holden. "PAC-like Upper Bounds for the Sample Complexity of Leave-One-Out Cross-Validation." Annual Conference on Computational Learning Theory, 1996. doi:10.1145/238061.238067

[Holden. "PAC-like Upper Bounds for the Sample Complexity of Leave-One-Out Cross-Validation." Annual Conference on Computational Learning Theory, 1996.](https://mlanthology.org/colt/1996/holden1996colt-pac/) doi:10.1145/238061.238067

@inproceedings{holden1996colt-pac,
  title     = {{PAC-like Upper Bounds for the Sample Complexity of Leave-One-Out Cross-Validation}},
  author    = {Holden, Sean B.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1996},
  pages     = {41-50},
  doi       = {10.1145/238061.238067},
  url       = {https://mlanthology.org/colt/1996/holden1996colt-pac/}
}