Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yangen Hu

dblp:408/4387 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Reinforcement learning · 67% Language models and text generation · 33%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
alignment
1.012026
Reward Alignment Optimization: A Direct Point-wise Alignment Approach · ACL (1) 2026
Natural language and speech › Language models and text generation › alignment › preference alignment
direct alignment algorithms
1.012026
Reward Alignment Optimization: A Direct Point-wise Alignment Approach · ACL (1) 2026
Machine learning › Reinforcement learning
reinforcement learning from human feedback
1.012026
Reward Alignment Optimization: A Direct Point-wise Alignment Approach · ACL (1) 2026
Machine learning › Reinforcement learning › reinforcement learning from human feedback
reward alignment
1.012026
Reward Alignment Optimization: A Direct Point-wise Alignment Approach · ACL (1) 2026
Machine learning › Reinforcement learning
exploration
0.912025
Enhancing Efficiency and Exploration in Reinforcement Learning for LLMs · EMNLP 2025
Machine learning › Reinforcement learning › reinforcement learning for NLP
reinforcement learning for language models
0.912025
Enhancing Efficiency and Exploration in Reinforcement Learning for LLMs · EMNLP 2025
Machine learning › Reinforcement learning
rollout budget allocation
0.912025
Enhancing Efficiency and Exploration in Reinforcement Learning for LLMs · EMNLP 2025
Natural language and speech › Language models and text generation
large language model reasoning
0.312025
Enhancing Efficiency and Exploration in Reinforcement Learning for LLMs · EMNLP 2025

Methods — techniques the papers use, named apart from their topics

point-wise direct alignment · 1.0bradley-terry model · 1.0preference optimization · 0.9dynamic temperature adjustment · 0.9
YearPublicationVenuePosition
2026 Reward Alignment Optimization: A Direct Point-wise Alignment Approach
abstract
Direct Alignment Algorithms (DAAs) such as DPO simplify RLHF by optimizing policies directly from preference pairs.However, the Bradley-Terry probability-gap objective can induce likelihood displacement and, under weak KL constraints, may even reduce the probability of preferred responses, while implicit rewards can be limited in generalization.We propose Reward Alignment Optimization (RAO), a point-wise direct alignment method that uses an explicit reward model to specify exact target generation probabilities and align the policy offline towards them.Our key insight is a theoretical principle we call "prefix consistency", which links the normalization terms of prompts that share a prefix.Leveraging this property, RAO decouples target reward differentials from bias terms, prevents decreasing preferred-response probabilities, and better exploits reward information both within and across prompts.Extensive experiments on multiple base LLMs show that RAO consistently outperforms existing DAAs while enabling controllable target probability distributions.
Jia Leng, Yangen Hu
ACL (1)4
2025 Enhancing Efficiency and Exploration in Reinforcement Learning for LLMs
abstract
Reasoning large language models (LLMs) excel in complex tasks, which has drawn significant attention to reinforcement learning (RL) for LLMs. However, existing approaches allocate an equal number of rollouts to all questions during the RL process, which is inefficient. This inefficiency stems from the fact that training on simple questions yields limited gains, whereas more rollouts are needed for challenging questions to sample correct answers. Furthermore, while RL improves response precision, it limits the model’s exploration ability, potentially resulting in a performance cap below that of the base model prior to RL. To address these issues, we propose a mechanism for dynamically allocating rollout budgets based on the difficulty of the problems, enabling more efficient RL training. Additionally, we introduce an adaptive dynamic temperature adjustment strategy to maintain the entropy at a stable level, thereby encouraging sufficient exploration. This enables LLMs to improve response precision while preserving their exploratory ability to uncover potential correct pathways. The code and data is available on: https://anonymous.4open.science/r/E3-RL4LLMs-DB28
Mengqi Liao, Xiangyu Xi, Ruinian Chen, Jia Leng, Yangen Hu, Huaiyu Wan
EMNLP5