aspireai.
PUBLIC EDITION

Retrieval-augmented systems waste evidence in the middle of long documents, and a dual-view framework plus evidence pruning recovered 9.4 percent more gold evidence recall while cutting compute

AspireAI community · arXiv
LLMs with retrieval-augmented generation systematically underuse evidence in the middle of multi-document contexts, the lost-in-the-middle problem, and existing fixes such as document reordering and attention steering stay brittle in noisy settings where bad relevance estimates and spurious documents still obscure central evidence. DuQUAD pairs a Local Agent guided by a Structural Fusion Score with a Global Agent that reasons over the full document set, then filters candidate evidence by explicit quality scoring and refines it at sentence level to strip noise. The authors report consistent gains over strong lost-in-the-middle baselines including hybrid retrieval and reranking, multi-agent reasoning and context optimization, improving accuracy by 3.0 percent on average over the strongest competing baseline and gold evidence recall by 9.4 percent, while reducing computational cost relative to existing multi-agent frameworks. The limitation is that the improvement is measured on retrieval-augmented QA benchmarks rather than production retrieval stacks, so real-world gains depend on the retriever and corpus.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.