Demo Data from VLDB 2026 / reviewers in the wild / expert
Yangou Ouyang
dblp:399/9816
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 4 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
3 papers |
Language models and text generation · 32% Reinforcement learning · 22% Transfer learning and domain adaptation · 17% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
large language model fine-tuning |
1.0 | 1 | 2026 | Consolidation or Adaptation? PRISM: Disentangling SFT and RL Data via Gradient Concentration · ACL (1) 2026 |
Machine learning › Transfer learning and domain adaptation
meta-learning |
1.0 | 1 | 2026 | MAESTRO: Meta-learning Adaptive Estimation of Scalarization Trade-offs for Reward Optimization · ACL (1) 2026 |
Machine learning › Reinforcement learning
reward maximization |
1.0 | 1 | 2026 | MAESTRO: Meta-learning Adaptive Estimation of Scalarization Trade-offs for Reward Optimization · ACL (1) 2026 |
Machine learning › Efficient and distributed learning
data selection |
0.9 | 1 | 2025 | Beyond Similarity: A Gradient-based Graph Method for Instruction Tuning Data Selection · ACL (1) 2025 |
Natural language and speech › Language models and text generation
instruction tuning |
0.9 | 1 | 2025 | Beyond Similarity: A Gradient-based Graph Method for Instruction Tuning Data Selection · ACL (1) 2025 |
Machine learning › Reinforcement learning
reinforcement learning from human feedback |
0.3 | 1 | 2026 | Consolidation or Adaptation? PRISM: Disentangling SFT and RL Data via Gradient Concentration · ACL (1) 2026 |
Methods — techniques the papers use, named apart from their topics
scalarization · 1.0meta-learning · 1.0gradient concentration analysis · 1.0gradient-based graph method · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Consolidation or Adaptation? PRISM: Disentangling SFT and RL Data via Gradient ConcentrationabstractYang Zhao, Yangou Ouyang, Xiao Ding, Hepeng Wang, Bibo Cai, Kai Xiong, Jinglong Gao, Zhouhao Sun, Li Du, Bing Qin, Ting Liu. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026. Yang Zhao 0023, Yangou Ouyang, Hepeng Wang, Bibo Cai, Kai Xiong 0002, Jinglong Gao, Zhouhao Sun, Bing Qin 0001, Ting Liu 0001 |
ACL (1) | 2 |
| 2026 | MAESTRO: Meta-learning Adaptive Estimation of Scalarization Trade-offs for Reward OptimizationabstractYang Zhao, Hepeng Wang, Xiao Ding, Yangou Ouyang, Bibo Cai, Kai Xiong, Jinglong Gao, Zhouhao Sun, Li Du, Bing Qin, Ting Liu. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026. Yang Zhao 0023, Hepeng Wang, Yangou Ouyang, Bibo Cai, Kai Xiong 0002, Jinglong Gao, Zhouhao Sun, Bing Qin 0001, Ting Liu 0001 |
ACL (1) | 4 |
| 2025 | Beyond Similarity: A Gradient-based Graph Method for Instruction Tuning Data SelectionabstractYang Zhao, Li Du, Xiao Ding, Yangou Ouyang, Hepeng Wang, Kai Xiong, Jinglong Gao, Zhouhao Sun, Dongliang Xu, Qing Yang, Dongchen Li, Bing Qin, Ting Liu. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025. Yang Zhao 0023, Yangou Ouyang, Hepeng Wang, Kai Xiong 0002, Jinglong Gao, Zhouhao Sun, Dongliang Xu, Qing Yang 0033, Bing Qin 0001, Ting Liu 0001 |
ACL (1) | 4 |
| 2025 | UFO-RL: Uncertainty-Focused Optimization for Efficient Reinforcement Learning Data SelectionabstractA primary impediment to scaling reinforcement learning (RL) for large language model (LLM) training is the substantial computational cost, predominantly arising from the necessity of multi-sampling for policy optimization and evaluation. This underscores the critical yet challenging nature of efficient training data selection. Drawing inspiration from the Zone of Proximal Development (ZPD) theory, which posits that learners acquire knowledge more effectively from tasks of intermediate difficulty, we hypothesize that LLMs exhibit optimal learning from data they have not yet mastered but demonstrate the potential to comprehend. Conventional methodologies for assessing data difficulty or informativeness typically rely on computationally intensive multi-sampling or iterative procedures. To address this limitation, we introduce UFO-RL (**U**ncertainty-**F**ocused **O**ptimization for **R**einforcement **L**earning), a novel framework that employs a computationally efficient single-pass uncertainty estimation technique to identify informative training instances. This method, requiring only a single forward pass and obviating the need for iterative next-token computation, achieves a significant acceleration (up to 185$\times$) in data evaluation compared to multi-sampling approaches. UFO-RL leverages this efficient metric to select data within the model's estimated ZPD for training. Extensive experimentation across diverse LLMs and mathematical benchmarks demonstrates that training with a mere 10\% of the data, carefully selected by UFO-RL, yields performance comparable to or even surpassing that of full-data training. Furthermore, this targeted data selection results in up to a 16$\times$ reduction in overall training time, concurrently enhancing training stability and improving generalization capabilities. Thus, UFO-RL presents a practical and highly efficient strategy for scaling RL fine-tuning of LLMs by focusing learning efforts on the most informative and valuable data, thereby mitigating the computational bottlenecks associated with traditional RL training. Yang Zhao 0023, Kai Xiong 0002, Yangou Ouyang, Zhouhao Sun, Jiannan Guan, Bing Qin 0001, Ting Liu 0001 |
NeurIPS | 5 |