paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
SK

Sundong Kim

COLM 2026×2对齐与偏好安全数据与预训练强化学习与后训练多模态
新星分贡献者
34
一作贡献0
核心/参与10
方向广度10
合作网络3
0 一作 · 2 篇 · COLM 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

2
作者位次 #4/5COLM 2026Poster· Poster Session 4· Grand Ballroom· #108

Quality of Rejections Matters: Preference Data Construction for Faithful Summarization

Jihwan Oh · Taewon Yun · Minkyu Che · Sundong Kim · Hwanjun Song

Summarization alignment depends more on the quality of rejected summaries than their quantity, and a simple prompt can generate optimal rejections for improving factuality.

摘要

Factual reliability is a key challenge in abstractive summarization, as LLMs continue to generate hallucinations. A widely adopted solution is preference optimization, training models to prefer faithful over unfaithful summaries, but prior work emphasized the quantity of rejections over their alignment quality. In this paper, we show that effective alignment arises when rejected summaries achieve high alignment potential, characterized by a small preference margin that keeps rejections non-trivial and a large factuality margin that enforces clear factual contrast. Through both theoretical analysis and controlled prompting, we show that three factors, hallucination level, summary length, and prompt complexity, critically shape alignment potential. Building on these insights, we propose SPICE, a simple prompting strategy that produces rejected summaries with strong alignment value. Across diverse model scales and alignment algorithms, SPICE achieves superior factuality without sacrificing coherence, relevance, or abstractiveness, outperforming existing rejection strategies.

对齐与偏好安全数据与预训练LLMData QualityAlignmentSummarizationOpenReview
作者位次 #3/4COLM 2026Poster· Poster Session 4· Grand Ballroom· #117

RAQE: Reranker-Aligned Query Expansion via Label-Free Group-Relative Policy Optimization

Gyeonghun Sun · Jeonghwan Choi · Sundong Kim · Hwanjun Song

We propose a label-free query expansion method that uses reranker-derived signals to train a compact generator, achieving strong retrieval performance with low latency.

摘要

Retrieval-augmented generation is often bottlenecked by retrieval quality, motivating query expansion. We propose RAQE (Reranker-Aligned Query Expansion), a label-free framework that trains a compact generator (3B/8B) via policy optimization using a reranker-derived reward. RAQE replaces human relevance labels with Reranker-Shaped Discounted Gain (RSDG), computed from reranker scores over the retriever's top-$k$ documents. For query expansion, RAQE generates a single, short expansion in one pass, avoiding long outputs and repeated generation while remaining low latency. Across eight IR benchmarks, RAQE is competitive with strong large language model prompting baselines and narrows the gap to reinforcement learning methods that rely on costly human supervision.

强化学习与后训练对齐与偏好多模态Query ExpansionRetrieval-Augmented GenerationInformation RetrievalReinforcement LearningOpenReview

常见合作者