Pith. sign in

REVIEW 6 cited by

Everything is Editable: Extend Knowledge Editing to Unstructured Data in Large 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

arxiv 2405.15349 v3 pith:N2YTIM6O submitted 2024-05-24 cs.CL

Everything is Editable: Extend Knowledge Editing to Unstructured Data in Large Language Models

classification cs.CL
keywords knowledgeeditinglayerunstructureddimensionkey-valueoptimizationstorage
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Recent knowledge editing methods have primarily focused on modifying structured knowledge in large language models. However, this task setting overlooks the fact that a significant portion of real-world knowledge is stored in an unstructured format, characterized by long-form content, noise, and a complex yet comprehensive nature. Techniques like "local layer key-value storage" and "term-driven optimization", as used in previous methods like MEMIT, are not effective for handling unstructured knowledge. To address these challenges, we propose a novel Unstructured Knowledge Editing method, namely UnKE, which extends previous assumptions in the layer dimension and token dimension. Firstly, in the layer dimension, we propose non-local block key-value storage to replace local layer key-value storage, increasing the representation ability of key-value pairs and incorporating attention layer knowledge. Secondly, in the token dimension, we replace "term-driven optimization" with "cause-driven optimization", which edits the last token directly while preserving context, avoiding the need to locate terms and preventing the loss of context information. Results on newly proposed unstructured knowledge editing dataset (UnKEBench) and traditional structured datasets demonstrate that UnKE achieves remarkable performance, surpassing strong baselines. In addition, UnKE has robust batch editing and sequential editing capabilities.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. TimeROME-DLM: Temporal Causal Tracing and Low-Rank Inference-Time Knowledge Editing for Masked Diffusion Language Models

    cs.LG 2026-06 unverdicted novelty 7.0

    TimeROME-DLM enables training-free knowledge editing in masked diffusion language models via temporal causal tracing and low-rank residual edit memory applied at inference time.

  2. Beyond Binary Edits Robust Multimodal Knowledge Editing with Adversarial Subspace Alignment

    cs.AI 2026-05 unverdicted novelty 7.0

    Introduces Latent Adversarial Robustification and Rank-Constrained Subspace Learning to enable robust generalization in multimodal knowledge editing through adversarial subspace alignment.

  3. ForgetBench: Benchmarking Forgetting Dynamics of Long-Term Parametric Memory in Language Models

    cs.CL 2026-07 conditional novelty 6.0

    ForgetBench is a sequential-editing benchmark showing that existing knowledge-editing methods trade long-term retention against generalization, while structured contexts mask parametric forgetting.

  4. Scalable Knowledge Editing for Mixture-of-Experts LLMs via Tensor-Structured Updates

    cs.LG 2026-05 unverdicted novelty 6.0

    A MEMIT-style knowledge editing framework for MoE LLMs that formulates per-expert updates via tensor structure and applies Woodbury identity for low-rank inversions, achieving up to 6x speedup with comparable editing quality.

  5. HoReN: Normalized Hopfield Retrieval for Large-Scale Sequential Model Editing

    cs.LG 2026-05 unverdicted novelty 6.0

    HoReN achieves stable sequential editing of 50K facts in LLMs by combining a normalized Hopfield codebook with angular retrieval and attractor dynamics.

  6. HoReN: Normalized Hopfield Retrieval for Large-Scale Sequential Model Editing

    cs.LG 2026-05 unverdicted novelty 5.0

    HoReN is a parameter-preserving editor that wraps an MLP with a Hopfield codebook memory and scales to 50K sequential edits on ZsRE while maintaining performance above 0.93.