Record
- Authors
- Bartlett, P. L.; Harvey, N.; Liaw, C.; Mehrabian, A.
- Year
- 2019
- Title
- Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks
- Published in
- Journal of Machine Learning Research
- Volume
- 20 (63)
- Pages
- 1–17
- Type
- Journal article
- arXiv
- arXiv:1703.02930
- Our note
- none yet
- Verification
- unverified: not yet checked against the source
- Id
bartlett-2019-nearly-tight-vc-dimension-pseudodimension-bounds
Cited on
- Why Classical Bounds Do Not Explain Deep Networks read status: not stated
As cited
The pages cite this work in one form.
-
Bartlett, P. L., Harvey, N., Liaw, C., and Mehrabian, A. (2019). Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks. Journal of Machine Learning Research, 20(63), 1–17. arXiv:1703.02930. Abstract. (An earlier extended abstract by Harvey, Liaw and Mehrabian appeared at the Conference on Learning Theory, 2017.)
BibLaTeX
@article{bartlett-2019-nearly-tight-vc-dimension-pseudodimension-bounds,
author = {Bartlett, P. L. and Harvey, N. and Liaw, C. and Mehrabian, A.},
title = {{Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks}},
journaltitle = {Journal of Machine Learning Research},
date = {2019},
volume = {20},
number = {63},
pages = {1--17},
eprint = {1703.02930},
eprinttype = {arxiv}
}