Skip to content

Neurosymbolic Reasoning with Incremental Knowledge for Sample Efficient Hierarchical Reinforcement Learning

Aug 2026 · Lecture notes in computer science · 0 citations · 47 references
Computer Science

TL;DR

This work proposes neurosymbolic HRL with {\em Incremental Knowledge (InK), where symbolic high-level components perform symbolic planning on an updatable representation of current InK, while low-level goal-conditioned neural modules learn motion primitives through experience using reward shaping.

Abstract

(Flat) Reinforcement Learning (RL) agents face significant challenges in environments with sparse rewards that require long-horizon reasoning. A compelling approach to improve sample efficiency is to incorporate knowledge into learning and decision-making. In standard Hierarchical RL (HRL), knowledge is encoded in a fixed, non-updatable form, such as architectural choices, and remains unchanged throughout learning. With fixed HRL, reasoning with incremental knowledge learned during exploration is impractical before sufficient environmental knowledge is acquired, leading to poor sample efficiency. In this work, we propose neurosymbolic HRL with {\em Incremental Knowledge (InK)}: symbolic high-level components perform {\em symbolic planning} (e.g. using $D^*$) on an updatable representation of current InK, while low-level goal-conditioned neural modules learn motion primitives through experience using reward shaping. Experiments on navigation tasks demonstrate that incorporating InK substantially improves sample efficiency. Additionally, to perform {\em optimal} symbolic planning given {\em prior} knowledge about the world, we develop Belief World Tree Search. The code is available at https://github.com/CPS-research-group/ink_bwts.

Read PDF

Similar papers

Conference Open access 2026

On-policy Reinforcement Fine-tuning with Offline reward for Multi-step Embodied Planning

Experimental results show that ORBIT achieves SOTA performance on EB-ALFRED, outper-forming all closed-source and online-RL-based methods, while being substantially more effi-cient in training speed and computational cost, remaining robust to sub-optimal expert trajectories, and exhibiting strong generalization to unsee...

Di Wu, Jiaxin Fan, Chloe Gu et al. · 1 citation
Preprint Aug 2026

Learning Loco-Manipulation From SMPC Demonstrations With Sparse Offline-to-Online RL

This work uses Sample-based Model Predictive Control entirely in simulation as an automated, rapidly tunable expert to generate massive offline datasets and validate the robustness of this sim-to-real framework by successfully deploying complex loco-manipulation skills across different morphologies.

Martin Schuck, Maks Sorokin, S. Manni et al. · 1 citation
Preprint Aug 2026

Instruction-Conditioned Exploration for Reinforcement Learning with Self-Distillation to an Unconditioned Policy

Instruction-Conditioned Exploration (ICE), which appends one of a small fixed set of instructions to task prompts during training, using the same set for every problem, increasing the coverage of behaviours attempted, improves Qwen3-1.7B held-out pass@1 performance at 4K response length on mathematical reasoning tasks.

Jim Dilkes, V. Yazdanpanah, Sebastian Stein · 0 citations

Dissecting Reinforcement Learning: Mechanisms Behind Compositional Reasoning in LLMs

This thesis proposes a unified two-axis framework that organizes SFT and RL methods along a data axis (off-policy to on-policy) and a loss function axis (positive-only to positive-plus-negative to GRPO) and enables controlled ablations of individual components.

G. Kim, Chair Chenyan Xiong, Aditi Raghunathan · 0 citations
Jul 2026

Learning as Reasoning Unfolds: Progressive Rollout Allocation for Efficient Reinforcement Learning

VarIance Guided Online Rollout allocation (VIGOR) is proposed which instead of allocating a fixed rollout budget per example, begins with a small number of rollouts for all examples in a batch and iteratively allocates additional rollouts to those with the highest group reward variance until a fixed total rollout budge...

Heyang Jiang, Henry Liu, Baharan Mirzasoleiman · 1 citation
Preprint Jul 2026

ExToken: Structured Exploration for Efficient Vision-Language-Action Reinforcement Fine-tuning

ExToken is introduced, a simple yet general framework that condition VLA policies on discrete behavioral priors derived from offline demonstrations for structured exploration that consistently accelerates convergence, improves task performance, and exhibits strong robustness under highly constrained interaction budgets...

Yilun Kong, Yunpeng Qing, Guozheng Ma et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.