The Mechanism Matters: When Knowledge Graphs Help Reinforcement Learning
Knowledge graphs (KGs) are widely used to inject prior knowledge into reinforcement learning (RL), yet the literature is dominated by single-domain, positive-result method papers, so we lack a systematic account of when KG structure helps an agent, when it is neutral, and when it hurts. We conduct a controlled study that independently varies the RL task, the injection mechanism (state features, action masking, or potential-based reward shaping), and KG quality. Using a synthetic, fully controllable KG over MiniGrid environments, we report three findings. First, on compositional sparse-reward tasks structured KG guidance improves sample efficiency and solve reliability (70% to 97% of seeds), and a shuffle control that permutes the KG's edges while preserving their count collapses the benefit toward baseline (masking p=0.0001; shaping p=0.006), so the gain is structural rather than generic regularization. Second, KG value scales with the amount of task-relevant knowledge the graph contains. Third, and most consequential, safety depends on the mechanism: soft, optimality-preserving injection benefits from correct knowledge and harmlessly ignores incorrect knowledge, whereas hard masking is brittle, forbidding essential actions when the KG is incomplete or corrupted and making a wrong KG worse than none. A UMLS-derived clinical case study on sepsis management under offline RL is a careful null, underscoring that benefits require task structure the chosen mechanism can exploit. Our results give practitioners concrete guidance on how, and how much, to trust a KG when using it to guide RL.
Code (0)
등록된 구현이 없습니다.
Tasks
Reinforcement LearningKnowledge GraphsOffline RLSimilar Papers 제목 키워드 기반
Order Matters: Matching Multiple Knowledge Graphs
Knowledge graphs (KGs) provide information in machine interpretable form. In cases where multiple KGs are used in the same system, that information needs to be integrated. This is usually done by automated matching syste…
Knowledge GraphsProbabilistic Knowledge Graph Embeddings
We develop a probabilistic extension of state-of-the-art embedding models for link prediction in relational knowledge graphs. Knowledge graphs are collections of relational facts, where each fact states that a certain re…
Knowledge Graph EmbeddingsKnowledge GraphsLink PredictionVariational InferenceConstruction d'un système de recommandation basé sur des contraintes via des graphes de connaissances
Knowledge graphs in RDF model entities and their relations using ontologies, and have gained popularity for information modeling. In recommender systems, knowledge graphs help represent more links and relationships betwe…
Knowledge GraphsRecommendation Systems6G Networks: Beyond Shannon Towards Semantic and Goal-Oriented Communications
The goal of this paper is to promote the idea that including semantic and goal-oriented aspects in future 6G networks can produce a significant leap forward in terms of system effectiveness and sustainability. Semantic c…
BIG-bench Machine LearningSemantic CommunicationDiversified and Adaptive Negative Sampling on Knowledge Graphs
In knowledge graph embedding, aside from positive triplets (ie: facts in the knowledge graph), the negative triplets used for training also have a direct influence on the model performance. In reality, since knowledge gr…
Graph EmbeddingInformativenessKnowledge Graph EmbeddingKnowledge Graphs+1