Complexity classes: P, NP, NP-hard, …; metaheuristics: the basic idea; genetic algorithms, genetic programming, …; advantages, disadvantages, sample efficiency, …
Content:
– Complexity classes: NP, NP-hard, ...
– Metaheuristics: the basic idea;
– Genetic algorithms (GA);
– Genetic programming (GP);
– High-level: other approaches, e.g. swarms etc.
– Advantages/problems, especially w.r.t. sample efficiency.
A set of colab notebooks, regarding especially these topics:
– GA cars in HTML/javascript;
– Optimization using GA: an example;
– GP for symbolic regression;
– GA for evolving a neural network for the “Flappy” game;
– ...
The estimated additional time required for studying the material independently, using the lecture videos/slides and also referencing other literature and material, as necessary. Facilitates correct understanding of the material.
This activity also includes the time required for review before exams.
Quiz activities meant to provide quick, unassessed feedback to students regarding their grasp of the material.