Andrew Lee

Andrew Lee

@ajyl.bsky.social

Post-doc @ Harvard. PhD UMich. Spent time at FAIR and MSR. ML/NLP/Interpretability

750 followers599 following45 posts

If you liked Anthropic's recent emotions paper, check out our work! We find many similarities: 1) Circular geometry of emotion representations 2) Steering: unlike Anthropic, we steer along circular manifold (at 0°, 30°, 60°...) 3) Steering emotions can affect refusal/sycophancy See Lihao's thread!👇

Lihao Sun@1e0sun.bsky.social

💡New paper! Woke up to Anthropic's emotion paper and realized “wait, that's our finding too.” We concurrently uncovered a circular valence & arousal (VA) geometry of emotions, steering refusal & sycophancy. We further provide a mechanistic account: tokens occupy distinct regions in this space. 1/

We are thrilled to host the next Mech Interp Workshop @ ICML 2026! 🎉 July 2026, Seoul 🇰🇷 The workshop aims to understand the inner workings of neural nets. Topics: Feature geometry Circuit analyses Interp for {practical applications, safety, scientific discovery}, and many more.

CFP: mechinterpworkshop.com Contact: mechinterpworkshop@gmail.com Deadline: May 8 (FYI: we are accepting Neurips format submissions 😉) Looking forward to see everyone’s work! –@@neelnanda.bsky.social, Andy Arditi, Stefan Heimersheim, Anna Soligo, @jrosseruk.bsky.social, Iván Arcuschin

mechinterpworkshop.comMechanistic Interpretability Workshop at ICML 2026The Mechanistic Interpretability Workshop at ICML 2026. How can we use the internals of neural networks to understand a model better?

Question @neuripsconf.bsky.social - a coauthor had his reviews re-assigned many weeks ago. The ACs of those papers told him "i've been told to tell u: leave a short note. You won't be penalized". Now I'm being warned of desk-reject due to his short/poor reviews. What's the right protocol here?

Andrew Lee reposted

How do language models track mental states of each character in a story, often referred to as Theory of Mind? We reverse-engineered how LLaMA-3-70B-Instruct handles a belief-tracking task and found something surprising: it uses mechanisms strikingly similar to pointer variables in C programming!

Andrew Lee reposted

🚨New #ACL2025 paper! Today’s “safe” language models can look unbiased—but alignment can actually make them more biased implicitly by reducing their sensitivity to race-related associations. 🧵Find out more below!

🚨New preprint! How do reasoning models verify their own CoT? We reverse-engineer LMs and find critical components and subspaces needed for self-verification! 1/n

View full thread

Our interpretation: ✅we find subspace critical for self-verif. ✅in our setup, prev-token heads take resid-stream into this subspace. In a different task, a diff. mechanism may be used. ✅ this subspace activates verif-related MLP weights, promoting tokens like “success” 8/n

🚨New preprint! How do reasoning models verify their own CoT? We reverse-engineer LMs and find critical components and subspaces needed for self-verification! 1/n

View full thread

Our analyses meet in the middle: We use “interlayer communication channels” to rank how much each head (OV circuit) aligns with the “receptive fields” of verification-related MLP weights. Disable *three* heads → disables self-verif. and deactivates verif.-MLP weights. 6/n

We find similar verif. subspaces in our base model and general reasoning model (DeepSeek R1-14B). Here we provide CountDown as a ICL task. Interestingly, in R1-14B, our interventions lead to partial success - the LM fails self-verification but then self-corrects itself. 7/n

🚨New preprint! How do reasoning models verify their own CoT? We reverse-engineer LMs and find critical components and subspaces needed for self-verification! 1/n

View full thread

More importantly, we can use the probe to find MLP weights related to verification. Simply check for MLP weights with high cosine similarity to our probe. Interestingly, we often see Eng. tokens for "valid direction" and Chinese tokens for "invalid direction". 4/n

Bottom-up, we find previous-token heads (i.e., parts of induction heads) are responsible for self-verification in our setup. Disabling previous-token heads disables self-verification. 5/n

🚨New preprint! How do reasoning models verify their own CoT? We reverse-engineer LMs and find critical components and subspaces needed for self-verification! 1/n

