Popis předmětu - BECM36MLM
| BECM36MLM | Machine Learning Methods | ||
|---|---|---|---|
| Role: | PS, P | Rozsah výuky: | 2P+2C |
| Katedra: | 13136 | Jazyk výuky: | EN |
| Garanti: | Železný F. | Zakončení: | Z,ZK |
| Přednášející: | Kuželka O., Šír G., Železný F. | Kreditů: | 6 |
| Cvičící: | Krutský M., Kuželka O., Peleška J., Šír G. | Semestr: | L |
Webová stránka:
https://cw.fel.cvut.cz/b252/courses/becm36mlm/startAnotace:
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.Osnovy přednášek:
| 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 “Pearl’s” 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. |
Osnovy cvičení:
| 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 “Pearl’s” 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. |
Literatura:
Požadavky:
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).Předmět je zahrnut do těchto studijních plánů:
| Plán | Obor | Role | Dop. semestr |
| MPOI9_2026 | Datové vědy | PS | 2 |
| MPPRGAI_2025 | Před zařazením do oboru | P | 2 |
| Stránka vytvořena 19.5.2026 14:51:53, semestry: Z/2028-9, Z/2026-7, Z,L/2025-6, L/2026-7, L/2028-9, L/2027-8, L/2029-30, Z/2027-8, připomínky k informační náplni zasílejte správci studijních plánů | Návrh a realizace: I. Halaška (K336), J. Novák (K336) |