Demo Data from VLDB 2026 / reviewers in the wild / expert
Nianbo Zeng
dblp:410/0015
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
1 paper |
Reinforcement learning · 75% Language models and text generation · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
alignment |
1.0 | 1 | 2026 | PSPO: Prompt-Level Prioritization and Experience-Weighted Smoothing for Efficient Policy Optimization · AAAI 2026 |
Machine learning › Reinforcement learning › policy optimization
group relative policy optimization |
1.0 | 1 | 2026 | PSPO: Prompt-Level Prioritization and Experience-Weighted Smoothing for Efficient Policy Optimization · AAAI 2026 |
Machine learning › Reinforcement learning
policy optimization |
1.0 | 1 | 2026 | PSPO: Prompt-Level Prioritization and Experience-Weighted Smoothing for Efficient Policy Optimization · AAAI 2026 |
Machine learning › Reinforcement learning › reinforcement learning for NLP
reinforcement fine-tuning |
1.0 | 1 | 2026 | PSPO: Prompt-Level Prioritization and Experience-Weighted Smoothing for Efficient Policy Optimization · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
reward smoothing · 1.0prioritized experience replay · 1.0exponential moving average · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | PSPO: Prompt-Level Prioritization and Experience-Weighted Smoothing for Efficient Policy OptimizationabstractReinforcement Fine-tuning (RFT) methods such as Group Relative Policy Optimization (GRPO) have demonstrated strong capabilities in aligning Large Language Models with human preferences. However, these approaches often suffer from limited data efficiency, necessitating extensive on-policy rollouts to maintain competitive performance. We propose PSPO (Prompt-Level Prioritization and Experience-Weighted Smoothing for Efficient Policy Optimization), a lightweight yet effective enhancement to GRPO that improves training stability and sample efficiency through two complementary techniques. First, we introduce an experience-weighted reward smoothing mechanism, which uses exponential moving averages to track group-level reward statistics for each prompt. This enables more stable advantage estimation across training steps without storing entire trajectories, allowing the model to capture historical reward trends in a lightweight and memory-efficient manner. Second, we adopt a prompt-level prioritized sampling strategy, which is an online data selection method inspired by prioritized experience replay. It dynamically emphasizes higher-impact prompts based on their relative advantages, thereby improving data efficiency. Experiments on multiple mathematical reasoning benchmarks and models show that PSPO achieves comparable or better accuracy than GRPO, while significantly accelerating convergence, and maintaining low computational and memory overhead. Ying He 0006, Haowen Hou, Ruichong Zhang, Nianbo Zeng, Yulin Peng, Jiongfeng Fang, F. Richard Yu |
AAAI | 5 |