paper-with-me

홈 › Papers

Sentence-level Reward Model can Generalize Better for Aligning LLM from Human Preference

2025-03-01 · Wenjie Qiu, Yi-Chen Li, Xuqin Zhang, Tianyi Zhang, Yihang Zhang, Zongzhang Zhang, Yang Yu

Learning reward models from human preference datasets and subsequently optimizing language models via reinforcement learning has emerged as a fundamental paradigm for aligning LLMs with human preferences. The performance of the reward model plays a crucial role in the effectiveness of alignment. Previous reward models operate at a coarse-grained level, requiring the generation of a complete response to obtain a reward value. The sparse reward may present challenges for downstream reinforcement learning. While recent efforts have attempted to learn token-level reward models, the lack of explicit semantic information makes it difficult to model the credit of every individual token. In this paper, we propose assigning scores to every sentence, introducing an intermediate-grained reward model. By segmenting the complete response into sentences and applying differential operations to reward output at the start and end positions of each sentence, we can effectively model the rewards of sentences. Moreover, a novel attention mechanism is introduced to aggregate the scores of all sentences into a response-level score, which allows it to be trained using the Bradley-Terry model. On common benchmarks, our method outperforms the response-level reward model by 2.7% on RewardBench (for reward modeling evaluation) and surpasses all baselines on AlpacaEval (for alignment evaluation).

📄 PDF Abstract BibTeX arXiv:2503.04793

Code (0)

등록된 구현이 없습니다.

Tasks

Sentence

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Attention 설명 없음

Similar Papers 제목 키워드 기반

Summary Level Training of Sentence Rewriting for Abstractive Summarization

2019-09-19 · WS 2019 11 · Sanghwan Bae, Taeuk Kim, Jihoon Kim, Sang-goo Lee

As an attempt to combine extractive and abstractive summarization, Sentence Rewriting models adopt the strategy of extracting salient sentences from a document first and then paraphrasing the selected ones to generate a …

Abstractive Text SummarizationExtractive Text SummarizationNatural Language UnderstandingReinforcement Learning+2

ASPO: Adaptive Sentence-Level Preference Optimization for Fine-Grained Multimodal Reasoning

2025-05-25 · Yeyuan Wang, Dehong Gao, Rujiao Long, Lei Yi 외

Direct Preference Optimization (DPO) has gained significant attention for its simplicity and computational efficiency in aligning large language models (LLMs). Recent advancements have extended DPO to multimodal scenario…

Computational EfficiencyMultimodal ReasoningSentence

HPRO: Hierarchical Progressive Reward Optimization via Preference Extraction for Emotional Text-to-Speech

2026-06-26 · Sihang Nie, Xiaofen Xing, Rui Xing, Haoming Li 외 arxiv

Recently, Large Language Model (LLM)-based Text-to-Speech (TTS) models have achieved remarkable naturalness. However, the standard Supervised Fine-Tuning paradigm often converges to statistically averaged prosody, limiti…

Aligning Sentence Simplification with ESL Learner's Proficiency for Language Acquisition

2025-02-17 · Guanlin Li, Yuki Arase, Noel Crespi

Text simplification is crucial for improving accessibility and comprehension for English as a Second Language (ESL) learners. This study goes a step further and aims to facilitate ESL learners' language acquisition by si…

DiversityLanguage AcquisitionLanguage ModelingLanguage Modelling+3

Clustering-based Image-Text Graph Matching for Domain Generalization

2023-10-04 · Nokyung Park, Daewon Chae, Jeongyong Shim, Sangpil Kim 외

Learning domain-invariant visual representations is important to train a model that can generalize well to unseen target task domains. Recent works demonstrate that text descriptions contain high-level class-discriminati…

ClusteringDomain GeneralizationGraph ClusteringGraph Matching+1