Skip to content
Preprint

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

Aug 2026 · 0 citations · 27 references
Computer Science

TL;DR

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 controlling support routes, not just forget seeds.

Abstract

Enterprises fine-tune language models on proprietary data that may later require removal due to privacy, contractual, or compliance obligations. Selective unlearning removes requested knowledge while preserving model utility, offering a practical alternative to full retraining, but existing methods treat the explicitly identified forget examples as the complete deletion scope. This is insufficient when target knowledge remains recoverable through paraphrases, aliases, or neighboring training examples. We propose GRAPHSU, 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. On the Task of Fictitious Unlearning (TOFU), a synthetic author-profile question-answering benchmark, and PISTOL, a structural-unlearning benchmark built around interconnected factual samples, with GPT-2 Medium and Llama-3.2-3B-Instruct, GRAPHSU achieves the lowest utility-feasible soft leakage across all deletion settings, reducing leakage by up to 49.5 percentage points over a matched seed-only baseline, demonstrating that effective enterprise unlearning requires controlling support routes, not just forget seeds.

View source

Similar papers

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
Preprint Aug 2026

FlowNeg: GFlowNet-Guided Diverse Hard Negative Sampling for Knowledge Graph Embedding

FlowNeg is introduced, a context-conditioned hierarchical generative flow network that amortizes reward-proportional sampling without normalizing a composite reward over the entity set: given a positive triple and corruption side, it selects a type, then an entity.

Ibne Farabi Shihab, Naoshin Anzum Hridi, Joyanta J. Mondal · 0 citations
Preprint Aug 2026

What to Forget in Unlearning? Forget Set Curation for Language Models

This work introduces CleanSlate, a benchmark for verbatim output suppression over songs and books, with model-specific extraction profiles, content-grounded QA, and capability-retention evaluations, and shows that practical unlearning is not only an optimization problem once a forget set is given, but also what can be...

Animesh Jha, Arpandeep Khatua, Youssef Allouah et al. · 0 citations
#artificial intelligence Preprint Sep 2026

CUNO: Curriculum and Preference Optimization for Stable Graph Unlearning under Mass Deletion

CUNO is proposed, a curriculum-based graph unlearning framework that removes the forget set progressively, ordering samples by their estimated unlearning difficulty across multiple stages, and employs a distribution-level negative preference optimization objective at each curriculum stage that steers the model away fro...

Chen-Han Zhang, Ali Braytee, M. Bandara 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

Overcoming Shortcut Learning in Graph Neural Networks through Active Explanation Guidance

This work introduces XIGL, an architecture-agnostic human-in-the-loop strategy for removing shortcuts from GNNs, and develops an active learning strategy for prioritizing explanations that are more likely to display shortcut behavior, lowering annotation and cognitive costs.

Taraneh Younesian, Steve Azzolin, A. Longa et al. · 0 citations

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