(→Course grading) |
|||
(36 intermediate revisions by the same user not shown) | |||
Riadok 1: | Riadok 1: | ||
{{CourseHeader | {{CourseHeader | ||
− | | code = 2-IKV- | + | | code = 2-IKV-115a |
| title = Introduction to Computational Intelligence | | title = Introduction to Computational Intelligence | ||
}} | }} | ||
Riadok 8: | Riadok 8: | ||
<!--[https://sluzby.fmph.uniba.sk/infolist/sk/2-AIN-132_15.html Informačný list predmetu]--> | <!--[https://sluzby.fmph.uniba.sk/infolist/sk/2-AIN-132_15.html Informačný list predmetu]--> | ||
− | |||
− | |||
− | |||
<!-- | <!-- | ||
− | ;16. 9. | + | == News == |
− | : We start on | + | <!--'''Exam:''' The list of questions is [http://dai.fmph.uniba.sk/courses/ICI/ci-exam-questions.pdf here]. You will choose three questions (pseudo)randomly. |
+ | |||
+ | ;16. 9. 2020 | ||
+ | : We start (exceptionally) on Tuesday, 22nd September at 16:30 (there is no cognitive science seminar yet) <b>online</b>.--> | ||
+ | |||
<!-- [[#Archív noviniek|Archív noviniek…]] --> | <!-- [[#Archív noviniek|Archív noviniek…]] --> | ||
Riadok 29: | Riadok 30: | ||
|Monday | |Monday | ||
|9:00 - 10:30 | |9:00 - 10:30 | ||
− | | | + | |online |
|[[Igor Farkas|Igor Farkaš]] | |[[Igor Farkas|Igor Farkaš]] | ||
|- | |- | ||
Riadok 35: | Riadok 36: | ||
|Thursday | |Thursday | ||
|14:00 - 15:30 | |14:00 - 15:30 | ||
− | | | + | |online |
|[[Endre Hamerlik]] & [[Igor Farkas|Igor Farkaš]] | |[[Endre Hamerlik]] & [[Igor Farkas|Igor Farkaš]] | ||
|} | |} | ||
− | |||
== Syllabus == | == Syllabus == | ||
{| class="alternative table-responsive" | {| class="alternative table-responsive" | ||
+ | !# | ||
!Date | !Date | ||
!Topic | !Topic | ||
!References | !References | ||
|- | |- | ||
− | |22.09. | + | |1. |
− | |What is computational intelligence, basic concepts, relation to artificial intelligence. | + | |22.09. |
+ | |What is computational intelligence, basic concepts, relation to artificial intelligence. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-def.4x.pdf slides] | ||
|Craenen & Eiben (2003); [https://en.wikipedia.org/wiki/Computational_intelligence wikipedia]; R&N (2010), chap.1; Sloman (2002) | |Craenen & Eiben (2003); [https://en.wikipedia.org/wiki/Computational_intelligence wikipedia]; R&N (2010), chap.1; Sloman (2002) | ||
|- | |- | ||
+ | |2. | ||
|28.09. | |28.09. | ||
− | |Taxonomy of artificial agents, nature of environments. | + | |Taxonomy of artificial agents, nature of environments. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-agents.4x.pdf slides] |
|R&N (2010), chap.2 | |R&N (2010), chap.2 | ||
|- | |- | ||
+ | |3. | ||
|05.10. | |05.10. | ||
− | |Inductive learning via observations, decision trees. Model selection. | + | |Inductive learning via observations, decision trees. Model selection. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-learning.4x.pdf slides] |
− | |R&N (2010), ch.18.1-3,18.6; Marsland ( | + | |R&N (2010), ch.18.1-3,18.6; Marsland (2015), ch.12 <!--[http://www.r2d3.us/visual-intro-to-machine-learning-part-1/ DT visualization], [https://www.youtube.com/watch?v=LDRbO9a6XPU DT in python], [https://www.youtube.com/watch?v=2s3aJfRr9gE information entropy], [https://www.youtube.com/watch?v=EuBBz3bI-aA bias-variance tradeoff]--> |
|- | |- | ||
+ | |4. | ||
|12.10. | |12.10. | ||
− | |Supervised learning in feedforward neural networks (perceptrons), pattern classification, function approximation. | + | |Supervised learning in feedforward neural networks (perceptrons), pattern classification, function approximation. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-fwdnn.4x.pdf slides] |
− | |R&N (2010), ch.18.2; Marsland ( | + | |R&N (2010), ch.18.2; Marsland (2015), ch.3-4, Engelbrecht (2007), ch.2-3 |
|- | |- | ||
+ | |5. | ||
|19.10. | |19.10. | ||
− | |Unsupervised (self-organizing) neural networks: feature extraction, data visualization. | + | |Unsupervised (self-organizing) neural networks: feature extraction, data visualization. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-unsup.4x.pdf slides] |
− | |Marsland ( | + | |Marsland (2015), ch.14, Engelbrecht (2007), ch.4 |
|- | |- | ||
+ | |6. | ||
|26.10. | |26.10. | ||
− | |Statistical learning, probabilistic models. | + | |Statistical learning, probabilistic models. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-prob.4x.pdf slides] |
− | |R&N (2010), ch.13,20 | + | |R&N (2010), ch.13,20.1-2 |
|- | |- | ||
− | |||
| | | | ||
+ | |02.11. | ||
+ | |Q&A - preparation for midterm | ||
|Thursday: mid-term test | |Thursday: mid-term test | ||
|- | |- | ||
+ | |7. | ||
|09.11. | |09.11. | ||
− | |Reinforcement learning I: basic principles and learning methods (TD-learning). Prediction problem. | + | |Reinforcement learning I: basic principles and learning methods (TD-learning). Prediction problem. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-rl.4x.pdf slides] |
|R&N (2010), ch.21.1-2. | |R&N (2010), ch.21.1-2. | ||
|- | |- | ||
+ | |8. | ||
|16.11. | |16.11. | ||
|Reinforcement learning II (Q, SARSA), actor-critic, control problem, RL for continuous domains. | |Reinforcement learning II (Q, SARSA), actor-critic, control problem, RL for continuous domains. | ||
|R&N (2010), ch.21.3-5; Woergoetter & Porr (2008). | |R&N (2010), ch.21.3-5; Woergoetter & Porr (2008). | ||
|- | |- | ||
+ | |9. | ||
|23.11. | |23.11. | ||
− | |Evolutionary computation: basic concepts, genetic algorithms. | + | |Evolutionary computation: basic concepts, genetic algorithms. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-evol.4x.pdf slides] |
|Engelbrecht (2007), ch.8 | |Engelbrecht (2007), ch.8 | ||
|- | |- | ||
+ | |10. | ||
|30.11. | |30.11. | ||
− | |Fuzzy systems, fuzzy logic and reasoning. | + | |Fuzzy systems, fuzzy logic and reasoning. [http://dai.fmph.uniba.sk/courses/ICI/References/ci-fuzzy.4x.pdf slides] |
|Engelbrecht (2007), ch.20-21; Zadeh (2007) | |Engelbrecht (2007), ch.20-21; Zadeh (2007) | ||
+ | |- | ||
+ | |11. | ||
+ | |07.12. | ||
+ | |Explainable artificial intelligence (XAI). [http://dai.fmph.uniba.sk/courses/ICI/References/ci-xai.4x.pdf slides] | ||
+ | |Barreto Arrieta A. et al. (2020) | ||
+ | |- | ||
+ | | | ||
+ | |15.12. | ||
+ | |Summary, recap of main concepts, synergies. | ||
+ | | | ||
|} | |} | ||
Note: Dates refer to lectures, seminars will be on day+3 each week. | Note: Dates refer to lectures, seminars will be on day+3 each week. | ||
Riadok 95: | Riadok 117: | ||
== References == | == References == | ||
+ | * Barreto Arrieta A. et al. (2020). [https://doi.org/10.1016/j.inffus.2019.12.012 Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI]. Information Fusion, 58, pp. 82-115. | ||
* Craenen B., Eiben A. (2003): [http://dai.fmph.uniba.sk/courses/ICI/craenen.ci.enc03.pdf Computational Intelligence]. In: Encyclopedia of Life Support Sciences, EOLSS Publishers Co. | * Craenen B., Eiben A. (2003): [http://dai.fmph.uniba.sk/courses/ICI/craenen.ci.enc03.pdf Computational Intelligence]. In: Encyclopedia of Life Support Sciences, EOLSS Publishers Co. | ||
* Engelbrecht A. (2007). [http://dai.fmph.uniba.sk/courses/ICI/engelbrecht.comp-intel-intro.07.pdf Computational Intelligence: An Introduction] (2nd ed.), John Willey & Sons. | * Engelbrecht A. (2007). [http://dai.fmph.uniba.sk/courses/ICI/engelbrecht.comp-intel-intro.07.pdf Computational Intelligence: An Introduction] (2nd ed.), John Willey & Sons. | ||
Riadok 101: | Riadok 124: | ||
* Sloman A. (2002). [http://www.cs.bham.ac.uk/research/projects/cogaff/sloman.turing.irrelevant.pdf The Irrelevance of Turing Machines to AI]. In Scheutz M. (ed.): Computationalism: New Directions, MIT Press, Cambridge, MA, pp. 87–127. | * Sloman A. (2002). [http://www.cs.bham.ac.uk/research/projects/cogaff/sloman.turing.irrelevant.pdf The Irrelevance of Turing Machines to AI]. In Scheutz M. (ed.): Computationalism: New Directions, MIT Press, Cambridge, MA, pp. 87–127. | ||
* Woergoetter F., Porr B. (2008). [http://www.scholarpedia.org/article/Reinforcement_learning Reinforcement learning], Scholarpedia, 3(3):1448. | * Woergoetter F., Porr B. (2008). [http://www.scholarpedia.org/article/Reinforcement_learning Reinforcement learning], Scholarpedia, 3(3):1448. | ||
− | * Zadeh L. (2007). [http://www.scholarpedia.org/article/Fuzzy_logic Fuzzy logic], Scholarpedia, 3(3):1766. | + | * Zadeh L. (2007). [http://www.scholarpedia.org/article/Fuzzy_logic Fuzzy logic], Scholarpedia, 3(3):1766. |
== Course grading == | == Course grading == | ||
Riadok 107: | Riadok 130: | ||
* Active participation during the lectures/exercises (35%): 15 for lectures, 20 for exercises. | * Active participation during the lectures/exercises (35%): 15 for lectures, 20 for exercises. | ||
* Written mid-term test (30%). | * Written mid-term test (30%). | ||
− | * Final | + | * Final oral exam (30%): you will choose 3 questions, minimum of 1/3 of all points required. We will discuss 3 randomly chosen (by a computer) questions that basically correspond to weekly topics during the semester. |
− | * Small final project (10%) = implementation of a small neural network (using an existing Python library) and writing a short report. Note: even without this, the student can still get maximum points if s/he has performed very actively. | + | * Small final project (10%) = implementation of a small neural network (using an existing Python library) and writing a short report. Note: even without this, the student can still get maximum points if s/he has performed very actively. Deadline: 17th January, 2021. |
* <b>Overall grading:</b> A (>90%), B (>80%), C (>70%), D (>60%), E (>50%), Fx (otherwise). | * <b>Overall grading:</b> A (>90%), B (>80%), C (>70%), D (>60%), E (>50%), Fx (otherwise). |
Verzia zo dňa a času 14:26, 11. máj 2021
Introduction to Computational Intelligence 2-IKV-115a
Obsah
The course objectives are to make the students familiar with basic principles of various computational methods of data processing that can commonly be called computational intelligence (CI). This includes mainly bottom-up approaches to solutions of (hard) problems based on various heuristics (soft computing), rather than exact approaches of traditional artificial intelligence based on logic (hard computing). Examples of CI are nature-inspired methods (artificial neural networks, evolutionary algorithms, fuzzy systems), as well as probabilistic methods and reinforcement learning. After the course the students will be able to conceptually understand the important terms and algorithms of CI, and choose appropriate method(s) for a given task. The theoretical lectures are combined with the seminar where the important concepts will be discussed and practical examples will be shown.
Course schedule
Type | Day | Time | Room | Lecturer |
---|---|---|---|---|
Lecture | Monday | 9:00 - 10:30 | online | Igor Farkaš |
Seminar | Thursday | 14:00 - 15:30 | online | Endre Hamerlik & Igor Farkaš |
Syllabus
# | Date | Topic | References |
---|---|---|---|
1. | 22.09. | What is computational intelligence, basic concepts, relation to artificial intelligence. slides | Craenen & Eiben (2003); wikipedia; R&N (2010), chap.1; Sloman (2002) |
2. | 28.09. | Taxonomy of artificial agents, nature of environments. slides | R&N (2010), chap.2 |
3. | 05.10. | Inductive learning via observations, decision trees. Model selection. slides | R&N (2010), ch.18.1-3,18.6; Marsland (2015), ch.12 |
4. | 12.10. | Supervised learning in feedforward neural networks (perceptrons), pattern classification, function approximation. slides | R&N (2010), ch.18.2; Marsland (2015), ch.3-4, Engelbrecht (2007), ch.2-3 |
5. | 19.10. | Unsupervised (self-organizing) neural networks: feature extraction, data visualization. slides | Marsland (2015), ch.14, Engelbrecht (2007), ch.4 |
6. | 26.10. | Statistical learning, probabilistic models. slides | R&N (2010), ch.13,20.1-2 |
02.11. | Q&A - preparation for midterm | Thursday: mid-term test | |
7. | 09.11. | Reinforcement learning I: basic principles and learning methods (TD-learning). Prediction problem. slides | R&N (2010), ch.21.1-2. |
8. | 16.11. | Reinforcement learning II (Q, SARSA), actor-critic, control problem, RL for continuous domains. | R&N (2010), ch.21.3-5; Woergoetter & Porr (2008). |
9. | 23.11. | Evolutionary computation: basic concepts, genetic algorithms. slides | Engelbrecht (2007), ch.8 |
10. | 30.11. | Fuzzy systems, fuzzy logic and reasoning. slides | Engelbrecht (2007), ch.20-21; Zadeh (2007) |
11. | 07.12. | Explainable artificial intelligence (XAI). slides | Barreto Arrieta A. et al. (2020) |
15.12. | Summary, recap of main concepts, synergies. |
Note: Dates refer to lectures, seminars will be on day+3 each week.
References
- Barreto Arrieta A. et al. (2020). Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI. Information Fusion, 58, pp. 82-115.
- Craenen B., Eiben A. (2003): Computational Intelligence. In: Encyclopedia of Life Support Sciences, EOLSS Publishers Co.
- Engelbrecht A. (2007). Computational Intelligence: An Introduction (2nd ed.), John Willey & Sons.
- Russell S., Norwig P. (2010). Artificial Intelligence: A Modern Approach, (3rd ed.), Prentice Hall. Available in the faculty library.
- Marsland S. (2015). Machine Learning: An Algorithmic Perspective, (2nd ed.), CRC Press.
- Sloman A. (2002). The Irrelevance of Turing Machines to AI. In Scheutz M. (ed.): Computationalism: New Directions, MIT Press, Cambridge, MA, pp. 87–127.
- Woergoetter F., Porr B. (2008). Reinforcement learning, Scholarpedia, 3(3):1448.
- Zadeh L. (2007). Fuzzy logic, Scholarpedia, 3(3):1766.
Course grading
- Active participation during the lectures/exercises (35%): 15 for lectures, 20 for exercises.
- Written mid-term test (30%).
- Final oral exam (30%): you will choose 3 questions, minimum of 1/3 of all points required. We will discuss 3 randomly chosen (by a computer) questions that basically correspond to weekly topics during the semester.
- Small final project (10%) = implementation of a small neural network (using an existing Python library) and writing a short report. Note: even without this, the student can still get maximum points if s/he has performed very actively. Deadline: 17th January, 2021.
- Overall grading: A (>90%), B (>80%), C (>70%), D (>60%), E (>50%), Fx (otherwise).