TU Wien Informatics

CAIML Symposium 2022

  • 2022-05-24

The Center for Artificial Intelligence and Machine Learning holds a symposium on cutting-edge issues in AI research and development.

CAIML Symposium 2022
Picture: local_doctor / stock.adobe.com

  • TU Wien, Campus Getreidemarkt
    Konferenzsaal TUtheSky
  • 1060 Vienna, Getreidemarkt 9
    Bauteil BA (Hoftrakt), 11. Stock, Raum BA11B07
  • This is a hybrid event.
    See description for details.

Live Stream

Join us on the live stream.
Watch on YouTube: https://youtu.be/a6Ni_5c1m3A


14:00 Opening by Clemens Heitzinger and Stefan Woltran

14:15 “Knowledge Based AI as a mould of Human Reasoning” - Pedro Cabalar

16:00 “Handling Constraint in Stochastic Bandits” - Mohammad Ghavamzadeh

17:30 “Limits of Machines, Limits of Humans” - Edward A. Lee

reception afterwards

Knowledge-Based AI as a mould of Human Reasoning


In the last decade, Artificial Intelligence, or AI, has definitely come out from the research arena to become a disruptive technology in the socioeconomic sphere, with uncountable applications in main sectors such as industry, finance, health, digital media, security, transportation or leisure. Most of the new uses of AI are focused on the application of predictive machine learning, due to the available accurate tools that can be easily trained on massive amounts of data. However, other equally important disciplines of AI have kept successfully evolving during the last years as well, although perhaps with a more limited popularity. This is the case of Knowledge Based AI (KBAI), where tools use an explicit, formal representation of knowledge and are capable of performing different logical reasoning tasks, providing declarative problem solving capabilities. In this talk, I will discuss not only how KBAI can help humans to communicate with automated intelligent systems, but also how KBAI formalisations can help humans to understand, clarify and, eventually, mould their own natural reasoning. To illustrate this idea, I will use some humble examples from my own research, including work on rule-based, temporal, spatial, epistemic or causal reasoning, all of them relying on the paradigm of logic programming as a basis.

About Pedro Cabalar

Pedro Cabalar is an associate professor at the Computer Science and Information Technology Department, University of A Coruña, Spain. His research interests are focused on Artificial Intelligence and Knowledge Representation and Reasoning with special emphasis on temporal, causal, epistemic and qualitative spatial reasoning, mostly using non-classical logics and logic programming. Many of his contributions are related to logical foundations and extensions of Answer Set Programming. During the last 25 years, Pedro Cabalar has collaborated with more than twenty coauthors from universities of nine different countries, publishing in the most relevant journals and conferences of Knowledge Based Artificial Intelligence and Logic Programming. Pedro Cabalar has been principal investigator of five national research projects related to Knowledge Representation and Automated Reasoning with applications to the medical domain. He is currently a workgroup leader in the European COST Action DigForASP, on Automated Reasoning applied to Digital Forensics.

Handling Constraint in Stochastic Bandits


Many applications in health care, investment, and recommendation systems require optimizing over multiple objectives, some of which only appear as constraints. In constrained bandits, the agent should satisfy certain operational constraints while maximizing its cumulative reward. Depending on the form of the constraint, several constrained bandit settings have been formulated and analyzed. In this talk, we study two such problems that we refer to as “conservative exploration” and “stage-wise linear”. In conservative exploration, the constraint is history-dependent, which means it applies to a cumulative quantity over the entire run of the algorithm. On the other hand, in stage-wise linear, the constraint is independent of the past and applies to a quantity related to the distribution of the action (arm) that has just been selected. For each formulation, we derive an algorithm, provide a regret analysis, discuss the conditions under which the algorithm is tractable, identify the quantities that define the complexity of the problem, and provide some empirical results.

About Mohammad Ghavamzadeh

Mohammad Ghavamzadeh received a Ph.D. degree from UMass Amherst in 2005. He was a postdoctoral fellow at UAlberta from 2005 to 2008. He was a permanent researcher at INRIA from 2008 to 2013. He was the recipient of the “INRIA award for scientific excellence” in 2011, and obtained his Habilitation in 2014. Since 2013, he has been a senior researcher at Adobe and FAIR, and now a senior staff research scientist at Google. He has published over 100 refereed papers in major machine learning, AI, and control journals and conferences. He has co-chaired more than 10 workshops and tutorials at NeurIPS, ICML, and AAAI. His research has been mainly focused on the areas of reinforcement learning, bandit algorithms, and recommendation systems.

Limits of Machines, Limits of Humans

Find the complete program for Edward A. Lee’s Lecture here.

Curious about our other news? Subscribe to our news feed, calendar, or newsletter, or follow us on social media.