Papers with HH-RLHF
RELIC: Enhancing Reward Model Generalization for Low-Resource Indic Languages with Few-Shot Examples (2025.findings-emnlp)
Copied to clipboard
Soumya Suvra Ghosal, Vaibhav Singh, Akash Ghosh, Soumyabrata Pal, Subhadip Baidya, Sriparna Saha, Dinesh Manocha
| Challenge: | a new reward model for low-resource Indic languages is proposed . a preference-based training approach is prohibitively expensive, authors say . |
| Approach: | a new in-context learning framework is proposed to train a retriever to select in-constext examples from low-resource Indic languages. |
| Outcome: | a new in-context learning framework for reward modeling in low-resource Indic languages is developed . the proposed framework outperforms existing examples on three preference datasets . |
The Language Barrier: Dissecting Safety Challenges of LLMs in Multilingual Contexts (2024.findings-acl)
Copied to clipboard
Lingfeng Shen, Weiting Tan, Sihao Chen, Yunmo Chen, Jingyu Zhang, Haoran Xu, Boyuan Zheng, Philipp Koehn, Daniel Khashabi
| Challenge: | Recent studies show that malicious prompt instructions could solicit objectionable content from LLMs. |
| Approach: | They compare how state-of-the-art LLMs respond to malicious prompts in different languages . they find that LLM's generate unsafe responses more often when a prompt is written in a lower-resource language . |
| Outcome: | The proposed model can generate unsafe responses more often when a malicious prompt is written in a lower-resource language, and less irrelevant responses when written in lower-source languages. |
A Deep Dive into the Trade-Offs of Parameter-Efficient Preference Alignment Techniques (2024.acl-long)
Copied to clipboard
| Challenge: | Large language models are pre-trained on trillions of tokens and instruction-tuned or aligned to specific preferences. |
| Approach: | They propose guidelines to help researchers perform more effective parameter-efficient LLM alignment. |
| Outcome: | The proposed methods outperform preference optimization and outperformed pre-trained models on three key axes. |
GenderAlign: An Alignment Dataset for Mitigating Gender Bias in Large Language Models (2025.acl-long)
Copied to clipboard
Tao Zhang, Ziqian Zeng, YuxiangXiao YuxiangXiao, Huiping Zhuang, Cen Chen, James R. Foulds, Shimei Pan
| Challenge: | Large Language Models (LLMs) generate content that exhibits gender biases, raising ethical concerns. |
| Approach: | They propose to use a dataset to identify gender biases in Large Language Models (LLMs) this dataset is a "chosen" and "rejected" LLM alignment is an effective approach to mitigate gender bias. |
| Outcome: | The proposed dataset shows that it reduces gender bias and improves quality. |
DiffPO: Diffusion-styled Preference Optimization for Inference Time Alignment of Large Language Models (2025.acl-long)
Copied to clipboard
Ruizhe Chen, Wenhao Chai, Zhifei Yang, Xiaotian Zhang, Ziyang Wang, Tony Quek, Joey Tianyi Zhou, Soujanya Poria, Zuozhu Liu
| Challenge: | Inference-time alignment approaches still face limitations due to policy-specific value functions and latency during the inference phase. |
| Approach: | They propose an efficient and policy-agnostic preference optimization method that avoids time latency associated with token generation. |
| Outcome: | The proposed method achieves a favorable trade-off between alignment quality and inference-time latency. |
TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling (2025.findings-emnlp)
Copied to clipboard
Jiahao Qiu, Yifu Lu, Yifan Zeng, Jiacheng Guo, Jiayi Geng, Chenhao Zhu, Xinzhe Juan, Ling Yang, Huazheng Wang, Kaixuan Huang, Yue Wu, Mengdi Wang
| Challenge: | Best-of-N (BoN) sampling generates multiple responses and selects the best one, achieving improved performance but with a high computational cost. |
| Approach: | They propose a framework that integrates a speculative tree-search strategy into Best-of-N (BoN) Sampling. |
| Outcome: | The proposed framework outperforms Best-of-N (BoN) sampling but has high computational cost . tree-search strategy reduces computational overhead while maintaining high output quality . |