BibTeX record journals/corr/abs-2007-00796

download as .bib file

@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}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics