vix.ing · top · new · best · stats

Why does deep and cheap learning work so well?

2016/08/29 by Henry W. Lin, Max Tegmark, David Rolnick · 4 voices · 372 citations
Computer Science · Mathematics · Physics and Astronomy · #Artificial neural network #Class (philosophy) #Deep learning #Gaussian Processes and Bayesian Inference #Process (computing) #Relation (database) #Renormalization #Simple (philosophy) #Statistical Mechanics and Entropy #Stochastic Gradient Optimization Techniques #cond-mat.dis-nn #cs.LG #cs.NE #stat.ML

paper · pdf · doi:10.1007/s10955-017-1836-5

published in Journal of Statistical Physics 168(6), 1223-1247 (Springer Science+Business Media) · 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

openalex created_date 2016/09/16 · openalex publication_date 2017/07/21 · arxiv created 2017/08/03 · arxiv updated 2017/09/13 · openalex updated_date 2026/08/05

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 2n neurons in a single hidden layer.

Citations

Cited by

Discussions

Related