0

Discovering Knowledge-Critical Subnetworks in Pretrained Language Models

A differentiable weight masking scheme identifies and removes specific knowledge subnetworks from pretrained language models, demonstrating high sparsity and minimal impact on overall model performance except in tasks requiring the removed knowledge.

Year
2023
Venue
arXiv 2023
Authors
5
Hosting
Abstract onlyARXIV-DEFAULT

Cite

Notes

Only stored in your browser.

Attribution

Abstract & full text
arxiv.org/abs/2310.03084v2ARXIV-DEFAULT
TL;DR
Semantic Scholar
Attribution policy →

Abstract

Pretrained language models (LMs) encode implicit representations of knowledge in their parameters. However, localizing these representations and disentangling them from each other remains an open problem. In this work, we investigate whether pretrained language models contain various knowledge-critical subnetworks: particular sparse computational subgraphs that can, if removed, precisely suppress specific knowledge the model has memorized. We propose a multi-objective differentiable masking scheme that can be applied to both weights and neurons to discover such subnetworks and show that we can use them to precisely remove specific knowledge from models while minimizing adverse effects on the behavior of the original model. We demonstrate our method on multiple GPT2 variants, uncovering highly sparse subnetworks (98%+ sparsity) that are critical for expressing specific collections of relational knowledge. When these subnetworks are removed, the remaining network maintains most of its initial abilities but struggles to represent the suppressed knowledge.

Authors

5