Skip to main content

INGI Seminar - Generality and Generalisation in Principle and in Practice

icteam | Louvain-la-Neuve

icteam
13 March 2025, modified on 14 March 2025
Louvain-la-Neuve

by Dr Dennis Soemers, Department of Advanced Computing Sciences of Maastricht University

Researchers in artificial intelligence (AI) often seek to develop algorithms that exhibit high degrees of generality, as well as generalisation. "Generality" refers to the ability to apply the same technique to multiple different problems. "Generalisation" refers to the ability of a system to generalise effectively from observed situations to unseen ones. 

In this talk, I will argue that the research community currently focuses too much on techniques that are generally applicable and can generalise well in principle, but that delivering on these promises by truly scaling up to wide varieties of problems becomes infeasible in practice. Paradoxically, reducing the scope of problems that can be tackled by any single system in theory, may dramatically increase the ease with which it can be deployed to the remaining scope in practice. 

Pay attention : Sandwiches will be provided, please fill in this form before day D at 09:00 to reserve a sandw. 

Practical information : March 20th 2025 1:00-2:00 pm;  Shannon room - Maxwell, a.105 - Place du Levant, 3

 

Évènement associé

Placeholder image
INGI Seminar - Generality and Generalisation in Principle and in Practice
20 Mar
by Dr Dennis Soemers, Department of Advanced Computing Sciences of Maastricht UniversityResearchers in artificial intelligence (AI) often seek to develop algorithms that exhibit high degrees of generality, as well as generalisation. "Generality" refers to the ability to apply the same technique to multiple different problems.
Placeholder image
INGI Seminar - Generality and Generalisation in Principle and in Practice
20 Mar
by Dr Dennis Soemers, Department of Advanced Computing Sciences of Maastricht UniversityResearchers in artificial intelligence (AI) often seek to develop algorithms that exhibit high degrees of generality, as well as generalisation. "Generality" refers to the ability to apply the same technique to multiple different problems.