Fine-tuning and adaptation

LoRA, PEFT, instruction tuning and domain adaptation — adapting a pretrained model without paying to train one.

8,205 stories · RSS feed

arXiv Computation and Language
Aug 31

AIM: Anchor Identity Features, Then Match for Multimodal Large Language Model Unlearning

The paper introduces AIM, a two‑stage approach for unlearning identity‑specific information from multimodal large language models (MLLMs) when retain images are not available at deletion time. AIM first anchors an identity‑forgetting target using a universal visual prompt, then aligns the vision encoder to this target under a Fisher‑based constraint. Experiments demonstrate that AIM effectively removes identity knowledge while preserving other visual perception capabilities and prior knowledge.

By Wonjun Lee, Jaehyuk Jang, Kangwook Ko, Hee-Seon Kim, Changick Kim
arXiv Computer Vision
Aug 31

Relational Knowledge Distillation Brings DNN Representations Close Enough to Humans to Be Aligned Without Supervision

The study investigates whether transferring relational structure from human mental representations to deep neural networks (DNNs) can improve fine‑grained alignment between the two. Using unsupervised Gromov‑Wasserstein optimal transport, the authors show that fine‑tuning pre‑trained DNNs with Relational Knowledge Distillation (RKD) brings the networks close enough to human representations to align at the individual‑object level on a test set of concepts not seen during training. The improvement is driven mainly by a more human‑like global structure of category distances, while local nearest‑neighbor overlap remains largely unchanged.

By Yuria Shimizu, Soh Takahashi, Takato Horii, Masafumi Oizumi
arXiv Computer Vision
Aug 31

Spectral Query-Key Product Weight Steering for Training-Free VLM Hallucination Mitigation

The paper introduces QK Product Steering, a data‑free, training‑free method that edits the query‑key product in vision‑language models to reduce object hallucination. By suppressing a few dominant singular modes in selected middle layers and mapping the edited product back to query weights, the approach lowers hallucination rates without affecting inference cost. Experiments on three GQA‑based VLMs show a 4.0% average reduction in CHAIR$_s$, with the effect localized to symmetric mutual‑attention channels.

By Karn Tiwari, Varnith Chordia, Prathosh A P
arXiv Machine Learning
Aug 31

Acquire, Repair, Preserve: A Diagnosis-Guided Post-Training Recipe for Small-Model Dialogue Game Agents

The paper presents a post‑training recipe for small dialogue‑game agents that involves three steps: acquiring broad game participation via supervised fine‑tuning, repairing specific local failures with turn‑local preference pairs, and preserving general capabilities. Applied to the LM Playschool Challenge, the method raises the public clemscore from 10.67 to 38.92 and the closed in‑domain score from 13.41 to 41.17 while keeping overall static performance nearly unchanged. The gains are mainly within the targeted game family, with limited improvement on out‑of‑domain clemscore.

By Nan Li
arXiv Computation and Language
Aug 31

PRISM: Self-Pruning Intrinsic Selection Method for Training-Free Multimodal Data Selection

PRISM is a training‑free framework that efficiently selects visual instruction data for multimodal large language models by addressing the anisotropy in visual feature distributions, which causes a Global Semantic Drift. By implicitly re‑centering visual semantics, PRISM removes the influence of global background features, cutting data‑selection and model‑tuning time to 30% of conventional pipelines while improving performance across eight multimodal and three language benchmarks, achieving a 101.7% relative gain over baseline models.

By Jinhe Bi, Aniri, Zengjie Jin, Yifan Wang, Danqi Yan, Wenke Huang, Xiaowen Ma, Sikuan Yan, Artur Hecker, Mang Ye, Xun Xiao, Hinrich Schuetze, Volker Tresp, Yunpu Ma