
BibTeX record journals/corr/abs-2007-00796
@article{DBLP:journals/corr/abs-2007-00796, author = {Xiaochen Yang and Jean Honorio}, title = {Information Theoretic Sample Complexity Lower Bound for Feed-Forward Fully-Connected Deep Networks}, journal = {CoRR}, volume = {abs/2007.00796}, year = {2020}, url = {https://arxiv.org/abs/2007.00796}, archivePrefix = {arXiv}, eprint = {2007.00796}, timestamp = {Mon, 06 Jul 2020 15:26:01 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-00796.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.