mlsanityData to 7 Oct 2026

Mathematical Introduction to Deep Learning: Methods, Implementations, and Theory

arXiv 2310.20360 ↗First posted 31 Oct 2023cs.LG cs.AI cs.NAcited by 19

Not on the map. Why?

Abstract (arXiv)

This book aims to provide an introduction to the topic of deep learning algorithms. We review essential components of deep learning algorithms in full mathematical detail including different artificial neural network (ANN) architectures (such as fully-connected feedforward ANNs, convolutional ANNs, recurrent ANNs, residual ANNs, and ANNs with batch normalization) and different optimization algorithms (such as the basic stochastic gradient descent (SGD) method, accelerated methods, and adaptive methods). We also cover several theoretical aspects of deep learning algorithms such as approximation capacities of ANNs (including a calculus for ANNs), optimization theory (including Kurdyka-Lojasiewicz inequalities), and generalization errors. In the last part of the book some deep learning approximation methods for PDEs are reviewed including physics-informed neural networks (PINNs) and deep Galerkin methods. We hope that this book will be useful for students and scientists who do not yet have any background in deep learning at all and would like to gain a solid foundation as well as for practitioners who would like to obtain a firmer mathematical understanding of the objects and methods considered in deep learning.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Oct 2023.

Builds on

0 of 0 references.

No references here yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 8; 2025: 7; 2026: 4.

19 papers.

Sort:

By area:

  1. 2024Non-convergence of Adam and other adaptive stochastic gradient descent optimization methods for non-vanishing learning ratescited by 14
  2. 2024Convergence rates for the Adam optimizercited by 14
  3. 2024Non-convergence to global minimizers for Adam and stochastic gradient descent optimization and constructions of local minimizers in the training of artificial neural networkscited by 9
  4. 2025ODE approximation for the Adam algorithm: General and overparametrized settingcited by 8
  5. 2024An Overview on Machine Learning Methods for Partial Differential Equations: from Physics Informed Neural Networks to Deep Operator Learningcited by 6
  6. 2025Non-convergence to the optimal risk for Adam and stochastic gradient descent optimization in the training of deep neural networkscited by 6
  7. 2025Towards Lossless Implicit Neural Representation via Bit Plane Decompositioncited by 5
  8. 2024Multilevel Picard approximations and deep neural networks with ReLU, leaky ReLU, and softplus activation overcome the curse of dimensionality when approximating semilinear parabolic partial differential equations in Lp-sensecited by 3
  9. 2026Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization methodcited by 2
  10. 2024Reconciling Privacy and Explainability in High-Stakes: A Systematic Inquirycited by 1
  11. 2025PADAM: Parallel averaged Adam reduces the error for stochastic optimization in scientific machine learningcited by 1
  12. 2024Towards an Algebraic Framework For Approximating Functions Using Neural Network Polynomialscited by 0
7 more
  1. 2024An overview of diffusion models for generative artificial intelligencecited by 0
  2. 2025High-Order Tensor Regression in Sparse Convolutional Neural Networkscited by 0
  3. 2025Interval-Valued Time Series Classification Using DK-Distancecited by 0
  4. 2025Error analysis for the deep Kolmogorov methodcited by 0
  5. 2026Central limit theorem for the averaged Adam optimizercited by 0
  6. 2026Walk-on-Spheres Monte Carlo and deep neural network approximations of elliptic PDEs with drift and killingcited by 0
  7. 2026Convergence rates for the RMSprop optimizer with full control of the hyperparameterscited by 0