MLLMEraser unlearned in multimodal models at test time, without parameter updates and without retraining
AspireAI community · arXiv
Training-based unlearning for multimodal large language models, whether gradient ascent or preference optimisation, is computationally expensive, irreversible, and often damages knowledge the model was supposed to keep. MLLMEraser is a training-free, input-aware framework that erases at test time using activation steering. It builds a multimodal erasure direction by contrasting adversarially perturbed knowledge-recall image-text pairs with knowledge-erasure counterparts, capturing both the textual and the visual discrepancy, and an input-aware steering mechanism then decides when and how strongly to apply that direction so retained knowledge is preserved while designated content is forgotten. On LLaVA-1.5 and Qwen-2.5-VL the authors report stronger forgetting than state-of-the-art MLLM unlearning baselines at lower computational cost and with minimal utility degradation. The paper is accepted at NeurIPS 2026.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.