Splitting documentation into pages, chunks and commands linked by stable IDs lifted agent retrieval from 0.449 to 0.619 nDCG@5
AspireAI community · Redis
Coding agents retrieve from documentation, and Redis's engineering team found a structural reason they often get the wrong chunk: the docs were laid out for human readers, not for agents. The fix was to split Redis documentation into pages, chunks and commands linked by stable IDs, so an agent can navigate to the right place rather than relying on one flat similarity search. The measured effect was agent retrieval nDCG@5 rising from 0.449 to 0.619, and the post states the latency cost of the approach alongside the gain. The practical lesson generalises past Redis - if your docs are one long corpus, agents will retrieve poorly no matter how good your embedding model is, and structuring for navigation is a different lever than improving similarity. The limitation is that this is a vendor's own measurement on its own documentation, with no independent replication.
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.