Structure-Grounded Knowledge Retrieval via Code Dependencies for Multi-Step Data Reasoning

arXiv cs.CL / 4/14/2026

💬 OpinionSignals & Early TrendsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper argues that retrieval-augmented LLM approaches often use lexical/embedding similarity, which can be a poor proxy for the actual knowledge needed for multi-step data reasoning.
  • It proposes SGKR (Structure-Grounded Knowledge Retrieval), which builds a dependency graph of domain knowledge based on function-call relationships rather than textual similarity alone.
  • For a given question, SGKR derives semantic input/output tags, finds dependency paths connecting them, and assembles a task-relevant subgraph plus corresponding function implementations as structured context for LLM code generation.
  • Experiments on multi-step data analysis benchmarks show SGKR improves solution correctness compared with no-retrieval and similarity-based retrieval baselines, for both vanilla LLMs and coding agents.

Abstract

Selecting the right knowledge is critical when using large language models (LLMs) to solve domain-specific data analysis tasks. However, most retrieval-augmented approaches rely primarily on lexical or embedding similarity, which is often a weak proxy for the task-critical knowledge needed for multi-step reasoning. In many such tasks, the relevant knowledge is not merely textually related to the query, but is instead grounded in executable code and the dependency structure through which computations are carried out. To address this mismatch, we propose SGKR (Structure-Grounded Knowledge Retrieval), a retrieval framework that organizes domain knowledge with a graph induced by function-call dependencies. Given a question, SGKR extracts semantic input and output tags, identifies dependency paths connecting them, and constructs a task-relevant subgraph. The associated knowledge and corresponding function implementations are then assembled as a structured context for LLM-based code generation. Experiments on multi-step data analysis benchmarks show that SGKR consistently improves solution correctness over no-retrieval and similarity-based retrieval baselines for both vanilla LLMs and coding agents.