Skip to content

PRISM Edit: One Vector for All Temporal Answers

Jul 2026 · arXiv.org · Vol abs/2607.11327 · 1 citation · 30 references
Computer Science

TL;DR

This work introduces PRISM Edit, which optimizes a single polysemous representation across temporal contexts and leverages the model's inherent modulation pathway to route it to temporally correct predictions without requiring any architectural modification.

Abstract

Model editing keeps large language models (LLMs) up to date without retraining, but temporal facts expose a limitation of the prevailing locate-and-edit paradigm: an update is not always a replacement. When a fact changes, the new answer should become current while the old answer may remain correct in historical time contexts. Building on this insight, we use causal tracing to show that LLMs already support this distinction via a two-stage internal computation: early MLP layers retrieve a time-agnostic subject representation, and later layers modulate it with temporal context to yield the time-correct answer. Motivated by this finding, we introduce PRISM Edit, which optimizes a single polysemous representation across temporal contexts and leverages the model's inherent modulation pathway to route it to temporally correct predictions without requiring any architectural modification. We evaluate on TimeConflict, a newly introduced temporal editing benchmark, and on temporally augmented CounterFact. PRISM Edit improves multiple core metrics over the best baseline, most notably +23.3 Temporal Consistency (TC) and +33.7 Current Relative-time Score (CRS) on LLaMA-3, while being more than 2x faster. Code and data are publicly available at https://github.com/CheerCHuang/PRISM-Edit.

View source

Similar papers

Book Open access Jul 2026

Tokens to Types: Context Editing with Selective Entity Abstraction for Grounded Generation

This framework proposes a context-editing framework that performs selective abstraction over entities that appear in both the context and the question, establishing symbolic abstraction as a highly cost-efficient solution for ensuring context fidelity in LLMs.

Rounak Sharma, Debabrata Mahapatra, S. Saini · 0 citations
#artificial intelligence Preprint Aug 2026

rEDMRec: Distilling Large Language Model Reasoning into an Editable Experience Memory for Recommendation

Large language models can improve recommendation quality by reasoning explicitly over user history and candidate items - for example, extracting a user's preferences or explaining why one item fits better than another - rather than mapping history directly to a ranked list. This reasoning, however, is expensive to repe...

M. H. Nguyen, Tung Le, Huy-Tien Nguyen · 0 citations
Preprint Aug 2026

Hybrid-Policy Self-Editing for Composable Unstructured Knowledge Editing

HPSE is proposed, which builds a hybrid rollout that steps in to place missing facts onto the student's own trajectory precisely where its coverage fails, while staying on-policy elsewhere.

Tian-Ci Liu, Zi-Han Dong, Tian-Chun Li et al. · 0 citations
#machine learning Preprint Aug 2026

Synthetic Worlds for Temporal Evaluation and Knowledge Updating in LLMs

This work proposes a synthetic, simulation-driven framework for studying knowledge insertion in LLMs, and introduces {\sc ParallelEvents}, a benchmark of fictional yet realistic future worlds that generates coherent event trajectories for controlled evaluation, avoiding contamination while preserving consistency.

Jonathan Zheng, Zi-Rui Shao, Alan Ritter et al. · 0 citations
Preprint Aug 2026

On Scope Classification and Current Knowledge-Editing Benchmarks: A Negative Result, with INLAY as a Gradient-Free Case Study

Every memory-based knowledge editor in the SERAC lineage depends on a scope decision: given a query, does a stored edit apply? We report that current knowledge-editing benchmarks cannot measure this decision at all. Using INLAY, a gradient-free editor we built to obtain exact per-query ground truth (the model is frozen...

Aditya Singh · 0 citations
Preprint Aug 2026

SodaMem: Evidence-Grounded Temporal Graph Memory for LLM Agents

SodaMem is presented, an evidence-grounded temporal graph memory that extracts typed FactEvents with mandatory provenance spans, persists mention time, occurrence time, and validity with SUPERSEDES/CONTRADICTS/UPDATES edges under hybrid lexical-dense indexing and answers via a planner-reader loop that gathers citable e...

Fengrong Wan, Chengcan Wu, Ning Lyu · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.