Information Theoretic Sample Complexity Lower Bound for Feed-Forward Fully-Connected Deep Networks.

Xiaochen Yang Jean Honorio Information Theoretic Sample Complexity Lower Bound for Feed-Forward Fully-Connected Deep Networks. 2020 abs/2007.00796 CoRR https://arxiv.org/abs/2007.00796 db/journals/corr/corr2007.html#abs-2007-00796