Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2026/2027

Machine Learning Methods

The course is not on the list Without time-table
Code Completion Credits (ECTS) Range Language
BECM36MLM Z,ZK 6 2P+2C English
Course guarantor:
Lecturer:
Tutor:
Supervisor:
Department of Computer Science
Synopsis:

Students will get familiar with advanced machine learning methods (MLM) that go beyond common data domains (vision, text) taught in the other courses (e.g., BE4M33MPV, BECM36NLPT). They will learn techniques that work well for tabular and structured data (e.g., relational databases), including rule/tree ensembles, graph neural networks, and other advanced approaches aimed at complex learning problems.

Additionally, the course will also teach students methods for model interpretability, the basics of causality, and reinforcement learning.

Requirements:

This is an advanced ML course that assumes at least some prior knowledge of ML (e.g., B4B33RPZ, BECM33MLF), data representation (e.g., B0B36DBS, B0B01LGR), and deep learning (e.g., BECM33DPL).

Syllabus of lectures:

1. Learning from Tabular data

2. Learning from Structured data

3. Graph Neural Networks

4. Relational Deep Learning

5. Neural-Symbolic Learning

6. Learning with Large Language Models

7. Interpretability of ML Models

8. Potential outcomes - Rubin-Neyman causal model, uplift modeling

9. Intro to Pearls causality

10. A/B tests and multi-armed bandit problems, UCB algorithm.

11. Bayesian bandits (Thompson sampling). Contextual bandits.

12. Markov decision processes

13. Tabular RL: Q-Learning and SARSA

14. Deep RL: Deep Q-learning. Policy gradient.

Syllabus of tutorials:

1. Learning from Tabular data

2. Learning from Structured data

3. Graph Neural Networks

4. Relational Deep Learning

5. Neural-Symbolic Learning

6. Learning with Large Language Models

7. Interpretability of ML Models

8. Potential outcomes - Rubin-Neyman causal model, uplift modeling

9. Intro to Pearls causality

10. A/B tests and multi-armed bandit problems, UCB algorithm.

11. Bayesian bandits (Thompson sampling). Contextual bandits.

12. Markov decision processes

13. Tabular RL: Q-Learning and SARSA

14. Deep RL: Deep Q-learning. Policy gradient.

Study Objective:
Study materials:
Note:
Further information:
https://cw.fel.cvut.cz/b252/courses/becm36mlm/start
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2026-10-14
For updated information see http://bilakniha.cvut.cz/en/predmet8287106.html