激活函数
初始化
梯度下降
最大值和最小值
人工神经网络
计算机科学
随机梯度下降算法
趋同(经济学)
收敛速度
基质(化学分析)
计算
数学优化
控制理论(社会学)
应用数学
数学
算法
人工智能
数学分析
材料科学
钥匙(锁)
复合材料
经济
计算机安全
程序设计语言
控制(管理)
经济增长
作者
Ameya D. Jagtap,Kenji Kawaguchi,George Em Karniadakis
标识
DOI:10.1098/rspa.2020.0334
摘要
We propose two approaches of locally adaptive activation functions namely, layer-wise and neuron-wise locally adaptive activation functions, which improve the performance of deep and physics-informed neural networks. The local adaptation of activation function is achieved by introducing a scalable parameter in each layer (layer-wise) and for every neuron (neuron-wise) separately, and then optimizing it using a variant of stochastic gradient descent algorithm. In order to further increase the training speed, an activation slope-based slope recovery term is added in the loss function, which further accelerates convergence, thereby reducing the training cost. On the theoretical side, we prove that in the proposed method, the gradient descent algorithms are not attracted to sub-optimal critical points or local minima under practical conditions on the initialization and learning rate, and that the gradient dynamics of the proposed method is not achievable by base methods with any (adaptive) learning rates. We further show that the adaptive activation methods accelerate the convergence by implicitly multiplying conditioning matrices to the gradient of the base method without any explicit computation of the conditioning matrix and the matrix–vector product. The different adaptive activation functions are shown to induce different implicit conditioning matrices. Furthermore, the proposed methods with the slope recovery are shown to accelerate the training process.
科研通智能强力驱动
Strongly Powered by AbleSci AI