GEAKG: Generative Executable Algorithm Knowledge Graphs

• URL: http://arxiv.org/abs/2603.27922v1
• Date: Mon, 30 Mar 2026 00:42:48 GMT
• Title: GEAKG: Generative Executable Algorithm Knowledge Graphs
• Abstract summary: We introduce textitGenerative Executable Algorithm Knowledge Graphs (GEAKG)<n>A GEAKG is emphgenerative (topology and operators are synthesized by a Large Language Model), emphexecutable (every node is runnable code), and emphexecutable (learned patterns generalize zero-shot across domains)<n>Two case studies provide concrete evidence for this framework hypothesis.
• Score: 0.9214658764451348
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the context of algorithms for problem solving, procedural knowledge -- the know-how of algorithm design and operator composition -- remains implicit in code, lost between runs, and must be re-engineered for each new domain. Knowledge graphs (KGs) have proven effective for organizing declarative knowledge, yet current KG paradigms provide limited support for representing procedural knowledge as executable, learnable graph structures. We introduce \textit{Generative Executable Algorithm Knowledge Graphs} (GEAKG), a class of KGs whose nodes store executable operators, whose edges encode learned composition patterns, and whose traversal generates solutions. A GEAKG is \emph{generative} (topology and operators are synthesized by a Large Language Model), \emph{executable} (every node is runnable code), and \emph{transferable} (learned patterns generalize zero-shot across domains). The framework is domain-agnostic at the engine level: the same three-layer architecture and Ant Colony Optimization (ACO)-based learning engine can be instantiated across domains, parameterized by a pluggable ontology (\texttt{RoleSchema}). Two case studies -- sharing no domain-specific framework code -- provide concrete evidence for this framework hypothesis: (1)~Neural Architecture Search across 70 cross-dataset transfer pairs on two tabular benchmarks, and (2)~Combinatorial Optimization, where knowledge learned on the Traveling Salesman Problem transfers zero-shot to scheduling and assignment domains. Taken together, the results support that algorithmic expertise can be explicitly represented, learned, and transferred as executable knowledge graphs.

Related papers

• Code-on-Graph: Iterative Programmatic Reasoning via Large Language Models on Knowledge Graphs [79.8277120258141]
  Knowledge Graphs (KGs) are widely used to mitigate the limitations of Large Language Models (LLMs)<n>Existing LLM-KG integration frameworks rely on predefined operators to retrieve factual knowledge from KGs and inject it into prompts for answer generation.<n>We propose Code-on-Graph (CoG) as a programmatic reasoning framework for LLM-KG integration.
  arXiv  Detail & Related papers  (2026-06-02T14:22:29Z)
• Topology-Aware Reasoning over Incomplete Knowledge Graph with Graph-Based Soft Prompting [11.222318740825388]
  Large Language Models (LLMs) have shown remarkable capabilities across various tasks but remain prone to hallucinations in knowledge-intensive scenarios.<n>In this paper, we propose a novel graph-based soft prompting framework that shifts the reasoning paradigm to subgraph-level reasoning.<n> Experiments on four multi-hop KBQA benchmarks show that our approach achieves state-of-the-art performance on three of them, demonstrating its effectiveness.
  arXiv  Detail & Related papers  (2026-04-14T09:27:52Z)
• Executable Knowledge Graphs for Replicating AI Research [65.41207324831583]
  Executable Knowledge Graphs (xKG) is a modular and pluggable knowledge base that automatically integrates technical insights, code snippets, and domain-specific knowledge extracted from scientific literature.<n>Code will released at https://github.com/zjunlp/xKG.
  arXiv  Detail & Related papers  (2025-10-20T17:53:23Z)
• AutoGraph-R1: End-to-End Reinforcement Learning for Knowledge Graph Construction [60.51319139563509]
  We introduce AutoGraph-R1, the first framework to directly optimize KG construction for task performance using Reinforcement Learning (RL)<n>We design two novel, task-aware reward functions, one for graphs as knowledge carriers and another as knowledge indices.<n>Our work shows it is possible to close the loop between construction and application, shifting the paradigm from building intrinsically good'' graphs to building demonstrably useful'' ones.
  arXiv  Detail & Related papers  (2025-10-17T06:03:36Z)
• Enrich-on-Graph: Query-Graph Alignment for Complex Reasoning with LLM Enriching [61.824094419641575]
  Large Language Models (LLMs) struggle with hallucinations and factual errors in knowledge-intensive scenarios like knowledge graph question answering (KGQA)<n>We attribute this to the semantic gap between structured knowledge graphs (KGs) and unstructured queries, caused by inherent differences in their focuses and structures.<n>Existing methods usually employ resource-intensive, non-scalable reasoning on vanilla KGs, but overlook this gap.<n>We propose a flexible framework, Enrich-on-Graph (EoG), which leverages LLMs' prior knowledge to enrich KGs, bridge the semantic gap between graphs and queries.
  arXiv  Detail & Related papers  (2025-09-25T06:48:52Z)
• Enhancing Large Language Model for Knowledge Graph Completion via Structure-Aware Alignment-Tuning [52.78024385391959]
  Knowledge graph completion (KGC) aims to infer new knowledge and make predictions from knowledge graphs.<n>Existing methods often ignore the inconsistent representation spaces between natural language and graph structures.<n>We propose SAT, a novel framework that enhances LLMs for KGC via structure-aware alignment-tuning.
  arXiv  Detail & Related papers  (2025-09-01T06:38:11Z)
• Align-GRAG: Reasoning-Guided Dual Alignment for Graph Retrieval-Augmented Generation [79.75818239774952]
  Large language models (LLMs) have demonstrated remarkable capabilities, but still struggle with issues like hallucinations and outdated information.<n>Retrieval-augmented generation (RAG) addresses these issues by grounding LLM outputs in external knowledge with an Information Retrieval (IR) system.<n>We propose Align-GRAG, a novel reasoning-guided dual alignment framework in post-retrieval phrase.
  arXiv  Detail & Related papers  (2025-05-22T05:15:27Z)
• Can LLMs be Good Graph Judge for Knowledge Graph Construction? [18.05473053134776]
  We propose textbfGraphJudge, a KG construction framework to address the aforementioned challenges.<n>In this framework, we designed an entity-centric strategy to eliminate the noise information in the documents.<n>And we fine-tuned a LLM as a graph judge to finally enhance the quality of generated KGs.
  arXiv  Detail & Related papers  (2024-11-26T12:46:57Z)
• Investigating Graph Structure Information for Entity Alignment with Dangling Cases [31.779386064600956]
  Entity alignment aims to discover the equivalent entities in different knowledge graphs (KGs) We propose a novel entity alignment framework called Weakly-optimal Graph Contrastive Learning (WOGCL) We show that WOGCL outperforms the current state-of-the-art methods with pure structural information in both traditional (relaxed) and dangling settings.
  arXiv  Detail & Related papers  (2023-04-10T17:24:43Z)
• Interpretable and Efficient Heterogeneous Graph Convolutional Network [27.316334213279973]
  We propose an interpretable and efficient Heterogeneous Graph Convolutional Network (ie-HGCN) to learn the representations of objects in Heterogeneous Information Network (HINs) ie-HGCN can automatically extract useful meta-paths for each object from all possible meta-paths within a length limit. It can also reduce the computational cost by avoiding intermediate HIN transformation and neighborhood attention.
  arXiv  Detail & Related papers  (2020-05-27T06:06:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.