CLAILGMar 17, 2025

Atyaephyra at SemEval-2025 Task 4: Low-Rank Negative Preference Optimization

arXiv:2503.13690v21 citationsh-index: 18
Originality Incremental advance
AI Analysis

This work addresses the challenge of removing sensitive information from large language models, though it appears incremental as it builds on existing optimization techniques.

The authors tackled the problem of unlearning sensitive content from LLMs by applying negative preference optimization with low-rank adaptation, which significantly exceeded shared task baselines.

We present a submission to the SemEval 2025 shared task on unlearning sensitive content from LLMs. Our approach employs negative preference optimization using low-rank adaptation. We show that we can utilize this combination to efficiently compute additional regularization terms, which help with unlearning stabilization. The results of our approach significantly exceed the shared task baselines.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes