Machine IntelligenceModule description #40786 / Version 4
- 12 CP
- Oral exam
- Graded
- Winter and summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
Current version (v5)
| Module / Version | #40786 / #4 |
|---|---|
| Validity | Winter semester 2021/22 – Winter semester 2025/26 |
| Available language(s) | English |
| Credit points | 12 |
| Person responsible for the module | Obermayer, Klaus |
| Grading | Graded |
| Exam format | Oral exam |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34351300 FG Neuronale Informationsverarbeitung |
Contact
| Office | MAR 5-6 |
|---|---|
| Contact person | Groiß, Camilla |
| E-mail address | sekr@ni.tu-berlin.de |
| Website | https://www.bccn-berlin.de/courses-and-modules.html |
Learning outcomes
In this module, participants will gain knowledge about:
- basic concepts, their theoretical foundation and the most common algorithms used in machine learning and artificial intelligence
- strengths and limitations of the different paradigms
They will be enabled to:
- apply methods and algorithms to real world problems
- be aware of performance criteria
- critically evaluate results obtained with those methods
- modify algorithms to new tasks at hand
- develop new algorithms according to the paradigms presented in this course.
- basic concepts, their theoretical foundation and the most common algorithms used in machine learning and artificial intelligence
- strengths and limitations of the different paradigms
They will be enabled to:
- apply methods and algorithms to real world problems
- be aware of performance criteria
- critically evaluate results obtained with those methods
- modify algorithms to new tasks at hand
- develop new algorithms according to the paradigms presented in this course.
Content
Part 1: Artificial neural networks. Connectionist neurons, the multilayer perceptron, radial basis function networks, learning by empirical risk minimization, gradient-based optimization, overfitting and underfitting, regularization techniques, deep networks, applications to classification and regression problems.
Part 2: Learning theory and support vector machines. Elements of statistical learning theory, learning by structural risk minimization, the C Support Vector Machine, kernels and non-linear decision boundaries, SMO optimization, the P-SVM.
Part 3: Probabilistic methods. Reasoning under uncertainty and Bayesian inference; graphical models, graphs vs. distributions, and belief propagation; generative models; Bayesian inference and neural networks; non-parametric density estimation; parametric density estimation and maximum likelihood methods.
Part 4: Reinforcement learning (MDP, value iteration, policy iteration, Q-learning).
Part 5: Projections methods. Principal Component Analysis and Kernel-PCA; independent component analysis and blind source separation techniques (Infomax, Fast-ICA, ESD).
Part 6: Stochastic optimization. Simulated annealing, mean-field techniques.
Part 7: Clustering and embedding. K-means clustering, pairwise clustering methods, self-organizing maps for central and pairwise data.
Part 2: Learning theory and support vector machines. Elements of statistical learning theory, learning by structural risk minimization, the C Support Vector Machine, kernels and non-linear decision boundaries, SMO optimization, the P-SVM.
Part 3: Probabilistic methods. Reasoning under uncertainty and Bayesian inference; graphical models, graphs vs. distributions, and belief propagation; generative models; Bayesian inference and neural networks; non-parametric density estimation; parametric density estimation and maximum likelihood methods.
Part 4: Reinforcement learning (MDP, value iteration, policy iteration, Q-learning).
Part 5: Projections methods. Principal Component Analysis and Kernel-PCA; independent component analysis and blind source separation techniques (Infomax, Fast-ICA, ESD).
Part 6: Stochastic optimization. Simulated annealing, mean-field techniques.
Part 7: Clustering and embedding. K-means clustering, pairwise clustering methods, self-organizing maps for central and pairwise data.
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Machine Intelligence I | Lecture | 0434 L 866 | Winter semester | – | 2 | WS 2026/27 (1) ISIS |
| Machine Intelligence II | Lecture | 0434 L 867 | Summer semester | – | 2 | ISIS |
| Machine Intelligence I | Exercise | 0434 L 866 | Winter semester | – | 2 | WS 2026/27 (1) ISIS |
| Machine Intelligence II | Exercise | 0434 L 867 | Summer semester | – | 2 | ISIS |
Courses in the course catalog
Courses created from the teaching units of this module.
Winter semester 2026/27 (2)
Machine Intelligence I (Lecture) 1
- Machine Intelligence I (Vorlesung) Termingruppe 1 0434 L 866
Machine Intelligence I (Exercise) 1
- Machine Intelligence I (Übung) Termingruppe 1 0434 L 866
Workload and credit points
Machine Intelligence I (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 2 h | 30 h |
| 60 h | |||
Machine Intelligence II (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 2 h | 30 h |
| 60 h | |||
Machine Intelligence I (Exercise)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 6 h | 90 h |
| 120 h | |||
Machine Intelligence II (Exercise)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 6 h | 90 h |
| 120 h | |||
The workload of the module adds up to 360 hours. The module therefore comprises 12 credit points.
Description of teaching and learning methods
The lecture part consists of teaching in front of the class. Participants are expected to rehearse topics after class, using their class notes as well as recommended book chapters, in preparation for the exercises and tutorials.
Homework assignments are given on a regular basis, and must be usually solved within one or two weeks. These assignments cover analytical & mathematical exercises as well as numerical simulations & programming exercises. Working in small groups of two to three students is encouraged.
Homework assignments and their solutions are discussed during the tutorial. In addition, selected topics presented during the lecture are rehearsed by the tutor as needed.
The first tutorials cover a brief mathematics primer, and recommendations are provided for Computational Neuroscience master students for the module “Individual Studies”, if deficits in their mathematical knowledge become obvious.
Homework assignments are given on a regular basis, and must be usually solved within one or two weeks. These assignments cover analytical & mathematical exercises as well as numerical simulations & programming exercises. Working in small groups of two to three students is encouraged.
Homework assignments and their solutions are discussed during the tutorial. In addition, selected topics presented during the lecture are rehearsed by the tutor as needed.
The first tutorials cover a brief mathematics primer, and recommendations are provided for Computational Neuroscience master students for the module “Individual Studies”, if deficits in their mathematical knowledge become obvious.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
- Mathematical knowledge: Analysis, linear algebra, probability calculus and statistics, on a level comparable to mathematics courses for engineers (worth 24 credit points).
- Basic programming skills.
- Good command of the English language.
- Basic programming skills.
- Good command of the English language.
Mandatory requirements for the module examination registration:
The examination requirements could not be retrieved.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Oral exam |
| Language | English |
| Duration/Extent | 30 Min. |
Duration of the module
The following number of semesters is estimated for taking and completing the module: 2 semester(s).
This module can be started in the following semesters: Winter and summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Enrollment to the module is handled in the first class of each module component (cf. 3). Students must be present in person.
The module components Machine Intelligence I (lecture with exercises) and Machine Intelligence II (lecture with exercises) can be taken in any order, i.e. students may also start the module in the summer term. To be allowed to do the oral exam, students must achieve (seperately) at least 60% of the points awarded for homework in each of the two lectures.
Students of the Master program in Computational Neuroscience have to register for the final oral exam at least three working days prior to the examination date. Registration has to be done with the examination office (Prüfungsamt) of TU Berlin.
For students from other programs, other regulations may apply. Please consult the examination regulations (Prüfungsordnung) of your program.
The module components Machine Intelligence I (lecture with exercises) and Machine Intelligence II (lecture with exercises) can be taken in any order, i.e. students may also start the module in the summer term. To be allowed to do the oral exam, students must achieve (seperately) at least 60% of the points awarded for homework in each of the two lectures.
Students of the Master program in Computational Neuroscience have to register for the final oral exam at least three working days prior to the examination date. Registration has to be done with the examination office (Prüfungsamt) of TU Berlin.
For students from other programs, other regulations may apply. Please consult the examination regulations (Prüfungsordnung) of your program.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available
Recommended literature
- 01. Bishop, Pattern Recognition and Machine Learning, Springer-Verlag, 2006. (recommended)
- 02. Duda, Hart, Stock, Pattern Classification, Wiley, 2000. (recommended)
- 03. Haykin, Neural Networks, Prentice Hall, 1998. (recommended)
- 04. Kohonen, Self-Organizing Maps, Springer-Verlag, 1997. (recommended)
- 05. Schölkopf, Smola, Learning with Kernels, MIT Press, 2002. (recommended)
- 06. Russel, Norvig, Artificial Intelligence, Prentice Hall, 2003, Chapters 13 and 14. (recommended)
- 07. Cichocki, Amari, Adaptive Blind Signal and Image Processing, Wiley, 2002. (additional)
- 08. Cowell, Dawid, Lauritzen, Spiegelhalter, Probabilistic Networks and Expert Systems, Springer Verlag, 1999. (additional)
- 09. Hyvärinen, Karhunen, Oja, Independent Component Analysis, Wiley, 2001. (additional)
- 10. Jordan (Editor), Learning in Graphical Models, MIT Press, 1999. (additional)
- 11. Kay, Fundamentals of Statistical Signal Processing - Vol. I: Estimation Theory, Prentice Hall, 1993. (additional)
- 12. Ripley, Pattern Recognition and Neural Networks, Cambridge University Press, 1996. (additional)
- 13. Vapnik, Statistical Learning Theory, Wiley, 1998. (additional)
- One or two specific book chapters are assigned / recomended to every topic of the lecture. This list of recommendations is explained during the first class of every module component and is available via TU Berlin’s ISIS platform
Assigned programs
This module is not used in any program.
Miscellaneous
The module is exclusively reserved for students of the program "Computational Neuroscience (MSc)."
Students of other programs should take the modules "Machine Intelligence 1" and "Machine Intelligence 2".
Students of other programs should take the modules "Machine Intelligence 1" and "Machine Intelligence 2".