Papers › Identifying Linear Relational Concepts in Large Language Models

Identifying Linear Relational Concepts in Large Language Models

15 Nov 2023arXiv:2311.08968archive 2025-07-28

David Chanin, Anthony Hunter, Oana-Maria Camburu

Transformer language models (LMs) have been shown to represent concepts as directions in the latent space of hidden activations. However, for any human-interpretable concept, how can we find its direction in the latent space? We present a technique called linear relational concepts (LRC) for finding concept directions corresponding to human-interpretable concepts by first modeling the relation between subject and object as a linear relational embedding (LRE). We find that inverting the LRE and using earlier object layers results in a powerful technique for finding concept directions that outperforms standard black-box probing classifiers. We evaluate LRCs on their performance as concept classifiers as well as their ability to causally change model output.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2311.08968")

Code

Syntology Ran 3 of 8 code samples harvested from 2 repositories linked to this paper; 5 have no recorded run. Of those that ran: 3 ran with no contract checked.

By repository: official repository: 4 samples from 1 repository, 3 ran; community (archive-listed): 4 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

chanind/linear-relational-concepts officialmentioned in papermentioned on GitHubpytorchMIT report
chanind/linear-relational mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested; 3 ran; 0 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

3ran
5unverified

Licence: 0 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

chain_modifiers chanind/linear-relational-concepts/linear_relational_concepts/PromptGenerator.py official repository ran MIT (permissive) · bb5cfab078201dc0 · report
first_token_estimator chanind/linear-relational-concepts/linear_relational_concepts/MultitokenEstimator.py official repository ran MIT (permissive) · 0cc534ba632ea333 · report
weighted_mean_estimator chanind/linear-relational-concepts/linear_relational_concepts/MultitokenEstimator.py official repository ran MIT (permissive) · 481fa6a8c4bfa067 · report
mean_estimator chanind/linear-relational-concepts/linear_relational_concepts/MultitokenEstimator.py official repository unverified MIT (permissive) · 848b29453a3340a4 · report
cache_key chanind/linear-relational/linear_relational/PromptValidator.py community (archive-listed) unverified MIT (permissive) · 866dc1684b92eaf5 · report
collect_matching_layers chanind/linear-relational/linear_relational/lib/layer_matching.py community (archive-listed) unverified MIT (permissive) · b43c1516c16b8870 · report
fix_neg_layer_num chanind/linear-relational/linear_relational/lib/layer_matching.py community (archive-listed) unverified MIT (permissive) · 4430146df8492ce2 · report
get_layer_name chanind/linear-relational/linear_relational/lib/layer_matching.py community (archive-listed) unverified MIT (permissive) · 88c0a12555c2f232 · report

Tasks

Object

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections