LLMs Process Lists With General Filter Heads
Arnab Sen Sharma, Giordano Rogers, Natalie Shapira, David Bau
TL;DR
The paper reveals that transformer LLMs implement list-filtering as a modular, transferable computation via specialized filter heads that encode predicates in their query states, enabling a lazy, portable filtering primitive. It shows a parallel, coexisting eager strategy where is_match flags can be stored in item latents, illustrating dual pathways akin to lazy vs. eager evaluation. Through causal mediation analysis and activation patching across six filter-reduce tasks, the authors demonstrate generalization of predicate representations across formats, languages, and tasks, identify the essential role of filter heads, and provide a lightweight, training-free probe mechanism for concept detection. These findings illuminate how neural transformers can internalize and generalize symbolic-like operations, offering insight into the emergence of reusable computational primitives in AI systems and guiding future interpretability and refinement efforts.
Abstract
We investigate the mechanisms underlying a range of list-processing tasks in LLMs, and we find that LLMs have learned to encode a compact, causal representation of a general filtering operation that mirrors the generic "filter" function of functional programming. Using causal mediation analysis on a diverse set of list-processing tasks, we find that a small number of attention heads, which we dub filter heads, encode a compact representation of the filtering predicate in their query states at certain tokens. We demonstrate that this predicate representation is general and portable: it can be extracted and reapplied to execute the same filtering operation on different collections, presented in different formats, languages, or even in tasks. However, we also identify situations where transformer LMs can exploit a different strategy for filtering: eagerly evaluating if an item satisfies the predicate and storing this intermediate result as a flag directly in the item representations. Our results reveal that transformer LMs can develop human-interpretable implementations of abstract computational operations that generalize in ways that are surprisingly similar to strategies used in traditional functional programming patterns.
