ELENA UMILI

Dottoressa di ricerca

ciclo: XXXV


supervisore: Professor De Giacomo

Titolo della tesi: Discovering logical knowledge in non-symbolic domains

Deep learning and symbolic artificial intelligence remain the two main paradigms in Artificial Intelligence (AI), each presenting their own strengths and weaknesses. Artificial agents should integrate both of these aspects of AI in order to show general intelligence and solve complex problems in real-world scenarios; similarly to how humans use both the analytical left side and the intuitive right side of their brain in their lives. However, one of the main obstacles hindering this integration is the Symbol Grounding Problem \cite{symbol_grounding_problem}, which is the capacity to map physical world observations to a set of symbols. In this thesis, we combine symbolic reasoning and deep learning in order to better represent and reason with abstract knowledge. In particular, we focus on solving non-symbolic-state Reinforcement Learning environments using a symbolic logical domain. We consider different configurations: (i) unknown knowledge of both the symbol grounding function and the symbolic logical domain, (ii) unknown knowledge of the symbol grounding function and prior knowledge of the domain, (iii) imperfect knowledge of the symbols grounding function and unknown knowledge of the domain. We develop algorithms and neural network architectures that are general enough to be applied to different kinds of environments, which we test on both continuous-state control problems and image-based environments. Specifically, we develop two kinds of architectures: one for Markovian RL tasks and one for non-Markovian RL domains. The first is based on model-based RL and representation learning, and is inspired by the substantial prior work in state abstraction for RL \cite{Li06towardsa}. The second is mainly based on recurrent neural networks and continuous relaxations of temporal logic domains. In particular, the first approach extracts a symbolic STRIPS-like abstraction for control problems. For the second approach, we explore connections between recurrent neural networks and finite state machines, and we define \textit{Visual Reward Machines}, an extension to non-symbolic domains of Reward Machines \cite{reward-machine-sheila}, which are a popular approach to non-Markovian RL tasks.

Produzione scientifica

  • 11573/1688958 - 2023 - Neurosymbolic Integration of Linear Temporal Logic in Non Symbolic Domains (04b Atto di convegno in volume)
    UMILI, ELENA
  • 11573/1684340 - 2023 - Visual reward machines (04b Atto di convegno in volume)
    UMILI, ELENA; ARGENZIANO, FRANCESCO; BARBIN, AYMERIC; CAPOBIANCO, ROBERTO
  • 11573/1685641 - 2023 - Discovering logical knowledge in non-symbolic domains (07a Tesi di Dottorato)
    UMILI, ELENA
  • 11573/1657086 - 2022 - Grounding LTLf specifications in images (04b Atto di convegno in volume)
    UMILI, ELENA; CAPOBIANCO, ROBERTO; DE GIACOMO, GIUSEPPE
  • 11573/1688956 - 2023 - Grounding LTLf Specifications in Image Sequences (04h Atto di convegno in rivista scientifica o di classe A)
    UMILI, ELENA; CAPOBIANCO, ROBERTO; DE GIACOMO, GIUSEPPE
  • 11573/1438177 - 2020 - Communication-based and Communication-less approaches for Robust Cooperative Planning in Construction with a Team of UAVs (04b Atto di convegno in volume)
    UMILI, ELENA; ORIOLO, GIUSEPPE; FRANCHI, ANTONIO
  • 11573/1581213 - 2021 - Learning a Symbolic Planning Domain through the Interaction with Continuous Environments (04f Poster)
    UMILI, ELENA; ANTONIONI, EMANUELE; RICCIO, FRANCESCO; CAPOBIANCO, ROBERTO; NARDI, DANIELE; DE GIACOMO, GIUSEPPE

¬© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma