Wonjun Lee
Author directoryOther people with similar names: Wonjun Lee
Unverified author pages with similar names: Wonjun Lee
2026
SubT: Subspace Tuning for Few-shot Generalization of Audio-Language Models
Jaehyuk Jang | Kangwook Ko | Wonjun Lee | Changick Kim
Findings of the Association for Computational Linguistics: EMNLP 2026
Jaehyuk Jang | Kangwook Ko | Wonjun Lee | Changick Kim
Findings of the Association for Computational Linguistics: EMNLP 2026
Few-shot parameter-efficient adaptation of pretrained Audio–Language Models (ALMs) often improves seen-class performance at the cost of unseen-class generalization, leading to the base-to-new trade-off. We study this failure through zero-shot drift in the text embedding space: few-shot tuning can distort inter-class structure and move adapted embeddings away from their pretrained anchors. We therefore propose Subspace Tuning (SubT), an embedding-space adaptation method that combines a geometry-aware shared transformation with anchoring to the zero-shot prototypes. The learned transformation is transferred to unseen classes, with subspace-aware gating to mitigate negative transfer. Across 11 audio benchmarks, SubT achieves strong few-shot generalization while operating directly on precomputed text embeddings without text-encoder backpropagation. Code is available at https://github.com/jhyukjang/SubT.
AIM: Anchor Identity Features, Then Match for Multimodal Large Language Model Unlearning
Wonjun Lee | Jaehyuk Jang | Kangwook Ko | Hee-Seon Kim | Changick Kim
Findings of the Association for Computational Linguistics: EMNLP 2026
Wonjun Lee | Jaehyuk Jang | Kangwook Ko | Hee-Seon Kim | Changick Kim
Findings of the Association for Computational Linguistics: EMNLP 2026
Multimodal large language models (MLLMs) can memorize identity-specific facts about people in their fine-tuning data, creating privacy risks when a person requests deletion. Existing MLLM unlearning methods often assume access to retain images or ground-truth answers during deletion, which is unrealistic in many practical scenarios. We study identity unlearning when retain images are unavailable at deletion time. Our analysis shows that identity and visual-perception questions occupy distinct regions in fine-tuned hidden states and are organized differently: identity questions cluster by person, whereas perception questions cluster by question type. This suggests that identity knowledge can be suppressed without erasing general visual perception. Building on this observation, we propose AIM, a two-stage method that anchors an identity-forgetting target with a universal visual prompt and then matches the vision encoder to that target under a Fisher-based constraint. Extensive experiments show that AIM achieves competitive identity forgetting while preserving non-deleted identities, prior knowledge, and visual perception on the same images.
Where Identity Lives: Localized, Retain-Free Identity Unlearning in Multimodal Large Language Models
Kangwook Ko | Jaehyuk Jang | Wonjun Lee | Hee-Seon Kim | Changick Kim
Findings of the Association for Computational Linguistics: EMNLP 2026
Kangwook Ko | Jaehyuk Jang | Wonjun Lee | Hee-Seon Kim | Changick Kim
Findings of the Association for Computational Linguistics: EMNLP 2026
Removing a specific individual’s information from multimodal large language models (MLLMs) is often needed after deployment, but existing methods rely on a retain set, which is hardest to obtain at that point, and rebuilding it recreates the privacy exposure that unlearning aims to remove. Forgetting from the forget set alone instead damages the shared visual-language computation, harming perception. We cast retain-free unlearning as a localization problem: causal tracing, weight transplant, and Fisher overlap all point to early-to-mid decoder MLPs as the layers where identity information is stored and, unlike other module families, can be modified without substantially disrupting vision. We turn this into Pathway-Aware Visual-attribute Anchoring (PAVA), which confines updates to these layers and pairs a forget loss with a visual-attribute anchor that preserves image-grounded behavior by distilling the model’s own pre-unlearning answers from the forget images alone. On MLLMU-Bench and ReMem, PAVA gives the strongest forget-retain trade-off among forget-set-only methods and remains competitive with retain-based baselines.
Generalizable Prompt Tuning for Audio-Language Models via Semantic Expansion
Jaehyuk Jang | Wonjun Lee | Kangwook Ko | Changick Kim
Findings of the Association for Computational Linguistics: ACL 2026
Jaehyuk Jang | Wonjun Lee | Kangwook Ko | Changick Kim
Findings of the Association for Computational Linguistics: ACL 2026
Prompt tuning has achieved remarkable progress in vision–language models (VLMs) and is recently being adopted for audio–language models (ALMs). However, its generalization ability in ALMs remains largely underexplored. We observe that conventional prompt tuning for ALMs also suffers from the Base–New Tradeoff, and we identify that this issue stems from the disrupted semantic structure of the embedding space. To address this issue, we propose Semantically Expanded Prompt Tuning (SEPT)—a plug-and-play framework that explicitly regularizes the prompt embedding space by incorporating semantic neighbors generated by large language models. SEPT introduces a novel semantic expansion loss with margin constraints that promote intra-class compactness and inter-class separability, thereby enhancing the semantic structure of the prompt embedding space. For comprehensive evaluation, we establish the first benchmark setup for prompt generalization in ALMs, covering both base-to-new generalization and cross-dataset transferability. Extensive experiments demonstrate that SEPT consistently improves generalization performance across multiple prompt tuning baselines, while maintaining computational cost during inference.