analiza aiqbench
This research advances reinforcement learning by integrating neuro-symbolic methods with temporal knowledge graphs, enabling agents to make adaptive memory decisions under partial observability while maintaining interpretability via RDF semantics. The approach demonstrates superior performance in long-term memory tasks compared to purely neural or symbolic baselines, offering a robust framework for systems requiring traceable reasoning over complex state histories.
Neuro-Symbolic Meta-Policies for Temporal Knowledge-Graph Memory under Partial Observability
arXiv:2607.18368v1 Announce Type: new Abstract: Partially observable reinforcement learning requires deciding what to retain, retrieve, and forget over time. We introduce a neuro-symbolic meta-policy that learns which symbolic memory heuristic to apply at each decision point while keeping execution symbolic. Our setting uses temporal knowledge-graph memory in RoomKG, where hidden state and observations are represented as Resource Description Framework (RDF) graphs and memory is augmented with temporal RDF triple annotations. The model combines knowledge-graph encoding of memory contents with value heads for question answering, exploration, and forgetting, yielding a controller that is both adaptive and inspectable. This gives the work a direct Semantic Web grounding through RDF-based representation, annotation-compatible graph semantics, and graph-based symbolic operations over explicit memory state. On train/test room splits at long-term memory capacity of 512, the qualifier-aware StarE-GNN configuration achieves the best held-out performance among the compared symbolic, neural, and neuro-symbolic systems while preserving step-level traceability of memory-management decisions.
Abstract:Partially observable reinforcement learning requires deciding what to retain, retrieve, and forget over time. We introduce a neuro-symbolic meta-policy that learns which symbolic memory heuristic to apply at each decision point while keeping execution symbolic. Our setting uses temporal knowledge-graph memory in RoomKG, where hidden state and observations are represented as Resource Description Framework (RDF) graphs and memory is augmented with temporal RDF triple annotations. The model combines knowledge-graph encoding of memory contents with value heads for question answering, exploration, and forgetting, yielding a controller that is both adaptive and inspectable. This gives the work a direct Semantic Web grounding through RDF-based representation, annotation-compatible graph semantics, and graph-based symbolic operations over explicit memory state. On train/test room splits at long-term memory capacity of 512, the qualifier-aware StarE-GNN configuration achieves the best held-out performance among the compared symbolic, neural, and neuro-symbolic systems while preserving step-level traceability of memory-management decisions.
Artificial Intelligence (cs.AI)
arXiv:2607.18368 [cs.AI]
(or arXiv:2607.18368v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2607.18368 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 242 cuvinte
Subiecte conexe
Short-Term-to-Long-Term Memory Transfer for Knowledge Graphs under Partial Observability
arXiv · 28 iul. 2026

[AINews] Fal’s H3 Max Live breaks the infinite videogen barrier
Latent Space · 1 sept. 2026
Towards Neuro-Symbolic Procedural Reasoning for Long-Horizon Vision-Language-Action Manipulation
arXiv · 7 sept. 2026

Academia is for Ambition — Alex Zhang, MIT
Latent Space · 2 oct. 2026