Perform a search on the site.

Your currency

Understand the theoretical foundations and algorithms of deep learning

Deep learning becomes usable when you understand the choices that influence its results. Connect architectures, data and training to analyse model behaviour. Develop a framework for designing experiments and assessing their performance rigorously.

Duration
2 days 14 hours
Code
IA040FR Code

Presentation

Deep learning is often used as a black box through high-level libraries. Yet innovation and fine-tuning models require an understanding of what happens under the hood. This 2-day course provides an immersion in the mathematics and algorithms that underpin deep learning.

The programme moves beyond convenient abstractions to return to the fundamentals: matrix calculations, gradient descent and backpropagation. You will learn to implement a neural network from scratch in Python, without a framework, to understand the inner mechanics of learning.

You will then progress to modern architectures, including CNNs and RNNs, and optimisation strategies such as Adam and RMSProp. Combining theoretical rigour with practical implementation, this approach equips you to diagnose, adjust and design high-performing models with genuine technical understanding.

Objectives

By the end of this course, you will be able to:

  • explain the mathematical foundations of deep learning, including linear algebra, derivatives and gradients;
  • master forward propagation and backpropagation mechanisms;
  • implement optimisation algorithms such as SGD and Adam manually and understand their hyperparameters;
  • distinguish and apply neural network architectures, including MLP, CNN and RNN, according to the data;
  • evaluate model performance and address overfitting or underfitting.
Last update: 24/09/2026

Any brand names and logos mentioned in this course description, such as Python, Keras and PyTorch, belong to their respective owners. Their mention for educational purposes does not constitute an endorsement or partnership.