Existence, uniqueness, and convergence rates for gradient flows in the training of artificial neural networks with ReLU activation

被引:1
|
作者
Eberle, Simon [1 ]
Jentzen, Arnulf [2 ,3 ,4 ]
Riekert, Adrian [4 ]
Weiss, Georg S. [5 ]
机构
[1] Basque Ctr Appl Math, Bilbao, Spain
[2] Chinese Univ Hong Kong, Sch Data Sci, Shenzhen, Peoples R China
[3] Chinese Univ Hong Kong, Shenzhen Res Inst Big Data, Shenzhen, Peoples R China
[4] Univ Munster, Appl Math Inst Anal & Numer, Munster, Germany
[5] Univ Duisburg Essen, Fac Math, AG Anal Partial Differential Equat, Essen, Germany
来源
ELECTRONIC RESEARCH ARCHIVE | 2023年 / 31卷 / 05期
关键词
deep learning; artificial intelligence; optimization; gradient flow; Kurdyka-Lojasiewicz inequalities; DESCENT METHODS;
D O I
10.3934/era.2023128
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The training of artificial neural networks (ANNs) with rectified linear unit (ReLU) activa-tion via gradient descent (GD) type optimization schemes is nowadays a common industrially relevant procedure. GD type optimization schemes can be regarded as temporal discretization methods for the gradient flow (GF) differential equations associated to the considered optimization problem and, in view of this, it seems to be a natural direction of research to first aim to develop a mathematical con-vergence theory for time-continuous GF differential equations and, thereafter, to aim to extend such a time-continuous convergence theory to implementable time-discrete GD type optimization methods. In this article we establish two basic results for GF differential equations in the training of fully-connected feedforward ANNs with one hidden layer and ReLU activation. In the first main result of this article we establish in the training of such ANNs under the assumption that the probability distribution of the input data of the considered supervised learning problem is absolutely continuous with a bounded density function that every GF differential equation admits for every initial value a solution which is also unique among a suitable class of solutions. In the second main result of this article we prove in the training of such ANNs under the assumption that the target function and the density function of the probability distribution of the input data are piecewise polynomial that every non-divergent GF trajectory converges with an appropriate rate of convergence to a critical point and that the risk of the non-divergent GF trajectory converges with rate 1 to the risk of the critical point. We establish this result by proving that the considered risk function is semialgebraic and, consequently, satisfies the Kurdyka-Lojasiewicz inequality, which allows us to show convergence of every non-divergent GF trajectory.
引用
收藏
页码:2519 / 2554
页数:36
相关论文
共 50 条
  • [21] Convergence of a Gradient Algorithm with Penalty for Training Two-layer Neural Networks
    Shao, Hongmei
    Liu, Lijun
    Zheng, Gaofeng
    2009 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 4, 2009, : 76 - +
  • [22] Learning deep linear neural networks: Riemannian gradient flows and convergence to global minimizers
    Bah, Bubacarr
    Rauhut, Holger
    Terstiege, Ulrich
    Westdickenberg, Michael
    INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, 2022, 11 (01) : 307 - 353
  • [23] How degenerate is the parametrization of neural networks with the ReLU activation function?
    Berner, Julius
    Elbraechter, Dennis
    Grohs, Philipp
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [24] Convergence rates of training deep neural networks via alternating minimization methods
    Xu, Jintao
    Bao, Chenglong
    Xing, Wenxun
    OPTIMIZATION LETTERS, 2024, 18 (04) : 909 - 923
  • [25] Convergence rates of training deep neural networks via alternating minimization methods
    Jintao Xu
    Chenglong Bao
    Wenxun Xing
    Optimization Letters, 2024, 18 : 909 - 923
  • [26] Existence and Uniqueness of Solution for Impulsive Cellular Neural Networks
    Liu, Jing
    Liu, Anping
    Ma, Qingxia
    SECOND INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN, VOL 2, PROCEEDINGS, 2009, : 413 - +
  • [27] Provable Accelerated Convergence of Nesterov's Momentum for Deep ReLU Neural Networks
    Liao, Fangshuo
    Kyrillidis, Anastasios
    INTERNATIONAL CONFERENCE ON ALGORITHMIC LEARNING THEORY, VOL 237, 2024, 237
  • [28] PLATEAU PHENOMENON IN GRADIENT DESCENT TRAINING OF RELU NETWORKS: EXPLANATION, QUANTIFICATION, AND AVOIDANCE
    Ainsworth, Mark
    Shin, Yeonjong
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2021, 43 (05): : A3438 - A3468
  • [29] Gradient Descent Provably Escapes Saddle Points in the Training of Shallow ReLU Networks
    Cheridito, Patrick
    Jentzen, Arnulf
    Rossmannek, Florian
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2024, 203 (03) : 2617 - 2648
  • [30] Researching Multi-Site Artificial Neural Networks' Activation Rates and Activation Cycles
    Grum, Marcus
    BUSINESS MODELING AND SOFTWARE DESIGN, BMSD 2024, 2024, 523 : 186 - 206