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

Tianchu Yao

dblp:398/4416 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0008-8236-7653ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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 · 56% Language models and text generation · 44%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
large language model reasoning
1.012026
AURORA: Automated Training Framework of Universal Process Reward Models via Ensemble Prompting and Reverse Verification · KDD (1) 2026
Machine learning › Reinforcement learning › reinforcement learning from human feedback
process reward model
1.012026
AURORA: Automated Training Framework of Universal Process Reward Models via Ensemble Prompting and Reverse Verification · KDD (1) 2026
Machine learning › Reinforcement learning › reward learning › reward modeling
reward model evaluation
0.312026
AURORA: Automated Training Framework of Universal Process Reward Models via Ensemble Prompting and Reverse Verification · KDD (1) 2026

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

reverse verification · 1.0ensemble prompting · 1.0chain-of-thought · 1.0
YearPublicationVenuePosition
2026 AURORA: Automated Training Framework of Universal Process Reward Models via Ensemble Prompting and Reverse Verification
abstract
The reasoning capabilities of advanced large language models (LLMs) like o1 have revolutionized artificial intelligence applications. Nevertheless, evaluating and optimizing complex reasoning processes remain significant challenges due to diverse policy distributions and the inherent limitations of human effort and accuracy. In this paper, we present AURORA, a novel automated framework for training universal process reward models (PRMs) using ensemble prompting and reverse verification. The framework employs a two-phase approach: First, it uses diverse prompting strategies and ensemble methods to perform automated annotation and evaluation of processes, ensuring robust assessments for reward learning. Second, it leverages practical reference answers for reverse verification, enhancing the model's ability to validate outputs and improving training accuracy. To assess the framework's performance, we extend beyond the existing ProcessBench benchmark by introducing UniversalBench, which evaluates reward predictions across full trajectories under diverse policy distribtion with long Chain-of-Thought (CoT) outputs. Experimental results demonstrate that AURORA enhances process evaluation accuracy, improves PRMs' accuracy for diverse policy distributions and long-CoT responses.
Xiaoyu Tan, Tianchu Yao, Chao Qu, Bin Li 0091, Dakuan Lu, Haozhe Wang 0002, Yinghui Xu 0001, Xihe Qiu
KDD (1)2