A Unified Framework for Model Editing (2024.findings-emnlp)

Copied to clipboard

Challenge: EMMET is a new batched memory-editing algorithm for Transformers that can perform batched edits up to a batch-size of 10,000.
Approach: They propose to unify ROME and MEMIT under a single umbrella to optimize for the preservation-memorization objective.
Outcome: The proposed algorithms perform identically across multiple dimensions and are comparable in their optimization objective, performance and limitations.

Similar Papers

Model Editing at Scale leads to Gradual and Catastrophic Forgetting (2024.findings-acl)

Copied to clipboard

Challenge: Existing model editing methods are evaluated using metrics for reliability, specificity and generalization over one or few edits.
Approach: They evaluate model editing methods for three crucial properties - editing proficiency, fact forgetting and downstream performance.
Outcome: The proposed methods are based on two state-of-the-art models - ROME and MEMIT.
MEMIT-Merge: Addressing MEMIT’s Key-Value Conflicts in Same-Subject Batch Editing for LLMs (2025.findings-acl)

Copied to clipboard

Challenge: Existing knowledge editing techniques that modify models’ internal knowledge without full model retraining have gained significant attention.
Approach: They propose an enhanced approach that merges value computation processes for facts sharing the same subject to improve editing efficiency.
Outcome: The proposed method maintains a 98% editing success rate on same-subject and distinct-sub subject datasets while the original success rate drops to 46%.
One Mask to Rule Them All: On Hidden Facts after Editing and How to Find Them (2026.findings-acl)

Copied to clipboard

Challenge: Knowledge editing methods such as ROME and MEMIT update factual associations by modifying MLP weights.
Approach: They propose to use a mask to reverse edits by eliminating overattention in later layers . they also show that injecting the mask during editing drops editing success from 98% to 38% .
Outcome: The proposed method reverses edits by eliminating overattention in later layers and drops editing success from 98% to 38%.
Rebuilding ROME : Resolving Model Collapse during Sequential Model Editing (2024.emnlp-main)

Copied to clipboard

Challenge: Recent work using Rank-One Model Editing (ROME) has shown that there are certain facts that the algorithm is unable to edit without breaking the model.
Approach: They propose to use a model editing method called Rank-One Model Editing to make multiple edits to a single model without breaking it.
Outcome: The proposed method improves generalization and locality of model editing and improves model collapse compared to the original implementation of ROME.
Editing Common Sense in Transformers (2023.emnlp-main)

Copied to clipboard

Challenge: Currently, the performance of transformer-based model editing methods is limited to statements about encyclopedic knowledge with a single correct answer.
Approach: They propose to improve MEMIT's model editing algorithm by varying edit tokens and improving the layer selection strategy to improve commonsense knowledge.
Outcome: The MEMIT editing algorithm outperforms baseline models on PEP3k and 20Q datasets while fine-tuning baselines shows significant trade-offs.
Navigating the Dual Facets: A Comprehensive Evaluation of Sequential Memory Editing in Large Language Models (2024.acl-long)

Copied to clipboard

Challenge: Memory Editing (ME) has emerged as an efficient method to modify erroneous facts or inject new knowledge into Large Language Models (LLMs).
Approach: They propose to evaluate LLMs with single edit only and parameter-modifying ME with parameter-preserving ME.
Outcome: The proposed method can maintain LLMs’ fundamental capabilities but struggles to accurately recall edited knowledge presented in a different format.
Efficient Knowledge Editing via Minimal Precomputation (2025.acl-short)

Copied to clipboard

Challenge: Knowledge editing methods like MEMIT require a one-time but significant computational cost.
Approach: They propose to pre-compute 44 million hidden vectors per edited layer . authors show that this precomputation step is unnecessary .
Outcome: The proposed methods can be performed by pre-computing a small portion of 44 million hidden vectors.
Editing the Moving World: Model Editing for Video LLMs (2026.acl-long)

Copied to clipboard

Challenge: Existing models for knowledge editing focus on knowledge-level or static visual domains, overlooking dynamic semantics.
Approach: They propose a benchmark for modeling large language models using six representative models . they analyze the strengths and limitations of existing models and identify new directions .
Outcome: The proposed benchmark extends existing models from static modalities to dynamic video scenarios.
MULFE: A Multi-Level Benchmark for Free Text Model Editing (2024.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have impressive capabilities in comprehending human language and vast parametric knowledge obtained from large corpora.
Approach: They propose a multi-level benchmark for free text model editing to bridge the gap . they categorize probe queries into three levels of generalization .
Outcome: The proposed method improves the generalization performance of large langugae models.
DistillMIKE: Editing Distillation of Massive In-Context Knowledge Editing in Large Language Models (2024.findings-acl)

Copied to clipboard

Challenge: In-context knowledge editing has shown respectable abilities on knowledge editing in terms of generalization and specificity.
Approach: They propose a novel extension of in-context knowledge editing (IKE) that allows for massive edits to be injected into large language models.
Outcome: The proposed method shows state-of-the-art perfomrances and comparable performance with MIKE.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations