The paper investigates whether knowledge editing truly erases original facts from language models. Using a linear trace probe, the authors find that after editing a fact in GPT‑2‑XL, the original object remains highly decodable from hidden states across three different editing methods, even when the model behaves correctly on edited prompts. This suggests that editing suppresses rather than removes the original association in representational space.
By Priyansh Srivastava, Romit Chatterjee
arXiv:2511. 05852v4 Announce Type: replace-cross Abstract: Knowledge editing (KE) offers a lightweight alternative to retraining for updating large language models (LLMs).
By Yinjie Cheng, Paul Youssef, Christin Seifert, J\"org Schl\"otterer, Zhixue Zhao
The paper introduces EditVeto, a post‑rewrite veto gate that selectively keeps or reverts blocks of edits made by large language models (LLMs) when correcting noisy OCR transcripts of historical documents. The gate, trained on rewrites from two Qwen3 models, consistently improves correction metrics across five tested rewriters—including unseen ones—by reducing character‑level error rates and boosting user preference scores. In competitive evaluations, EditVeto lowers error rates for most teams and, when combined with fine‑tuning and pooling, achieves performance close to the best published runs, all while relying solely on public models and data.
By Jorge Ram\'on Fonseca Cacho
The paper investigates how memory systems can answer a current query correctly yet fail to retain distinctions needed for later updates. Using a paired‑history audit, the authors evaluate 24 history pairs across six synthetic mechanisms and two model backends, achieving perfect reveal accuracy on DeepSeek and high accuracy on GLM. Record‑level audits reveal specific failures in structured reveal memories and frontier late‑reference adequacy, and the authors test a label‑equivariant repair that only partially restores correctness.
By Guangzhe Zhang
The paper reports on a series of experiments examining how different forms of directives—such as record pointers, criteria, or combinations—affect an agent’s choice of archived source records when it inherits six one-line memories. Across twelve registered studies involving 14,760 attempts on a single instrument lineage, the authors measured the impact of various directive formats on six direct-provider models, nine OpenRouter-served models, and several Claude and Opus 5 models, noting differences in performance metrics and replication outcomes. The results are purely descriptive, detailing the effects of exact edits on fixed panels with registered intervals and no claim of underlying mechanisms.
By Kazuki Nakayashiki
The paper investigates whether targeted edits to a few internal components of Gemma 4 instruction‑tuned models can reduce persistent repetition loops that occur during long factual enumeration prompts. By combining per‑layer ablation with per‑neuron attribution, the authors identify specific neurons whose weight edits dramatically lower loop frequency—one sign‑inverted neuron suffices for Gemma 4 E2B. Across all four Gemma variants, loop occurrences drop from 46/384 to 12/384 on held‑out prompts, while general‑purpose benchmarks show no significant regressions. The study also demonstrates that similar sparse edits can mitigate repetition in other families such as Qwen3.5 and LFM2.5, though the effect varies.
By Aristotelis Lazaridis, Aman Sharma, Dylan Bates, Brian King, Vincent Lu, Jack FitzGerald
arXiv:2607. 19453v1 Announce Type: cross Abstract: We audit whether candle-based machine-learning models can turn predictions of cryptocurrency extrema or short-horizon outcomes into positive Binance Spot paper policies after assumed costs.
By Ayoub Jadouli
The paper evaluates Laya, a small model that processes a multiple‑choice question, its options, and a text in a single 512‑token sequence. Experiments show that when the relevant evidence lies beyond the window, accuracy drops to about 26–27%, and confidence metrics fail to warn of truncation. Fine‑tuning on longer documents improves performance on visible evidence but not on cut evidence, and a larger window or a 312‑token scan can yield modest gains.
By Mohammed Nayeem Khan, Allan Kevin T
The paper investigates when it is better to return an existing draft answer or revise it using retrieved evidence in retrieval‑augmented QA systems. By grading both the draft and its candidate revision with the same correctness judge, the authors define a paired effect called recoverability and train policies to predict it before revision. Experiments on 25,870 open‑domain questions show that a recoverability‑based scorer outperforms a draft‑correctness scorer across multiple Llama setups, improving accuracy–revision trade‑offs and closing a significant portion of the oracle gap, though it still applies harmful revisions in a substantial fraction of cases.
By Nicholas Kashani Motlagh, Tim Anderson, Jeremy Gwinnup, Grant Erdmann
arXiv:2610.33029v1 Announce Type: cross
Abstract: Self-improving agents write lessons from the outcomes of their runs; when outcomes are noisy, a lesson can carry chance into later decisions. We meas...
By Kazuki Nakayashiki
arXiv:2608. 10216v1 Announce Type: cross Abstract: Agent frameworks ship quality gates that compare text blocks by embedding-cosine similarity and decide at a fixed cutoff.
By Scott E. Frias
arXiv:2606. 09877v1 Announce Type: new Abstract: LLM wiki systems compile knowledge into pre-filled KV caches for efficient inference, but assume a static corpus -- an assumption that fails whenever the underlying information landscape evolves.
By Juan M. Huerta