He Cheng
  • Bio
  • Papers
  • Projects
  • Talks
  • News
  • Services
  • Experience
  • CV

LogosKG: Hardware-Optimized Scalable and Interpretable Knowledge Graph Retrieval

Authors

He Cheng

Yifu Wu

Saksham Khatwani

Maya Kruse

Dmitriy Dligach

Timothy A. Miller

Majid Afshar

Yanjun Gao

Published

July 1, 2026

Abstract

Knowledge graphs (KGs) are increasingly integrated with large language models (LLMs) to provide structured, verifiable reasoning. A core operation in this integration is multi-hop retrieval, yet existing systems struggle to balance efficiency, scalability, and interpretability. We introduce LogosKG, a novel, hardware-aligned framework that enables scalable and interpretable k-hop retrieval on large KGs by building on symbolic KG formulations and executing traversal as hardware-efficient operations over decomposed subject, object, and relation representations. To scale to billion-edge graphs, LogosKG integrates degree-aware partitioning, cross-graph routing, and on-demand caching. Experiments show substantial efficiency gains over CPU and GPU baselines without loss of retrieval fidelity. With proven performance in KG retrieval, a downstream two-round KG-LLM interaction demonstrates how LogosKG enables large-scale, evidence-grounded analysis of how KG topology, such as hop distribution and connectivity, shapes the alignment between structured biomedical knowledge and LLM diagnostic reasoning, thereby opening the door for next-generation KG-LLM integration.

 

© 2026 He Cheng