Neural networks and quantum field theory

被引:51
作者
Halverson, James [1 ]
Maiti, Anindita [1 ]
Stoner, Keegan [1 ]
机构
[1] Northeastern Univ, Dept Phys, Boston, MA 02115 USA
来源
MACHINE LEARNING-SCIENCE AND TECHNOLOGY | 2021年 / 2卷 / 03期
关键词
Wilsonian RG flow; infinite width NNGP; finite width NN; Gaussian processes; quantum field theory; RECOGNITION;
D O I
10.1088/2632-2153/abeca3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose a theoretical understanding of neural networks in terms of Wilsonian effective field theory. The correspondence relies on the fact that many asymptotic neural networks are drawn from Gaussian processes (GPs), the analog of non-interacting field theories. Moving away from the asymptotic limit yields a non-Gaussian process (NGP) and corresponds to turning on particle interactions, allowing for the computation of correlation functions of neural network outputs with Feynman diagrams. Minimal NGP likelihoods are determined by the most relevant non-Gaussian terms, according to the flow in their coefficients induced by the Wilsonian renormalization group. This yields a direct connection between overparameterization and simplicity of neural network likelihoods. Whether the coefficients are constants or functions may be understood in terms of GP limit symmetries, as expected from 't Hooft's technical naturalness. General theoretical calculations are matched to neural network experiments in the simplest class of models allowing the correspondence. Our formalism is valid for any of the many architectures that becomes a GP in an asymptotic limit, a property preserved under certain types of training.
引用
收藏
页数:48
相关论文
共 41 条
[1]  
[Anonymous], 2017, ARXIV160806993, DOI DOI 10.1109/CVPR.2017.243
[2]  
[Anonymous], 2018, ARXIV180607572
[3]  
[Anonymous], 1985, LEARNING INTERNAL RE, DOI DOI 10.21236/ADA164453
[4]  
[Anonymous], 2009, 23 ANN C NEURAL INFO
[5]  
[Anonymous], 2016, J. Mach. Learn. Res.
[6]  
[Anonymous], 2019, ARXIV190206720
[7]  
Antognini Joseph M, 2019, ARXIV190810030
[8]  
Bahdanau D., 2015, PROC INT C LEARN REP
[9]  
Bruna J., 2014, PROC 2 INT C LEARN R
[10]  
Cohen O., 2020, ARXIV190605301