Skip to content

MUGEN: Generating Unlearnable Graph Examples for Multiple Learning Tasks

Sep 2026 · 0 citations · 42 references
Computer Science

TL;DR

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 backbones and enabled tasks.

Abstract

Graph data across diverse domains can expose valuable relational information to unauthorized representation learning, creating a pressing need for protection against such misuse. Unlearnable examples offer a data-level defense by perturbing a training release so that models trained on it fail to generalize to clean data. Existing methods generate unlearnable graph examples for only a specified downstream task. Consequently, a release protected against one task may remain learnable for other plausible uses, including node classification, graph classification, and link prediction, which the data owner cannot anticipate. We introduce MUGEN, to our knowledge the first framework for generating unlearnable graph examples that jointly protect all enabled tasks. From one clean dataset, MUGEN produces a single feature-perturbed release that protects every enabled task through a shared GNN encoder and task-specific heads. We devise a Task-Aligned Separability Objective (TASO), which leverages task prediction and classwise separability to strengthen unlearnability and its transfer across GNN backbones and enabled tasks. We further introduce Type-Adaptive Perturbation (TAP), which tailors perturbation optimization to node-attribute type, with direct search over feasible hard flips that accept only loss-improving updates for discrete node attributes and customized gradient-based updates for continuous node features, thereby enabling strong unlearnability across both settings. Experiments across five benchmarks, four backends and three learning paradigms demonstrate that MUGEN generates transferable unlearnable graph examples across GNN backbones and all three tasks, and remains effective under adversarial training and data augmentation.

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
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
#artificial intelligence Preprint Aug 2026

Let Prompts Bridge Defense Knowledge: Transferable Graph Purification via Vulnerability-Aware GPL

This work proposes a transferable graph purification scheme, named ProGAP, to bridge adversarial defense knowledge via vulnerability-aware graph prompt learning, and achieves 1%-9% improvement, and reduces the time consumption by up to 2.2x.

Shuo-Min Xue, Jing-Yuan Li, Ju Jia et al. · 0 citations
#machine learning Preprint Sep 2026

Message Passing Does More with Less for In-Context Learning on Graphs

Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeated costs and effort. Graph in-context learning (ICL) avoids this by using a single pretrained model to predict unknown node labels directly from labeled context nodes. E...

Dooho Lee, Jin-Mo Lee, Minho Jeong et al. · 0 citations
#machine learning Preprint Sep 2026

UnlearningSoup: Is Repeated Tuning Necessary for Large Language Model Unlearning?

Whether unlearning runs exhibit exploitable structure in weight space is investigated, and it is observed that models from different runs still lie in a shared evaluation-performance basin, suggesting that stronger models may be recovered through an unlearning-tailored soup strategy, reducing the need for repeated tuni...

Pu-Ning Yang, Qi-Zhou Wang, Jun-Chi Yu et al. · 0 citations
Preprint Sep 2026

SUCRe: Selective Uncertainty-Aware Contrastive Representation for Graph Transfer Learning

This work introduces structure-aware entropy-based matching discrepancy, which jointly models feature uncertainty and structural coherence to ensure accurate feature adaptation between graphs and develops a domain-aware semi-hard negative sampling strategy that constructs informative contrastive sets by filtering unrel...

Ming-Can Wang, Jun-Chang Xin, Zhong-Ming Yao et al. · 0 citations

Related blog posts

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