activity
20182026
most citedStochastic Variance-Reduced Policy Gradient

13 citations · 14 across the 7 of their papers we have counts for

collaborators

7 papers

cs.AI2026

Semantic Partial Grounding via LLMs

Giuseppe Canonaco, Alberto Pozanco, Daniel Borrajo

Grounding is a critical step in classical planning, yet it often becomes a computational bottleneck due to the exponential growth in grounded actions and atoms as task size increas…

cs.AI2025

GenPlanX. Generation of Plans and Execution

Daniel Borrajo, Giuseppe Canonaco, Tomás de la Rosa +10

Classical AI Planning techniques generate sequences of actions for complex tasks. However, they lack the ability to understand planning tasks when provided using natural language.…

cs.AI2024

Projection Abstractions in Planning Under the Lenses of Abstractions for MDPs

Giuseppe Canonaco, Alberto Pozanco, Daniel Borrajo

The concept of abstraction has been independently developed both in the context of AI Planning and discounted Markov Decision Processes (MDPs). However, the way abstractions are bu…

cs.AI2024

On Learning Action Costs from Input Plans

Marianela Morales, Alberto Pozanco, Giuseppe Canonaco +3

Most of the work on learning action models focus on learning the actions' dynamics from input plans. This allows us to specify the valid plans of a planning task. However, very lit…

cs.LG2024★ 1 cited

On the Sample Efficiency of Abstractions and Potential-Based Reward Shaping in Reinforcement Learning

Giuseppe Canonaco, Leo Ardon, Alberto Pozanco +1

The use of Potential-Based Reward Shaping (PBRS) has shown great promise in the ongoing research effort to tackle sample inefficiency in Reinforcement Learning (RL). However, choos…

cs.LG2020

Time-Variant Variational Transfer for Value Functions

Giuseppe Canonaco, Andrea Soprani, Manuel Roveri +1

In most of the transfer learning approaches to reinforcement learning (RL) the distribution over the tasks is assumed to be stationary. Therefore, the target and source tasks are i…

cs.LG2018★ 13 cited

Stochastic Variance-Reduced Policy Gradient

Matteo Papini, Damiano Binaghi, Giuseppe Canonaco +2

In this paper, we propose a novel reinforcement- learning algorithm consisting in a stochastic variance-reduced version of policy gradient for solving Markov Decision Processes (MD…