Skip to content

GONE: Structural Knowledge Unlearning via Neighborhood-Expanded Distribution Shaping

Feb 2026 · arXiv.org · Vol abs/2603.12275 · 1 citation · 25 references
Computer Science

TL;DR

Graph Oblivion and Node Erasure (GONE), a benchmark for evaluating knowledge unlearning over structured knowledge graph (KG) facts in LLMs, enables the disentanglement of three effects of unlearning: direct fact removal, reasoning-based leakage, and catastrophic forgetting.

Abstract

Unlearning knowledge is a pressing and challenging task in Large Language Models (LLMs) because of their unprecedented capability to memorize and digest training data at scale, raising more significant issues regarding safety, privacy, and intellectual property. However, existing works, including parameter editing, fine-tuning, and distillation-based methods, are all focused on flat sentence-level data but overlook the relational, multi-hop, and reasoned knowledge in naturally structured data. In response to this gap, this paper introduces Graph Oblivion and Node Erasure (GONE), a benchmark for evaluating knowledge unlearning over structured knowledge graph (KG) facts in LLMs.This KG-based benchmark enables the disentanglement of three effects of unlearning: direct fact removal, reasoning-based leakage, and catastrophic forgetting. In addition, Neighborhood-Expanded Distribution Shaping (NEDS), a novel unlearning framework, is designed to leverage graph connectivity and identify anchor-correlated neighbors, thereby enforcing a precise semantic separation between the forgotten fact and its semantic neighborhood. Evaluations on LLaMA-3-8B and Mistral-7B across multiple knowledge editing and unlearning methods showcase NEDS's superior performance (1.000 on unlearning efficacy and 0.839 on locality) on GONE and other benchmarks. The dataset is available at https://huggingface.co/datasets/GONE-Anonymous/GONE.

View source

Similar papers

Preprint Aug 2026

Graph-Guided Selective Unlearning for Language Models: Controlling Support Routes Beyond Forget Seeds

GRAPHSU is proposed, a graph-guided controller that expands the deletion scope beyond forget seeds by constructing a weighted support-route graph, propagating deletion pressure through it, and applying graded forgetting strengths to high-risk neighbors, demonstrating that effective enterprise unlearning requires contro...

Waqas Khan, Tabinda Sarwar, Jing-Yue Cong et al. · 0 citations
#machine learning Preprint Sep 2026

Making LLMs Truly Forget: Deep Unlearning by Searching, Selecting, and Severing Knowledge Paths

This work introduces a model-specific pipeline that extracts and completes knowledge graphs from raw text, filtering them by calibrated model confidence to reflect what the model genuinely retains, and applies a graph minimum cut to sever all recovery paths while preserving unrelated knowledge.

Jia-Lu Wang, Pei-Zhi Niu, Hao-Teng Yin et al. · 0 citations
#machine learning Preprint Sep 2026

MUGEN: Generating Unlearnable Graph Examples for Multiple Learning Tasks

This work introduces MUGEN, to its knowledge the first framework for generating unlearnable graph examples that jointly protect all enabled tasks, and devise a Task-Aligned Separability Objective (TASO), which leverages task prediction and classwise separability to strengthen unlearnability and its transfer across GNN...

Zi-Yan Liu, Chengshuai Zhao, Huan Liu · 0 citations
Preprint Aug 2026

Unlearning Is Not Just Erasing: Temporal Decoupling via Generation Inequality

ADU is presented, a fine-grained, training-based framework that shifts unlearning from token erasure to contextual attention-pathway decoupling, and achieves the strongest aggregate performance among evaluated baselines on the TOFU and WMDP benchmarks.

Xun-Lei Chen, Qi-Rui Ye, Yuang Li et al. · 0 citations
Conference Aug 2026

Synergizing Global Structure and Local Evidence: A Discriminative Question Answering Framework Based on Knowledge Graphs

With the recent progress of Large Language Models (LLMs), there has been paradigm-shifting improvement in natural language understanding, significantly outperforming traditional Knowledge Graph Question Answering (KGQA) methods. However, when deployed in specialized vertical domains, domain knowledge deficits of genera...

Jian-Shu Wei, Shuai-Peng Li, Xin Dong et al. · 0 citations
#artificial intelligence Preprint Oct 2026

WASD: Wasserstein-based Knowledge Distillation for Large Language Models

Autoregressive large language models (LLMs) have rapidly advanced in capability, but their increasing scale comes with substantial computational and memory costs at inference time. Knowledge distillation (KD) offers a practical solution by transferring knowledge from a large teacher model to a smaller student model via...

Byeonghu Na, Donghyeok Shin, Yeongmin Kim et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.