A pharma team moved compliance rules out of the prompt and into a structured claims data model, and cut weekly API cost 29.5%
AspireAI community · arXiv
Composer, a deployed internal tool at a pharmaceutical company, generates promotional and medical claims against a Golden Data Model of 1,867 claims spanning four products, combining claim metadata, references, audience labels, material type, usage history, match-text-variant links and a six-dimension quality score. Moving that compliance and personalization signal out of prompt-level rules and into retrieval-time structured context improved the intended indication by 29%, the intended content type by 62% and the intended target audience by 67%, raised the 6C quality score by 86% and claim reuse by 34% across six product-audience segments, while production log analysis showed a 29.5% reduction in weekly API cost. The authors frame this as descriptive deployment evidence rather than a controlled result, and the tool and the underlying claim data are internal, so readers cannot reproduce the numbers.
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.