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

Kaiyuan Chen 0002

dblp:118/1401-2 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2026
—ORCID · unresolved

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

Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 · 61% Efficient and distributed learning · 30% Language models and text generation · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › reinforcement learning from human feedback
process reward model
1.012026
SAPO: Self-Adaptive Process Optimization Makes Small Reasoners Stronger · AAAI 2026
Machine learning › Reinforcement learning
self-evolution
1.012026
SAPO: Self-Adaptive Process Optimization Makes Small Reasoners Stronger · AAAI 2026
Machine learning › Efficient and distributed learning › model compression › lightweight neural network
small language models
1.012026
SAPO: Self-Adaptive Process Optimization Makes Small Reasoners Stronger · AAAI 2026
Natural language and speech › Language models and text generation
mathematical reasoning
0.312026
SAPO: Self-Adaptive Process Optimization Makes Small Reasoners Stronger · AAAI 2026

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

process supervision · 1.0monte carlo estimation · 1.0
YearPublicationVenuePosition
2026 SAPO: Self-Adaptive Process Optimization Makes Small Reasoners Stronger
abstract
Existing self-evolution methods overlook the influence of fine-grained reasoning steps, which leads to the reasoner-verifier gap. The computational inefficiency of Monte Carlo (MC) process supervision further exacerbates the difficulty in mitigating the gap. Motivated by the Error-Related Negativity (ERN), which the reasoner can localize error following incorrect decisions, guiding rapid adjustments, we propose a Self-Adaptive Process Optimization (SAPO) method for self-improvement in Small Language Models (SLMs). SAPO adaptively and efficiently introduces process supervision signals by actively minimizing the reasoner-verifier gap rather than relying on inefficient MC estimations. Extensive experiments demonstrate that the proposed method outperforms most existing self-evolution methods on two challenging task types: mathematics and code. Additionally, to further investigate SAPO's impact on verifier performance, this work introduces two new benchmarks for process reward models in both mathematical and coding tasks.
Kaiyuan Chen 0002, Guangmin Zheng 0001, Jin Wang 0008, Xiaobing Zhou, Xuejie Zhang 0002
AAAI1
2025 Learning to Reason via Self-Iterative Process Feedback for Small Language Models
abstract
Small language models (SLMs) are more efficient, cost-effective, and customizable than large language models (LLMs), though they often underperform in specific areas like reasoning. Past methods for enhancing SLMs’ reasoning, such as supervised fine-tuning and distillation, often depend on costly external signals, resulting in SLMs being overly confident with limited supervision signals, thus limiting their abilities. Therefore, this study enables SLMs to learn to reason from self-iterative feedback. By combining odds ratio preference optimization (ORPO), we fine-tune and align SLMs using positive and negative signals generated by themselves. Additionally, we introduce process supervision for rewards in preference alignment by sampling-based inference simulation and process reward models. Compared to Supervised Fine-Tuning (SFT), our method improves the performance of Gemma-2B by 12.43 (Acc) on GSM8K and 3.95 (Pass@1) on MBPP. Furthermore, the proposed method also demonstrated superior out-of-domain generalization capabilities on MMLU_Math and HumanEval.
Kaiyuan Chen 0002, Jin Wang 0008, Xuejie Zhang 0002
COLING1
2024 Mathematical Reasoning via Multi-step Self Questioning and Answering for Small Language Models
Kaiyuan Chen 0002, Jin Wang 0008, Xuejie Zhang 0002
NLPCC (4)1