Papers by Haoke Zhang
Generative Reward Modeling via Synthetic Criteria Preference Learning (2025.acl-long)
Copied to clipboard
| Challenge: | Generative Reward Models (GenRMs) leverage synthesized Chains of Thought (CoT) but this approach introduces risks of overoptimization due to the inability to guarantee the correctness of the CoTs. |
| Approach: | They propose a criteria-based preference tree for GenRMs that uses chain of thought to generate reasoning . they show that synthesized data can be learned using a long CoT format . |
| Outcome: | The proposed model shows significant improvements over baselines on multiple human preference benchmarks. |
𝒜3: Automatic Alignment Framework for Attributed Text Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches of aligning large language models to follow user instructions can lead to undue emphasis on irrelevant documents, which in turn reduces the quality of responses. |
| Approach: | They propose to use a framework to automatically generate high-quality attributed query-response pairs for both supervised fine-tuning and preference optimization stages without human annotation. |
| Outcome: | The proposed framework can generate high-quality attributed query-response pairs without human annotation without human intervention. |
Unlocking Recursive Thinking of LLMs: Alignment via Refinement (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for recursive reasoning are limited due to lack of expert-curated data. |
| Approach: | They propose a method that unlocks the potential of Large Language Models for recursive reasoning through long-form Chain of Thought. |
| Outcome: | The proposed method outperforms preference optimization methods on the openAI o1-series models by 20% on 3k synthetic samples. |
G-SPEED: General SParse Efficient Editing MoDel (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated incredible capabilities in understanding, generating, and manipulating languages. |
| Approach: | They propose a general SParse Efficient Editing MoDel which can fulfill diverse editing requirements through a single model while maintaining low computational costs. |
| Outcome: | The proposed model can fulfill diverse editing requirements through a single model while maintaining low computational costs. |