Peiyang Liu
Peiyang Liu has 4 papers in our library, in 2026, most of them on Reasoning, Language models & pretraining, Bias, fairness & safety; often with Di Liang, Chao Xue, Chenyao Lu.
OpenAlex · ORCID · h-index 0 · 8 works · 0 citations OpenAlex, 2026-10-14
📄 4 works in our library · 🔗 Cited 16 times in our library · ⭐ Paper Stars ranking: #9175
Affiliations
Fields, topics and concepts
📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Artificial Intelligence · 4 worksComputer Science · 4 worksArts and Humanities · 3 worksLanguage and Linguistics · 3 works
🧭 Topics 3Research subjects and languages the work is about.Reasoning · 2 worksLanguage models & pretraining · 1 workBias, fairness & safety · 1 work
Works by year
2020s
Papers
- Reason Only When Needed: Efficient Generative Reward Modeling via Model-Internal Uncertainty (2026 · 8 citations)
Generative reward models (GRMs) judge LLM outputs using chain-of-thought (CoT) reasoning. They have two weaknesses. They spend reasoning effort on every input, including easy ones. They also pick among sampled reasoning chains by voting, which cannot separate sound chains from ones that only look convincing. The… - Why Supervised Fine-Tuning Fails to Learn: A Systematic Study of Incomplete Learning in Large Language Models (2026 · 6 citations)
Supervised fine-tuning (SFT) is usually treated as a reliable way to specialize LLMs. The authors show, however, that converged models still get part of their own training set wrong. They call this the Incomplete Learning Phenomenon (ILP), distinguish it from catastrophic forgetting and machine unlearning, and… - ToolSafe: Enhancing Tool Invocation Safety of LLM-based agents via Proactive Step-level Guardrail and Feedback (2026 · 3 citations)
LLM agents that call external tools can be steered into harmful actions, either by malicious users or by prompt injections hidden in tool outputs. - Learning from Contrasts: Synthesizing Reasoning Paths from Diverse Search Trajectories (2026 · 1 citation)
Search-based data generation with Monte Carlo Tree Search (MCTS) usually keeps only the best-scoring solution path and throws away the rest.
Co-authors here
- Di Liang ×3
- Chao Xue ×2
- Chenyao Lu ×2
- Haibo Shi ×2
- Lei Jiang ×2
- Mengqiao Liu ×2
- Shuang Liang ×2
- Wei Ye ×2
- Xianjie Wu ×2
- Xingsheng Han ×2
- Yao Wang ×2
- Yu Lu ×2
Venues
- Annual Meeting of the Association for Computational Linguistics (ACL) ×2: ACL 2026 ×2
- Findings of the Association for Computational Linguistics ×2: Findings of the Association for Computational Linguistics 2026 ×2
Cited by
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/authors/peiyang-liu/