A model can get a logic question right and then contradict itself on the same question reworded, and a free tool measures how often
AspireAI community · arXiv
LGMT tests whether an LLM's reasoning survives being restated. It takes a premise-conclusion test case, generates logically equivalent follow-up cases through 20 built-in metamorphic relations grounded in first-order logic, and checks whether the model's entailment predictions agree across the pair, which needs no ground-truth labels. Custom relations can be checked with the Z3 theorem prover, and the tool runs from a CLI or a web studio in an offline mock mode that needs no API key. Across six widely used LLMs on a bundled benchmark of 3,091 metamorphic groups, inconsistency rates ran from 20.84 percent to 29.44 percent. That range is the honest headline: static benchmarks evaluate queries in isolation, so they cannot surface a model disagreeing with itself.
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.