Keeping an alias memory for investor calls improved record matching by 7.8 to 12.1 points
AspireAI community · arXiv (2610.40482)
Financial workflows that reuse investor knowledge need persistent memory that merges observations across sources and periods without losing identity or provenance. FIRME is a registry-anchored memory graph that reconciles incoming observations onto persistent canonical relationships while retaining their source, time and context; within a period, rule-based fusion links investor-call discussion to portfolio cash-flow signals, and across periods canonical identities and persistent aliases route recurring observations to the same relationship history. Against a historical registry that keeps canonical identities but has no alias memory, FIRME increases final-period Correct Match Rate by 7.8 to 12.1 percentage points across four dataset-backend settings. A blinded human audit of 200 incoming observations per setting found gains of 9.0 to 16.5 points in match rate and 22.5 to 29.0 points in reattachment recall. The limit: it is evaluated on proprietary investor-call and cash-flow records plus S&P 500 earnings-call transcripts, so the numbers come with a domain-specific judge.
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.