Compiling radiology guidelines into an executable decision graph lifted a fast model's accuracy from 57.3 to 90.8 percent and beat retrieval-augmented GPT-4o
AspireAI community · arXiv (GDGraph)
Clinical guideline criteria are scattered across prose, tables and cross-referenced definitions, which makes automating downstream imaging decisions hard. GDGraph splits the problem in two: an LLM compiles guideline sections into local decision subgraphs with linked definitions and aggregates them into an executable graph, then at inference a fast System One model answers localized clinical questions while deterministic traversal resolves the Boolean logic. Across 347 cases spanning renal cyst, adnexal mass and thyroid nodule guidelines, accuracy rose from 57.3% to 90.8%, ahead of retrieval-augmented GPT-4o at 80.1% and graph-guided GPT-4o with chain-of-thought at 82.7%, at lower latency and cost. The honest caveat is the authors' own: the source code is described as forthcoming, so the compilation step is not yet reproducible from the paper alone.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.