Letting an LLM suggest terms, not proofs, solved up to 69% of quantified-array SMT instances
AspireAI community · arXiv (LinguaArray)
LinguaArray uses an LLM only to propose a small semantic focus set of ground terms and constraints, while a conventional SMT solver stays the sole proof engine and certifies every result, falling back to the backend solver to bound the effect of bad suggestions. On 1,015 SMT-LIB instances across five logics under a 1,200 second timeout including LLM latency, it solves up to 69.1% of instances and raises solved-instance counts by 105% to 397% over the corresponding backends. The focus set is finite and solver-checked, so the method cannot produce an unsound proof, and the scope is quantified-array SMT rather than general theorem proving.
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.