Servizi per la didattica
PORTALE DELLA DIDATTICA

Computational intelligence

01URROV

A.A. 2021/22

Course Language

Inglese

Course degree

Master of science-level of the Bologna process in Ingegneria Informatica (Computer Engineering) - Torino

Course structure
Teaching Hours
Lezioni 42
Esercitazioni in laboratorio 18
Teachers
Teacher Status SSD h.Les h.Ex h.Lab h.Tut Years teaching
Squillero Giovanni   Professore Associato ING-INF/05 42 0 0 0 1
Teaching assistant
Espandi

Context
SSD CFU Activities Area context
ING-INF/05 6 B - Caratterizzanti Ingegneria informatica
2021/22
The course introduces the basic principles of various computational methods of data processing that are commonly grouped under the umbrella term “computational intelligence”. Students will acquire both theoretical and practical knowledge on methods that exploit bottom-up approaches and (meta)heuristics, where solutions are searched or built through trial-and-error. They will understand the principles of local search, evolutionary computation, multi-agent systems, and policy learning. At the same time, the course surveys how the different types of information should be encoded and handled by the different algorithms, allowing students to effectively tackle problems involving highly-structured, uncertain (possible), and imprecise (fuzzy) information.
The course introduces the basic principles of various computational methods of data processing that are commonly grouped under the umbrella term “computational intelligence”. Students will acquire both theoretical and practical knowledge on methods that exploit bottom-up approaches and (meta)heuristics, where solutions are searched or built through trial-and-error. They will understand the principles of local search, evolutionary computation, multi-agent systems, and policy learning. At the same time, the course surveys how the different types of information should be encoded and handled by the different algorithms, allowing students to effectively tackle problems involving highly-structured, uncertain (possible), and imprecise (fuzzy) information.
The knowledge and skills required to design and implement effective and efficient computational-intelligence solutions to problems for which a direct solution is impractical or unknown. • Implement from scratch single-state and simple population-based methods when required • Tweak and exploit existing libraries for evolutionary optimization • Choose/evaluate pros and cons of alternatives knowledge representations • Design multi-agent systems
The knowledge and skills required to design and implement effective and efficient computational-intelligence solutions to problems for which a direct solution is impractical or unknown. In more details: Knowledge and understanding: • Explain basic concepts of CI • Account for the historical development, current situation, and future prospects for some sub-area of CI • Compare advantages and disadvantages of basic CI algorithms • Choose/evaluate pros and cons of alternatives knowledge representations Skills and abilities: • Choose appropriate algorithms for solving given problems in a memory- and time-efficient manner • Implement from scratch single-state and simple population-based methods in Python • Tweak and exploit existing libraries • Design multi-agent systems Judgement and approach: • Summarize and constructively criticize scientific texts.
• Experience with Python 3 • Suggested: Algorithms and Programming • Not required: mathematics and statistics • Not required: knowledge of specific toolkits (e.g., Jenetics, scikit-learn, Open BEAGLE, PyTorch, Keras/TensorFlow)
• Required: Experience with Python 3 • Suggested: Algorithms and Programming • Not required: mathematics and statistics • Not required: knowledge of specific toolkits (e.g., Jenetics, scikit-learn, Open BEAGLE, PyTorch, Keras/TensorFlow)
• Introduction • What is "Computational Intelligence"? (and what is “Artificial Intelligence”? Weak AI vs. Strong AI, the Turing Test) • Metaheuristics (exact vs. approximate, ad-hoc heuristics) • Solving problems by searching; trial n’ error vs. learning vs. evolution • Evolutionary Computation (bio-inspired methodologies, natural selection) • Single-State Methods • Hill-climbing, simulated annealing, iterated local search, variable neighborhood search • Simple Evolution Strategies: (1+1), (1+λ) and (1,λ) • Population Methods • Unified approach to Evolutionary Algorithms • Parameter optimization (Evolution Strategies, Differential Evolution) • Symbolic regression (Genetic Programming) • Swarm intelligence (Ant Colony Optimization, Particle Swarm Optimization) • Memetic Algorithms (hybridization) • Model fitting (Estimation of Distribution Algorithm) • Multi-objective optimization • Representation problems; genotype space and operators • Knowledge representation • Trivial (bit strings, integer, real numbers); Permutations; Graphs • Fuzzification • Policy optimization • Evolutionary programming • Reinforcement learning, Q-Learning • Multi agent systems • Artificial Immune System and Learning Classifier Systems • Simple agents • Learning agents • Games (Adversarial Search)
• Introduction • What is "Computational Intelligence"? (and what is “Artificial Intelligence”? Weak AI vs. Strong AI, the Turing Test) • Metaheuristics (exact vs. approximate, ad-hoc heuristics) • Solving problems by searching; trial n’ error vs. learning vs. evolution • Evolutionary Computation (bio-inspired methodologies, natural selection) • Single-State Methods • Hill-climbing, simulated annealing, iterated local search, variable neighborhood search • Simple Evolution Strategies: (1+1), (1+λ) and (1,λ) • Population Methods • Unified approach to Evolutionary Algorithms • Parameter optimization (Evolution Strategies, Differential Evolution) • Symbolic regression (Genetic Programming) • Swarm intelligence (Ant Colony Optimization, Particle Swarm Optimization) • Memetic Algorithms (hybridization) • Model fitting (Estimation of Distribution Algorithm) • Multi-objective optimization • Representation problems; genotype space and operators • Knowledge representation • Trivial (bit strings, integer, real numbers); Permutations; Graphs • Fuzzification • Policy optimization • Evolutionary programming • Reinforcement learning, Q-Learning • Multi agent systems • Artificial Immune System and Learning Classifier System • Simple agents • Learning agents • Games (Adversarial Search)
• 42 hours lectures • 18 hours labs
• 42 hours lectures • 18 hours labs
Recommended Books • A. E. Eiben, J. E. Smith; Introduction to Evolutionary Computing (2nd edition) • S. Luke; Essentials of Metaheuristics (2nd edition) • S. Russell, P. Norvig; Artificial Intelligence: A Modern Approach (4th edition) • B. Slatkin; Effective Python: 90 Specific Ways to Write Better Python (2nd edition)
Textbook • None Recommended Books • S. Russell, P. Norvig; Artificial Intelligence: A Modern Approach (4th edition) • A. E. Eiben, J. E. Smith; Introduction to Evolutionary Computing (2nd edition) • S. Luke; Essentials of Metaheuristics (2nd edition)
Modalità di esame: Prova orale obbligatoria; Elaborato progettuale individuale; Elaborato progettuale in gruppo;
Exam: Compulsory oral exam; Individual project; Group project;
Students need to complete a research project tackling a specific problem; they will need to skim the scientific literature and then implement an appropriate methodology or develop a new one. Students are free to propose their own topics and are encouraged to work in teams, but for the exam each one will be individually responsible for the whole assignment. The repository on GitHub containing code, documentation and report must be made available 1 week before the day of the exam. Score: an offset from -3 to +3 based on agent performances. The oral exam consists in a discussion starting from the research project and covering all topics of the course. Score: from 0 to 30.
Modalità di esame: Prova orale obbligatoria; Elaborato progettuale individuale; Elaborato progettuale in gruppo;
Exam: Compulsory oral exam; Individual project; Group project;
Students need to complete a research project tackling a specific problem; they will need to skim the scientific literature and then implement an appropriate methodology or develop a new one. Students are free to propose their own topics and are encouraged to work in teams, but for the exam each one will be individually responsible for the whole assignment. The repository on GitHub containing code, documentation and report must be made available 1 week before the day of the exam. Score: an offset from -3 to +3 based on agent performances. The oral exam consists in a discussion starting from the research project and covering all topics of the course. Score: from 0 to 30.
Modalità di esame: Prova orale obbligatoria; Elaborato progettuale individuale; Elaborato progettuale in gruppo;
Exam: Compulsory oral exam; Individual project; Group project;
Students need to complete a research project tackling a specific problem; they will need to skim the scientific literature and then implement an appropriate methodology or develop a new one. Students are free to propose their own topics and are encouraged to work in teams, but for the exam each one will be individually responsible for the whole assignment. The repository on GitHub containing code, documentation and report must be made available 1 week before the day of the exam. Score: an offset from -3 to +3 based on agent performances. The oral exam consists in a discussion starting from the research project and covering all topics of the course. Score: from 0 to 30.
Esporta Word


© Politecnico di Torino
Corso Duca degli Abruzzi, 24 - 10129 Torino, ITALY
Contatti