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

Taewon Yun

COLM 2026×3ACL 2026数据与预训练效率与系统检索与知识评测与基准社会与人本
新星分新星
74
一作贡献30
核心/参与29
方向广度13
合作网络3
1 一作 · 4 篇 · COLM 2026 / ACL 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

4
作者位次 #2/6COLM 2026Poster· Poster Session 2· Imperial Ballroom· #58

Towards Query-Agnostic RAG Evaluation via Query Coverage and Claim Verifiability

Jeonghwan Choi · Taewon Yun · Minjeong Ban · Gyeonghun Sun · Jae-Gil Lee · Hwanjun Song

We redefine correctness of RAG response as the joint satisfaction of query coverage and claim verifiability, enabling fine-grained, reference-free evaluation that works consistently across both close- and open-ended queries.

摘要

Retrieval augmented generation improves the factuality of large language models by grounding responses in retrieved evidence, yet existing evaluation frameworks struggle to provide consistent, fine-grained diagnostics across the diverse spectrum of user queries, ranging from close-ended fact-seeking to open-ended explanatory requests. We propose Q-CARE, a query-agnostic and fully reference-free framework that enables fine-grained assessment by decomposing queries into sub-queries and answers into atomic claims. Q-CARE establishes a unified evaluation principle based on query coverage and claim verifiability, yielding coverage-aware retriever metrics (C-Prec@k, C-nDCG@k) and claim-level generator metrics (Completeness, Conciseness, and Verifiableness). On a human-annotated benchmark spanning eight datasets, Q-CARE achieves higher correlation with human judgments than four existing RAG evaluation metrics, including RAGEval and RAGChecker, proving its effectiveness as a reliable, automated evaluation framework. Code and data are publicly available at \url{https://github.com/DISL-Lab/Q-CaRE-COLM-26}.

检索与知识评测与基准数据与预训练RAGMetricsRAG EvaluationReference-freeOpenReview
作者位次 #5/7COLM 2026Poster· Poster Session 3· Franciscan A· #78

What Makes a Sale? Simulating End-to-End Seller-Buyer Retail Dynamics with LLM Agents

Jeonghwan Choi · Jibin Hwang · Gyeonghun Sun · Minjeong Ban · Taewon Yun · Hyeonjae Cheon · Hwanjun Song

RetailSim is a multi-agent LLM framework that unifies seller sales pitch, buyer interactions, and post-purchase outcomes in one pipeline, enabling causal analysis of how seller strategies propagate across stages to downstream conversion and revenue.

摘要

Evaluating retail strategies before deployment is difficult, as outcomes are determined across multiple stages, from seller-side persuasion through buyer–seller interaction to purchase decisions. However, existing retail simulators capture only partial aspects of this process and do not model cross-stage dependencies, making it difficult to assess how early decisions affect downstream outcomes. We present RetailSim, an end-to-end retail simulation framework that models this pipeline in a unified environment, explicitly designed for simulation fidelity through diverse product spaces, persona-driven agents, and multi-turn interactions. We evaluate RetailSim with a dual protocol comprising human evaluation of behavioral fidelity and meta-evaluation against real-world economic regularities, showing that it successfully reproduces key patterns such as demographic purchasing behavior, the price–demand relationship, and heterogeneous price elasticity. We further demonstrate its practical utility via decision-oriented use cases, including persona inference, seller–buyer interaction analysis, and sales strategy evaluation, showing RetailSim's potential as a controlled testbed for exploring retail strategies.

社会与人本智能体与工具效率与系统retail simulationmulti-agent LLMmulti-stage interactionpersona modelingOpenReview
作者位次 #2/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
一作ACL 2026Findings· Findings of ACL

Distilling Long- C o T Reasoning through Collaborative Step-wise Multi-Teacher Decoding

Taewon Yun · Jisu Shin · Jeonghwan Choi · Seunghwan Bang · Hwanjun Song

摘要

Distilling large reasoning models (LRMs) has become essential for making their Long-CoT reasoning capabilities practical, as full-scale inference remains computationally prohibitive. Existing curation-based approaches, which select complete reasoning traces post-hoc, overlook the collaborative po...

推理效率与系统强化学习与后训练OpenReview 项目页

常见合作者