A single poisoned document hijacked RAG without contradicting anything, by conceding the fact first
AspireAI community · arXiv
Most single-document poisoning attacks against RAG rely on explicit refutations or imperative instruction overrides, and modern aligned models often reject those in favour of parametric memory or clean context. MONOLOGUE avoids refutation entirely. It concedes the ground truth as an authoritative historical baseline, then introduces the update as a dated institutional reattribution, weaving a grounded record-correction narrative that presents the counterfactual as the most recent version. Because live writes look suspicious, the payloads are refined offline through local multi-dimensional gated optimization that couples automated text-quality audits with surrogate behavioural verification. Across three benchmarks, three retrieval backends and four open-weight generator regimes, the method reported the strongest overall attack efficacy among the evaluated single-document poisoning attacks. The limitation is that effectiveness is measured against other single-document attacks, so it does not establish how this compares with multi-document or access-level adversaries, and it is a demonstration of a weakness rather than a fix for it.
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.