CoT is unfaithful. Can we monitor inner computations in latent space instead? Case study: Let’s study self-verification! Setup: We train Qwen-3B on CountDown until mode collapse, resulting in nicely structured CoT that’s easy to parse+analyze 2/n

We do a “top-down” and “bottom-up” analysis. Top-down, we train a probe. We can use our probe to steer the model and trick it to have found a solution. 3/n

🚨New Preprint! Did you know that steering vectors from one LM can be transferred and re-used in another LM? We argue this is because token embeddings across LMs share many “global” and “local” geometric similarities!

View full thread

🚨New Preprint! Did you know that steering vectors from one LM can be transferred and re-used in another LM? We argue this is because token embeddings across LMs share many “global” and “local” geometric similarities!

View full thread

Local2: We measure intrinsic dimension (ID) of token embeddings. Interestingly, ID reveals that tokens with low ID form very coherent semantic clusters, while tokens with higher ID do not!

Now, steering vectors can be transferred across LMs. Given LM1, LM2 & their embeddings E1, E2, fit a linear transform T from E1 to E2. Given steering vector V for LM1, apply T onto V, and now TV can steer LM2. Unembedding V or TV shows similar nearest neighbors encoding the steer vector’s concept:

🚨New Preprint! Did you know that steering vectors from one LM can be transferred and re-used in another LM? We argue this is because token embeddings across LMs share many “global” and “local” geometric similarities!

We characterize “global” and “local” geometry in simple terms. Global: how similar are the distance matrices of embeddings across LMs? We can check with Pearson correlation between distance matrices: high correlation indicates similar relative orientations of token embeddings, which is what we find

Local: we characterize two ways: first using Locally Linear Embeddings (LLE), in which we express each token embedding as the weighted sum of its k-nearest neighbors. It turns out, the LLE weights for most tokens look very similar across language models, indicating similar local geometry:

View full thread
View full thread

Contributions can include: experiments for an on-going project; new resources (model/SAE checkpoints) datasets, or even software (general infra, tools for data collection/annotation, etc.). Of course feel free to launch your own projects! See on-going projects: github.com/ARBORproject... 3/N

github.comARBORproject arborproject.github.io · DiscussionsExplore the GitHub Discussions forum for ARBORproject arborproject.github.io. Discuss code, ask questions & collaborate with the developer community.

New paper <3 Interested in inference-time scaling? In-context Learning? Mech Interp? LMs can solve novel in-context tasks, with sufficient examples (longer contexts). Why? Bc they dynamically form *in-context representations*! 1/N

View full thread

New paper <3 Interested in inference-time scaling? In-context Learning? Mech Interp? LMs can solve novel in-context tasks, with sufficient examples (longer contexts). Why? Bc they dynamically form *in-context representations*! 1/N

View full thread

In-context representations form across models and various graphs. We can intervene on the principal components to alter the model’s belief-state of the graph, and change the model’s in-context task predictions accordingly (ie, causality). 6/N

Why does this happen? We hypothesize LMs internally perform a graph spectral energy minimization process: Thus we quantify + measure energy of model activations: when energy is reduced, in-context task accuracy *jumps* to near 100%. Phase-transition of in-context reps? 7/N

New paper <3 Interested in inference-time scaling? In-context Learning? Mech Interp? LMs can solve novel in-context tasks, with sufficient examples (longer contexts). Why? Bc they dynamically form *in-context representations*! 1/N

View full thread

Instead of random words, we also try words w/ a semantic prior (ex: days of week). We make an in-context task with a new ordering of days (Mon,Thurs,Sun,Wed…): The orig. semantic prior shows up in first principal components & in-context reps in latter ones! The two co-exist. 5/N

New paper <3 Interested in inference-time scaling? In-context Learning? Mech Interp? LMs can solve novel in-context tasks, with sufficient examples (longer contexts). Why? Bc they dynamically form *in-context representations*! 1/N

What are in-context representations? We build a graph with random words as nodes, randomly walk the graph, and input the resulting seq to LMs. With a long enough context, LMs start adhering to the graph When this happens, PCA of LM activations reveals the graph (task) structure 3/N

You are up to date.