Flat vector retrieval kept returning a rule from the wrong service, so the fix was an ontology on the artifacts instead of the content
AspireAI community · arXiv
A seven-agent pipeline reverse-engineered 241 repositories across 18 services into thousands of artifacts describing scope, journeys, rules and acceptance criteria, and the hard part turned out to be retrieval, not recovery. Entities like offer, eligibility and activation recur across services under one shared vocabulary but are operationally distinct, so a single end-to-end journey implicates over a thousand near-identical rules that must not be conflated, and flat vector retrieval returned the right-looking rule from the wrong service at high similarity with no signal of error. The fix moves the ontology to the artifact level: every artifact keeps its producer, component, service, domain and type, and queries resolve to artifact identifiers that constrain vector search so the competing rule is absent rather than merely outranked. The layer was built in under a week, admits new services by convention, and the authors report it supported root-cause analysis and resolution of 100+ production defects with developer verification and attributed 35 release regression failures to specific rules and services.
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.