GapDPO: Setwise Direct Preference Optimization for LLM Safety Alignment

While reinforcement learning is widely used to align large language models (LLMs), its application to open-ended settings remains limited by reliance on preference datasets, making it difficult to scale to non-reasoning tasks such as safety. Applying direct preference optimization (DPO) to LLM safety alignment requires preferred and dispreferred responses for harmful instructions, making scalable preference construction a key bottleneck. We therefore propose GapDPO, a setwise preference optimization method that enables DPO-based safety alignment without reward models, verifiers, or preference annotation. GapDPO constructs preference sets by generating safe responses with our proposed refusal-style prompts and pairing them with affirmative targets from the dataset. GapDPO then maximizes the mean reward gap between the two sets while penalizing within-set variance. On AdvBench and HarmBench, GapDPO reduces the average attack success rate under PAIR, GCG, and AmpleGCG from 21.3% for refusal-style fine-tuning and 15.0% for single-pair DPO to 10.6%, while increasing strict set separation on training behaviors from 51% to as high as 63%. The improvement is mainly observed under GCG attacks and is accompanied by more refusals of benign requests. The averaged pairwise DPO on the same preference sets performs comparably, indicating that these sets account for most of the gain over single-pair DPO.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-11-03
DOI
https://doi.org/10.3390/app162110900
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GapDPO: Setwise Direct Preference Optimization for LLM Safety Alignment

Eun Seo Seo, Ji Won Yoon, Min Ho Jang, Jinyoung Kim et al.
Applied Sciences
Adversarial Robustness in Machine Learning
article

GapDPO: Setwise Direct Preference Optimization for LLM Safety Alignment

Eun Seo Seo, Ji Won Yoon, Min Ho Jang, Jinyoung Kim, Minji Cho, Hyeongsoo Lim
article en

Abstract

While reinforcement learning is widely used to align large language models (LLMs), its application to open-ended settings remains limited by reliance on preference datasets, making it difficult to scale to non-reasoning tasks such as safety. Applying direct preference optimization (DPO) to LLM safety alignment requires preferred and dispreferred responses for harmful instructions, making scalable preference construction a key bottleneck. We therefore propose GapDPO, a setwise preference optimization method that enables DPO-based safety alignment without reward models, verifiers, or preference annotation. GapDPO constructs preference sets by generating safe responses with our proposed refusal-style prompts and pairing them with affirmative targets from the dataset. GapDPO then maximizes the mean reward gap between the two sets while penalizing within-set variance. On AdvBench and HarmBench, GapDPO reduces the average attack success rate under PAIR, GCG, and AmpleGCG from 21.3% for refusal-style fine-tuning and 15.0% for single-pair DPO to 10.6%, while increasing strict set separation on training behaviors from 51% to as high as 63%. The improvement is mainly observed under GCG attacks and is accompanied by more refusals of benign requests. The averaged pairwise DPO on the same preference sets performs comparably, indicating that these sets account for most of the gain over single-pair DPO.

Applied SciencesVol. 16(21)
Chung-Ang University (KR)
Openalex Percentile: Top 16%
Adversarial Robustness in Machine Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon