Back to AI Research

AI Research

Knowledge- and Gradient-Guided Reinforcement Learni... | AI Research

Key Takeaways

  • Knowledge- and Gradient-Guided Reinforcement Learning for Parametrized Action Markov Decision Processes This paper introduces a new approach to Reinforcement...
  • In this paper, we study Reinforcement Learning in Parametrized Action Markov Decision Processes (PAMDP), where each decision consists of a symbolic action and numerical parameters.
  • In such settings Reinforcement Learning algorithms typically determine parameters with one-shot estimators, which makes their training sample inefficient.
  • We step into this gap and propose our novel Neuro-Symbolic Knowledge- and Gradient-Guided Reinforcement Learning (KGRL) algorithm.
  • KGRL uses domain knowledge in a Datalog knowledge base to derive the set of applicable actions and feasible parameters for a given state.
Paper AbstractExpand

In this paper, we study Reinforcement Learning in Parametrized Action Markov Decision Processes (PAMDP), where each decision consists of a symbolic action and numerical parameters. In such settings Reinforcement Learning algorithms typically determine parameters with one-shot estimators, which makes their training sample inefficient. Though in most PAMDP environments explicit but incomplete knowledge (e.g., rules, safety constraints, or expert heuristics) is available, it is rarely directly used to increase the sample-efficiency of training Reinforcement Learning agents. We step into this gap and propose our novel Neuro-Symbolic Knowledge- and Gradient-Guided Reinforcement Learning (KGRL) algorithm. KGRL uses domain knowledge in a Datalog knowledge base to derive the set of applicable actions and feasible parameters for a given state. This allows it to prune non-applicable actions from the decision-space and constrain the parameter spaces of the remaining actions. We then use a gradient-based parameter refinement loop to estimate the optimal parameters during training and deployment of the agent. By recording activated rules along the trajectory, KGRL additionally provides local procedural explanations on the pruning of actions and constraining of parameters. Overall, KGRL guides the agent's exploration and deployment toward feasible and constraint-aware decisions, while increasing sample efficiency during training. KGRL outperforms state-of-the-art RL baselines for PAMDPs in both, sample efficiency and episodic return.

Knowledge- and Gradient-Guided Reinforcement Learning for Parametrized Action Markov Decision Processes
This paper introduces a new approach to Reinforcement Learning (RL) designed for complex environments where decisions involve both choosing a symbolic action (like "open valve") and setting numerical parameters (like "valve opening"). Traditional RL methods often struggle with these "Parametrized Action Markov Decision Processes" (PAMDPs) because they treat parameter selection as a simple estimation problem, leading to inefficient training and potential safety violations. The authors propose a novel algorithm called KGRL (Knowledge- and Gradient-Guided Reinforcement Learning) that bridges the gap between symbolic reasoning and neural network-based learning to improve both efficiency and safety.

Combining Symbolic Knowledge with Learning

The core innovation of KGRL is the integration of a Datalog knowledge base directly into the RL agent's decision-making process. In many real-world scenarios, developers possess incomplete but useful domain knowledge—such as safety rules or expert heuristics—that can rule out dangerous or impossible actions. KGRL uses this knowledge to evaluate the current state of the environment before the agent makes a move. By doing so, it prunes non-applicable actions and restricts the agent’s parameter choices to feasible regions, ensuring the agent only explores decisions that are known to be valid.

Gradient-Guided Parameter Refinement

Beyond pruning the decision space, KGRL improves how the agent selects numerical parameters. While standard methods rely on "one-shot" estimators that guess parameters in a single pass, KGRL employs a gradient-guided refinement loop. This mechanism uses the gradient of the agent’s action-value function to iteratively adjust and optimize parameter values. By combining this with the constraints derived from the knowledge base, the agent can fine-tune its decisions to be both optimal and compliant with domain-specific requirements, even during the training phase.

Explainability and Performance

Because KGRL evaluates a symbolic knowledge base at every step, it provides a unique benefit: transparency. The algorithm can record which specific rules were triggered and why certain actions were pruned or parameters were constrained. This creates a local, procedural explanation of the agent's behavior, which is highly valuable for safety-critical applications. In empirical evaluations, the authors demonstrate that KGRL outperforms existing state-of-the-art RL baselines, achieving higher episodic returns and reaching optimal performance significantly faster due to its more efficient exploration strategy.

Comments (0)

No comments yet

Be the first to share your thoughts!