REVIEW 10 cited by
Inspecting and Editing Knowledge Representations in Language Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Neural language models (LMs) represent facts about the world described by text. Sometimes these facts derive from training data (in most LMs, a representation of the word "banana" encodes the fact that bananas are fruits). Sometimes facts derive from input text itself (a representation of the sentence "I poured out the bottle" encodes the fact that the bottle became empty). We describe REMEDI, a method for learning to map statements in natural language to fact encodings in an LM's internal representation system. REMEDI encodings can be used as knowledge editors: when added to LM hidden representations, they modify downstream generation to be consistent with new facts. REMEDI encodings may also be used as probes: when compared to LM representations, they reveal which properties LMs already attribute to mentioned entities, in some cases making it possible to predict when LMs will generate outputs that conflict with background knowledge or input text. REMEDI thus links work on probing, prompting, and LM editing, and offers steps toward general tools for fine-grained inspection and control of knowledge in LMs.
Forward citations
Cited by 10 Pith papers
-
Inside the Unfair Judge: A Mechanistic Interpretability Account of LLM-as-Judge Bias
LLM-as-judge scoring biases concentrate in low-dimensional, type-specific activation subspaces that support bidirectional causal steering and cross-domain failure prediction.
-
Mind the Quote: Enabling Quotation-Aware Dialogue in LLMs via Plug-and-Play Modules
QuAda, a trainable attention adapter using under 2.8% extra parameters, gives instruction-tuned LLMs strong performance on five quotation-aware dialogue tasks.
-
Targeted Recovery of Weight-Space Mechanisms From Neural Networks
A targeted decomposition method recovers the weight-space mechanisms behind specific inputs at low FLOPs, enabling focused ablation and rewiring of a 12-block transformer.
-
Emergent Response Planning in LLMs
Hidden representations of LLM prompts encode global attributes of the upcoming response, and simple probes can predict length, content choices, and answer confidence before generation begins.
-
Probe-Free Low-Rank Activation Intervention
FLORAIN is a probe-free, single-layer activation intervention that improves LLM truthfulness by projecting hidden states toward an ellipsoidal region of desirable answers.
-
REFLEX: Self-Refining Explainable Fact-Checking via Verdict-Anchored Style Control
REFLEX improves explainable fact-checking by using verdict-anchored style control and self-disagreement signals to disentangle fact from style in LLM outputs, achieving SOTA results with minimal self-refined samples.
-
Balancing Stylization and Truth via Disentangled Representation Steering
StyliTruth separates style and truth directions in the activations of selected attention heads, then steers each token along the disentangled subspaces to preserve truthfulness during stylization.
-
Activation Reward Models for Few-Shot Model Alignment
Mean attention-head activations from a few labeled examples, injected into selected heads, turn a frozen vision-language model into a few-shot reward model that beats prompting and scoring baselines and a new reward-h...
-
Ask Good Questions for Large Language Models
The AGQ framework combines a concept-enhanced item response theory model with LLMs to generate guiding questions that adapt to a user's estimated knowledge gaps.
-
Task-driven Layerwise Additive Activation Intervention
A lasso and group-lasso regularized additive intervention on last-token activations steers LLMs with 10 demonstrations and supports task-vector composition.
Discussion (0). Continue with ORCID to comment.