2606.12809v1 Jun 11, 2026 cs.AI

MLUBench: A Benchmark for Lifelong Unlearning Evaluation in MLLMs

Qizhou Wang
Qizhou Wang
Citations: 666
h-index: 13
Yunxin Mao
Yunxin Mao
Citations: 61
h-index: 4
Tongliang Liu
Tongliang Liu
Citations: 1,930
h-index: 21
He Li
He Li
Citations: 103
h-index: 2
Haoang Chi
Haoang Chi
Citations: 275
h-index: 7
Zhiheng Zhang
Zhiheng Zhang
Citations: 89
h-index: 4
Jie Tan
Jie Tan
Citations: 197
h-index: 4
Wenjing Yang
Wenjing Yang
Citations: 45
h-index: 3
Bo Han
Bo Han
Citations: 1
h-index: 1

Multimodal large language models (MLLMs) are trained on massive multimodal data, making data unlearning increasingly important as data owners may request the removal of specific content. In practice, these requests often arrive sequentially over time, giving rise to the challenging problem of MLLM Lifelong Unlearning. However, most existing benchmarks are limited in scale and scope, failing to capture the complexities of MLLM lifelong unlearning. To fill this gap, we introduce the MLUBench, a large-scale and comprehensive benchmark featuring 127 entities across 9 classes under lifelong unlearning requests. We perform extensive experiments using MLUBench and reveal that existing unlearning methods suffer from severe, cumulative degradation. More critically, we further identify the unique challenge of this problem: unlike in unimodal models, MLLM lifelong unlearning is constrained by the need to preserve multimodal alignment. Continually unlearning from one modality could degrade the entire model. To alleviate this challenge, we propose LUMoE, an effective method. Experiments demonstrate that LUMoE significantly mitigates the degradation problem faced by baselines. The source code and the MLUBench dataset are open-sourced in https://github.com/lihe-maxsize/Lifelong_Unlearning_main.

0 Citations
0 Influential
35.993061443341 Altmetric
180.0 Score
Original PDF
2

No Analysis Report Yet

This paper hasn't been analyzed by Gemini yet.

Log in to request an AI analysis.

댓글

댓글을 작성하려면 로그인하세요.

아직 댓글이 없습니다. 첫 번째 댓글을 남겨보세요!