%0 Generic %1 lin2016cheap %A Lin, Henry W. %A Tegmark, Max %A Rolnick, David %D 2016 %K %R 10.1007/s10955-017-1836-5 %T Why does deep and cheap learning work so well? %U http://arxiv.org/abs/1608.08225 %X We show how the success of deep learning could depend not only on mathematics but also on physics: although well-known mathematical theorems guarantee that neural networks can approximate arbitrary functions well, the class of functions of practical interest can frequently be approximated through "cheap learning" with exponentially fewer parameters than generic ones. We explore how properties frequently encountered in physics such as symmetry, locality, compositionality, and polynomial log-probability translate into exceptionally simple neural networks. We further argue that when the statistical process generating the data is of a certain hierarchical form prevalent in physics and machine-learning, a deep neural network can be more efficient than a shallow one. We formalize these claims using information theory and discuss the relation to the renormalization group. We prove various "no-flattening theorems" showing when efficient linear deep networks cannot be accurately approximated by shallow ones without efficiency loss, for example, we show that $n$ variables cannot be multiplied using fewer than 2^n neurons in a single hidden layer.

@misc{lin2016cheap, abstract = {We show how the success of deep learning could depend not only on mathematics but also on physics: although well-known mathematical theorems guarantee that neural networks can approximate arbitrary functions well, the class of functions of practical interest can frequently be approximated through "cheap learning" with exponentially fewer parameters than generic ones. We explore how properties frequently encountered in physics such as symmetry, locality, compositionality, and polynomial log-probability translate into exceptionally simple neural networks. We further argue that when the statistical process generating the data is of a certain hierarchical form prevalent in physics and machine-learning, a deep neural network can be more efficient than a shallow one. We formalize these claims using information theory and discuss the relation to the renormalization group. We prove various "no-flattening theorems" showing when efficient linear deep networks cannot be accurately approximated by shallow ones without efficiency loss, for example, we show that $n$ variables cannot be multiplied using fewer than 2^n neurons in a single hidden layer.}, added-at = {2019-12-19T13:25:31.000+0100}, author = {Lin, Henry W. and Tegmark, Max and Rolnick, David}, biburl = {https://www.bibsonomy.org/bibtex/24271b09bdded2de9dcb48750ae7433ea/gdiraco}, doi = {10.1007/s10955-017-1836-5}, interhash = {94ec622d58311d473b4ea96c7bad8dfd}, intrahash = {4271b09bdded2de9dcb48750ae7433ea}, keywords = {}, note = {cite arxiv:1608.08225Comment: Replaced to match version published in Journal of Statistical Physics: https://link.springer.com/article/10.1007/s10955-017-1836-5 Improved refs & discussion, typos fixed. 16 pages, 3 figs}, timestamp = {2019-12-19T13:25:31.000+0100}, title = {Why does deep and cheap learning work so well?}, url = {http://arxiv.org/abs/1608.08225}, year = 2016 }