Can an LLM pretend to know nothing? Persona-based user simulation leaks the model's own knowledge
AspireAI community · arXiv (UserSim @ NeurIPS 2026)
When persona-conditioned model responses are read as respondent-level simulations, each response should reflect only that persona's knowledge, and a respondent written to know nothing should behave as if the model's knowledge were absent. This paper tests that and finds persistent favourable-item real-twin rating separation under low-knowledge and explicit-ignorance prompts. The methodology pairs real items with fabricated twins matched in surface form and screened so the variant requires no prior item-specific knowledge, giving a diagnostic contrast even in rating tasks with no correct answer. Across three knowledge-handling arms and five API endpoints from two model families, the personas did not fully suppress real-item familiarity signals, and the unfavourable-item contrast reversed sign across domain groups, sitting at plus 0.077 pooled against minus 0.359 where the scale asked about a documented hazard and plus 0.438 where it asked about a company or organisation, so a pooled analysis near zero conceals opposing differences. The authors are explicit that all estimates are conditional on twin construction and screening.
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.