Deep learning and geometric deep learning: An introduction for mathematicians and physicists
From MaRDI portal
Abstract: In this expository paper we want to give a brief introduction, with few key references for further reading, to the inner functioning of the new and successfull algorithms of Deep Learning and Geometric Deep Learning with a focus on Graph Neural Networks. We go over the key ingredients for these algorithms: the score and loss function and we explain the main steps for the training of a model. We do not aim to give a complete and exhaustive treatment, but we isolate few concepts to give a fast introduction to the subject. We provide some appendices to complement our treatment discussing Kullback-Leibler divergence, regression, Multi-layer Perceptrons and the Universal Approximation Theorem.
Recommendations
Cites work
- Graph Representation Learning
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 7306852 (Why is no real title available?)
- Model-Centric Data Manifold: The Data Through the Eyes of the Model
- Multilayer feedforward networks are universal approximators
- Normalized graph Laplacians for directed graphs
- The elements of statistical learning. Data mining, inference, and prediction
Cited in
(2)
This page was built for publication: Deep learning and geometric deep learning: An introduction for mathematicians and physicists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144784)