Rademacher and Gaussian Complexities: Risk Bounds and Structural Results

Cite

Text

Bartlett and Mendelson. "Rademacher and Gaussian Complexities: Risk Bounds and Structural Results." Annual Conference on Computational Learning Theory, 2001. doi:10.1007/3-540-44581-1_15

Markdown

[Bartlett and Mendelson. "Rademacher and Gaussian Complexities: Risk Bounds and Structural Results." Annual Conference on Computational Learning Theory, 2001.](https://mlanthology.org/colt/2001/bartlett2001colt-rademacher/) doi:10.1007/3-540-44581-1_15

BibTeX

@inproceedings{bartlett2001colt-rademacher,
  title     = {{Rademacher and Gaussian Complexities: Risk Bounds and Structural Results}},
  author    = {Bartlett, Peter L. and Mendelson, Shahar},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2001},
  pages     = {224-240},
  doi       = {10.1007/3-540-44581-1_15},
  url       = {https://mlanthology.org/colt/2001/bartlett2001colt-rademacher/}
}