curriculum
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
curriculum [2025/07/16 12:35] – [Period 1] respai-vic | curriculum [2025/07/31 16:35] (current) – [Period 1] respai-vic | ||
---|---|---|---|
Line 3: | Line 3: | ||
===== MASTER 1 (M1) ===== | ===== MASTER 1 (M1) ===== | ||
+ | Mandatory: | ||
+ | * Refresher in Statistics (APM_51438_EP, | ||
- | * MAP538: Refresher in Statistics (Marine Le Morvan) | + | 1 course among: |
- | * INF538: | + | * Refresher in Computer |
+ | * Refresher in Computer Science (CSC_51440_EP, | ||
- | All subsequent M1 courses are 36h and will credit 4.5 ECTS. | + | |
+ | All subsequent M1 courses are 36h and will credit 4.5 ECTS. Note that students need to mandatorily either choose a Deep Learning course either in Period 1 (CSC_51054_EP) or in Period 2 (APM_52183_EP). | ||
==== Period 1 ==== | ==== Period 1 ==== | ||
Mandatory: | Mandatory: | ||
- | * Computer Animation (INF585, Mathieu Desbrun and Marie-Paule Cani, EP) | + | * Computer Animation (CSC_51085_EP, Mathieu Desbrun and Marie-Paule Cani, EP) |
+ | * Image Analysis and Computer Vision (CSC_51073_EP, | ||
+ | * Machine Learning (MDC_51006_EP, | ||
1 course among: | 1 course among: | ||
- | * Machine and Deep Learning (INF554, Michalis Vazirgiannis, | + | * Deep Learning (Recommeded option, CSC_51054_EP, Michalis Vazirgiannis, |
- | * Foundations | + | * Digital Representation and Analysis |
+ | * Signal Processing (Recommeded option, APM_51055_EP, | ||
+ | * Topological Data Analysis | ||
- | 2 courses among: | + | + Mandatory non-scientific courses: |
- | * Topological Data Analysis (INF556, Steve Oudot, EP & Inria) | + | * Introduction to Marketing and Strategy (IME_51456_EP, Philippe Ginier-Gillet, |
- | * Image Analysis and Computer Vision (INF573, Mathieu Brédif, EP & IGN) | + | |
- | * Digital Representation and Analysis of Shapes (INF574, Mathieu Desbrun, Pooran Memari, EP & Inria) | + | |
- | * Signal Processing (MAP555, Rémi Flamary, EP) | + | |
- | + | ||
- | + Mandatory non-scientific courses | + | |
- | + | ||
- | * Fundamental of Strategy and Innovation (MIE555) or Introduction to Marketing and Strategy (MIE556, Workload ++) | + | |
* Sport | * Sport | ||
* Humanities | * Humanities | ||
Line 34: | Line 36: | ||
==== Period 2 ==== | ==== Period 2 ==== | ||
- | 2 Mandatory | + | Mandatory: |
- | * Advanced Machine | + | * Reinforcement |
- | * Computer Vision: From Fundamentals to Applications | + | * Multimodal Generative AI (CSC_52002_EP, Vicky Kalogeiton, EP) |
- | 2 scientific | + | 2 courses among: |
- | * Advanced | + | * Deep Learning (Recommended option, APM_52183_EP, Kevin Scaman) |
- | * Image Synthesis: Theory and Practice (INF584, Tamy Boubekeur, Telecom ParisTech) | + | * Image Synthesis: Theory and Practice (Recommended option, CSC_52084_EP, Tamy Boubekeur, Telecom ParisTech) |
- | * Real-time AI in Video Games : Decisive & Collaborative Actions | + | * Statistics |
- | * Statistics in Action | + | * Advanced Deep Learning |
- | * Computational Optimal Transport for ML and Generative Modeling | + | * Graph Representation Learning (CSC_52072_EP, |
+ | * Emerging Topics in Machine Learning | ||
- | + Mandatory non-scientific courses | + | + Mandatory non-scientific courses: |
- | * | + | * |
* Sport | * Sport | ||
* Humanities | * Humanities | ||
Line 53: | Line 56: | ||
==== Period 3 ==== | ==== Period 3 ==== | ||
- | MAP/ | + | INT_52406_EP |
Line 67: | Line 70: | ||
**APM_53440_EP - Advanced unsupervised learning (24h, 2 ECTS), Pierre Latouche(UCA)** (contact: pierre.latouche@uca.fr) | **APM_53440_EP - Advanced unsupervised learning (24h, 2 ECTS), Pierre Latouche(UCA)** (contact: pierre.latouche@uca.fr) | ||
- | > ABSTRACT TO BE ADDED | + | |
+ | This course aims at presenting advanced models and methods from computational statistics and machine learning for unsupervised learning, through the context of directed graphical models. Both the frequentist and Bayesian frameworks will be covered. In particular, we will study clustering methods and we will focus on mixture models and on the expectation maximisation algorithm for inference. The standard model selection criterion will be derived and we will illustrate their use to estimate the model complexity. After having given the theory of directed graphical models, we will show on a series of examples how the classical models from machine learning can be characterized in such a context. We will show how all the standard loss functions in machine learning can be linked to specific directed graphical models, giving rise to new ways to think about problems and to solve them. We will particularly insist on the interest of relying on directed graphical models to evaluate the complexity of the inference task for various models. The variational framework will be presented along with the variational EM and variational Bayes EM algorithms. The inference task of the stochastic block model, with a two-to-one dependency, will be described. The second part of the course will be about the use of deep neural networks in directed graphical models to obtain the so-called deep graphical models. Variational autoencoders and GAN we will be presented in such a context along with the corresponding inference strategies. We will finally show on a given example how the main model for social network analysis can be rewritten and extented with deep graphical models. We will point out the modifications in terms of directed graphical models, inference, and applications. In particular, we will describe the use of graph neural networks. Lectures will be done through slides and proofs on the blackboard. In labs, we will implement and test all the approaches seen in the lectures. | ||
+ | |||
+ | |||
| | ||
- | **APM_53441_EP - Learning | + | **APM_53441_EP - From Boosting to Foundation Models: learning |
- | > ABSTRACT TO BE ADDED | + | > This course offers a modern overview of statistical learning with tabular data, from classical tree-based models to emerging deep and foundation models. We will review the foundations of gradient boosting methods and their scalable implementations, |
Line 84: | Line 91: | ||
> This course will introduce students to advanced topics in modern geometric data analysis with focus on a) mathematical foundations (discrete differential geometry, mapping, optimization), | > This course will introduce students to advanced topics in modern geometric data analysis with focus on a) mathematical foundations (discrete differential geometry, mapping, optimization), | ||
- | **CSC_53433_EP - Creative & Generative models in Computer Graphics, from shapes to motion | + | **CSC_53433_EP - Creative & Generative models in Computer Graphics (24h, 2 ECTS), |
> This course presents the AI-related methods developed in Computer Graphics to create or generate individual 3D shapes, animated landscapes and humanoid motion. We first introduce user-centered Creative AI, i.e. smart 3D models - either based on knowledge or trained from examples, designed to help users creating and controlling 3D shapes and environments. Second, we focus on the use of AI in Character Animation, from early motion planning and control methods to deep reinforcement learning solutions. These methods result into 3D character models able to navigate alone or within crowds, and to interact with their environment. The lab sessions are held on Unity, based on C#. | > This course presents the AI-related methods developed in Computer Graphics to create or generate individual 3D shapes, animated landscapes and humanoid motion. We first introduce user-centered Creative AI, i.e. smart 3D models - either based on knowledge or trained from examples, designed to help users creating and controlling 3D shapes and environments. Second, we focus on the use of AI in Character Animation, from early motion planning and control methods to deep reinforcement learning solutions. These methods result into 3D character models able to navigate alone or within crowds, and to interact with their environment. The lab sessions are held on Unity, based on C#. | ||
| | ||
Line 93: | Line 100: | ||
> Drones and robots must create maps of their surroundings to plan their movement and navigate. This course presents the robotic platforms and the most common sensors (vision, Lidar, intertial units, odometry …) and the different components of navigation: control; obstacle avoidance; localization; | > Drones and robots must create maps of their surroundings to plan their movement and navigate. This course presents the robotic platforms and the most common sensors (vision, Lidar, intertial units, odometry …) and the different components of navigation: control; obstacle avoidance; localization; | ||
- | **CSC_54441_EP - Introduction to the verification of neural networks (24h, 2 ECTS), Eric Goubault (EP), Sylvie Putot (EP)** (contact: sylvie.putot@polytechnique.edu) | + | **CSC_54441_EP - Introduction to the verification of neural networks (24h, 2 ECTS), Eric Goubault (EP), Sylvie Putot (EP)** (contact: sylvie.putot@polytechnique.edu) |
> Neural networks are widely used in numerous applications including safety-critical ones such as control and planning for autonomous systems. A central question is how to verify that they are correct with respect to some specification. Beyond correctness or robustness, we are also interested in questions such as explainability and fairness, that can in turn be specified as formal verification problems. In this course, we will see how formal methods approaches introduced in the context of program verification can be leveraged to address the verification of neural networks. | > Neural networks are widely used in numerous applications including safety-critical ones such as control and planning for autonomous systems. A central question is how to verify that they are correct with respect to some specification. Beyond correctness or robustness, we are also interested in questions such as explainability and fairness, that can in turn be specified as formal verification problems. In this course, we will see how formal methods approaches introduced in the context of program verification can be leveraged to address the verification of neural networks. | ||
+ | |||
+ | **CSC_54445_EP - Geometric Algorithms for Point Patterns and 2D embedded Structures, Across Applications in Visual Computing (24h, 2 ECTS), Pooran Memari** (contact: pooran.memari@polytechnique.edu) - Elective course | ||
+ | > This course explores the key role of 2D embedded structures, namely discrete distributions or point patterns in practical applications, | ||
**CSC_54442_EP - Socio-emotional embodied conversational agents (24h, 2 ECTS), Chloé Clavel (Inria Paris) and Brian Ravenet (Université Paris Saclay)** (contacts: chloe.clavel@inria.fr and brian.ravenet@lisn.upsaclay.fr> | **CSC_54442_EP - Socio-emotional embodied conversational agents (24h, 2 ECTS), Chloé Clavel (Inria Paris) and Brian Ravenet (Université Paris Saclay)** (contacts: chloe.clavel@inria.fr and brian.ravenet@lisn.upsaclay.fr> | ||
Line 123: | Line 133: | ||
==== Period 3 ==== | ==== Period 3 ==== | ||
- | MAP/ | + | INT_54490_EP |
curriculum.1752669313.txt.gz · Last modified: 2025/07/16 12:35 by respai-vic