====== BECM36STAI – Selected Topics in AI ====== The course aims to immerse students in the forefront of AI research, covering current challenges, significant areas of study, and emerging trends in the field. The set of covered topics is updated regularly; in 2025/2026 the course is organised into four thematic blocks (see the schedule below). The course is a compulsory part of the //prg.ai Master// study plan. **Course parameters:** * Completion: //Klasifikovaný zápočet// (graded course credit) * Credits: 6 * Extent: 2P+2C (28p+28c) * Course guarantor: [[https://fel.cvut.cz/en/faculty/people/951-tomas-kroupa|Tomáš Kroupa]] **Time and place:** * Lecture: Mon 11:00–12:30, room KN:E-327 * Tutorial: Mon 12:45–14:15, room KN:E-327 **Blocks in 2025/2026:** * //Explainable AI with Shapley value// [[https://fel.cvut.cz/en/faculty/people/951-tomas-kroupa|Tomáš Kroupa]] (TK) - 16 points * //Generative models// (GANs, diffusion, applications) [[https://fel.cvut.cz/en/faculty/people/444-jan-cech|Jan Čech]] (JČ) - 28 points * //Planning for autonomous robots// [[https://fel.cvut.cz/en/faculty/people/631-tomas-svoboda|Tomáš Svoboda]] (TS), [[https://fel.cvut.cz/en/faculty/people/654-karel-zimmermann|Karel Zimmermann]] (KZ), [[https://fel.cvut.cz/en/faculty/people/224-vojtech-vonasek|Vojtěch Vonásek]] (VV) - 28 points * //SAT and SMT solving// (computational logic, modern SAT/CDCL, SMT, applications) [[https://usermap.cvut.cz/profile/61be2071-efcc-40e5-a77b-db3be65a0ded?lang=en|Martin Suda]] (MS) - 28 points ===== Prerequisities ===== There are //no formal prerequisites//. The course is intended for master-level students with a solid background in mathematics and programming. Familiarity with basic machine learning and algorithms will be helpful. ===== Grading policy ===== The course is completed by a //graded course credit//. * The main requirement is //projects during the semester// (the exact form, deliverables, and deadlines are announced by the lecturers for each thematic block). * The final grade (A,…,F) will be determined by the sum of points obtained from all the parts of the course (<50 = F, 50-59 pts = E, …, 90-100 pts = A). The student can obtain 16 points from the first block and 28 points from each of the following blocks. * The final grade reflects the quality of the submitted work and (where applicable) the presentation / discussion of the results. ===== Lectures ===== ^ Date ^ Topic ^ Lecturer ^ Slides^ Additional \\ materials ^ | 16/02 | Explainable AI with Shapley value I | TK | {{ :courses:becm36stai:shap1.pdf |expl01}} | {{ :courses:becm36stai:explainable_ai_shap_thesis_proposal_assignment.pdf |project01}} | | 23/02 | Explainable AI with Shapley value II | TK | {{ :courses:becm36stai:kroupa_shap_02.pdf |expl02}} | | | 02/03 | Generative models: intro, GANs | JČ | | | | 09/03 | Generative models: diffusion models | JČ | | | | 16/03 | Generative models: applications, deepfakes | JČ | | | | 23/03 | Autonomous robots: introduction | TS | | | | 30/03 | Planning I: exploration, world maps | VV | | | | 06/04 | Holiday (Easter) | | | | | 13/04 | Planning II: motion planning (combinatorial) | VV | | | | 20/04 | Planning III: motion planning (sampling-based)| VV | | | | 27/04 | Computational logic: SAT, FOL, SMT, encodings | MS | | | | 04/05 | SAT solvers: DPLL, CDCL, resolution | MS | | | | 11/05 | First-order logic and finite model finding | MS | | | | 18/05 | SMT solving and program analysis | MS | | | ===== Tutorials ===== Tutorials are used for guided discussion, exercises related to the lecture topic, and work on the semester projects. ^ Date ^ Topic / Activity ^ Instructor ^ Additional \\ materials ^ | 16/02 | Exercises & discussion (coalitional games) | TK | {{ :courses:becm36stai:coal01.pdf |coal}} {{ :courses:becm36stai:coal02.pdf |Shapley}} | | 23/02 | Exercises & discussion (Shapley value) | TK | | | 02/03 | Exercises & discussion (generative models) | JČ | | | 09/03 | Exercises & discussion (diffusion models) | JČ | | | 16/03 | Exercises & discussion (applications) | JČ | | | 23/03 | Exercises & discussion (autonomous robots) | TS | | | 30/03 | Exercises & discussion (planning) | VV | | | 06/04 | Holiday (Easter) | | | | 13/04 | Exercises & discussion (motion planning) | VV | | | 20/04 | Exercises & discussion (motion planning) | VV | | | 27/04 | Exercises & discussion (SAT/SMT) | MS | | | 04/05 | Exercises & discussion (SAT solvers) | MS | | | 11/05 | Exercises & discussion (FOL / model finding) | MS | | | 18/05 | Exercises & discussion (SMT / program analysis)| MS | | ===== Recommended reading ===== Study materials will be announced for each block.