Skip to content

Stochastic Meta-Unlearning: Bridging Language Backbone and Multimodal Unlearning

Jul 2026 · arXiv.org · Vol abs/2607.18615 · 0 citations · 49 references
Computer Science

TL;DR

The proposed Stochastic Meta-Unlearning (SMU), a bilevel framework that uses VLM-level feedback to learn an unlearning-ready initialization, suggests that VLM-level feedback can make language-backbone unlearning more reliable and more transferable for VLMs.

Abstract

Machine unlearning for vision-language models (VLMs) remains underexplored. Unlike language models, VLMs combine a language backbone with visual components, which makes unlearning more complex. There is a surprising phenomenon when moving from single-modality unlearning to VLM unlearning: a target forgotten by the standalone language backbone can still be recovered when image information is given to the full VLM. This shows that text-only feedback is not enough for reliable VLM unlearning. Motivated by this observation, we propose Stochastic Meta-Unlearning (SMU), a bilevel framework that uses VLM-level feedback to learn an unlearning-ready initialization. In the inner loop, SMU applies a few unlearning steps to the language backbone using text data. In the outer loop, SMU recomposes the updated backbone with the frozen VLM and evaluates forgetting and utility at the VLM level. This design makes the unlearning update aware of the final multimodal behavior, while still keeping the update local to the language backbone. Experiments on two VLMs, two multimodal meme datasets, and three baselines show that SMU achieves the best overall forget-retain trade-off. Compared with the strongest baseline for each metric, SMU reduces average Forget accuracy by 10.52 points and improves average Retain and Test accuracy by 20.10 and 17.01 points, respectively. More importantly, SMU also transfers to new forgetting targets and to different meta-test unlearning methods. These results suggest that VLM-level feedback can make language-backbone unlearning more reliable and more transferable for VLMs.

View source

Similar papers

Preprint Aug 2026

Does Forgetting Transfer Across Modalities? A Real-World Benchmark for Cross-Modal Knowledge Unlearning Evaluation

UNLINK-VL is introduced, a real-world benchmark for cross-modal knowledge unlearning in VLMs that demonstrates that relying solely on intra-modal evaluation, particularly text-only evaluation, may substantially overestimate the effectiveness of knowledge unlearning in VLMs, underscoring the need for cross-modal unlearn...

Chun-Lin Liu, Jun-Nian Chen, Haitong Jiang et al. · 0 citations
Open access Sep 2026

CMJU: cross-modal joint unlearning for balanced forgetting in multimodal large language models

Multimodal large language models (MLLMs) may memorize private or sensitive knowledge from training data, making unlearning important for safe deployment. Existing studies have shown that unlearning in MLLMs can remain inconsistent across multimodal and text-only inputs: target knowledge that has been forgotten through...

Di-Hang Yang, Baochen Xiong, Xiaoshan Yang · 0 citations
Preprint Aug 2026

A Model Merging Approach for Continual MLLM Unlearning

This work introduces Merging for Continual Unlearning (MCU), an approach that dynamically merges multiple one-shot unlearning adapters into a unified adapter upon receiving each new unlearning request and achieves superior unlearning effectiveness while preserving both retained knowledge and general multimodal utility.

Yuhang Wang, Lin-Lin Zhang, Haoxuan Ji et al. · 0 citations
Preprint Sep 2026

What Does It Mean to Forget a Person? Individual-Level Unlearning in Vision-Language Models

Erasing individual identities from Vision-Language Models (VLMs) is uniquely challenging because personal data is entangled across modalities rather than stored as isolated attributes. However, existing multimodal unlearning benchmarks primarily evaluate attribute-centric forgetting, overlooking the more critical objec...

Xiong-Tao Sun, Hui Li, Tian-Tong Wu et al. · 0 citations
Preprint Aug 2026

GROM: Gradient-Free Rapid One-Shot Machine Unlearning

This work proposes a novel one-shot unlearning approach, abandoning iterative optimization in favor of a direct, exact analytical solution, and achieves state-of-the-art forgetting-utility trade-offs on TOFU-5%, TOFU-10%, MUSE-Books, MUSE-News and WMDP, significantly reducing computational overhead without sacrificing...

Pawel Batorski, P. Spurek, Paul Swoboda · 1 citation
#machine learning Preprint Sep 2026

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

Large language models trained on vast corpora inherently risk memorizing harmful content that may later re-emerge in their outputs. To mitigate this issue, existing unlearning methods typically rely on training-based parameter updates, such as gradient ascent and its variants, to delete targeted content while preservin...

Pu-Ning Yang, Qi-Zhou Wang, Jun-Chi Yu 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.