Efficient Knowledge Editing via Minimal Precomputation

Knowledge editing methods like MEMIT are able to make data and compute efficient updates of factual knowledge by using a single sentence to update facts and their consequences.However, what is often overlooked is a "precomputation step", which requires a one-time but significant computational cost.The authors of MEMIT (Meng et al., 2022b) originally precompute approximately 44 million hidden vectors per edited layer, which requires a forward pass over 44 million tokens.For GPT-J (6B) (Wang and Komatsuzaki, 2021), this precomputation step takes 36 hours on a single GPU, while it takes approximately 40 hours for Llama2-7B (Touvron et al., 2023).Additionally, this precomputation time grows with model size.In this paper, we show that this excessive computational cost is unnecessary.Knowledge editing using MEMIT and related methods, such as ROME and EMMET (Meng et al., 2022a; Gupta et al., 2024c), can be performed by pre-computing a very small portion of the 44 million hidden vectors.We first present the theoretical minimum number of hidden vector precomputation required for solutions of these editing methods to exist.We then empirically show that knowledge editing using these methods can be done by pre-computing significantly fewer hidden vectors.Specifically, we show that the precomputation step can be done with less than 0.3% of the originally stipulated number of hidden vectors.This saves a significant amount of precomputation time and allows users to begin editing new models within a few minutes.

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.acl-short.65
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Knowledge Editing via Minimal Precomputation

Gopala Anumanchipalli, Akshat Gupta, Miao Lu, Thomas Hartvigsen
Algorithms and Data Compression
article

Efficient Knowledge Editing via Minimal Precomputation

Gopala Anumanchipalli, Akshat Gupta, Miao Lu, Thomas Hartvigsen
article en

Abstract

Knowledge editing methods like MEMIT are able to make data and compute efficient updates of factual knowledge by using a single sentence to update facts and their consequences.However, what is often overlooked is a "precomputation step", which requires a one-time but significant computational cost.The authors of MEMIT (Meng et al., 2022b) originally precompute approximately 44 million hidden vectors per edited layer, which requires a forward pass over 44 million tokens.For GPT-J (6B) (Wang and Komatsuzaki, 2021), this precomputation step takes 36 hours on a single GPU, while it takes approximately 40 hours for Llama2-7B (Touvron et al., 2023).Additionally, this precomputation time grows with model size.In this paper, we show that this excessive computational cost is unnecessary.Knowledge editing using MEMIT and related methods, such as ROME and EMMET (Meng et al., 2022a; Gupta et al., 2024c), can be performed by pre-computing a very small portion of the 44 million hidden vectors.We first present the theoretical minimum number of hidden vector precomputation required for solutions of these editing methods to exist.We then empirically show that knowledge editing using these methods can be done by pre-computing significantly fewer hidden vectors.Specifically, we show that the precomputation step can be done with less than 0.3% of the originally stipulated number of hidden vectors.This saves a significant amount of precomputation time and allows users to begin editing new models within a few minutes.

Openalex Percentile: Top 90%
Algorithms and Data Compression
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.