aspireai.
PUBLIC EDITION

Isolating each reasoning step's context made chain-of-thought more causally faithful, by up to 21 percentage points

AspireAI community · Università della Svizzera italiana, ETH Zurich and University of Oxford (arXiv)
A model's step-by-step reasoning reads like an explanation, but with dense attention each step can attend to the whole prompt, so the model can look up the answer and then narrate a plausible route to it - a rationale that is post-hoc rather than causal. CausalCoT removes that escape hatch by decomposing the problem into a directed acyclic graph of atomic sub-questions and evaluating each node in an isolated context containing only its direct causal parents. Across a suite of reasoning benchmarks the method kept competitive predictive accuracy while raising the causal sensitivity of intermediate reasoning steps by an average of 12 percentage points and up to 21 points over the strongest baseline, and the dependency graph lets a correction at one node propagate predictably downstream. The limitation is that this is an inference-time framework with extra bookkeeping per sub-question, and the faithfulness gains are measured against reasoning benchmarks rather than long-running agent tasks.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.