Papers by Chengyuan Yao

4 papers
PaCoRe: Learning to Scale Test-Time Compute with Parallel Coordinated Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Parallel Coordinated Reasoning (PaCoRe) overcomes a central limitation of contemporary language models: their inability to scale test-time compute (TTC) far beyond sequential reasoning under a fixed context window.
Approach: They propose a training-and-inference framework to overcome a central limitation of language models: their inability to scale test-time compute (TTC) under a fixed context window.
Outcome: The proposed model scales to multi-million-token effective TTC without exceeding context limits.
KEPLET: Knowledge-Enhanced Pretrained Language Model with Topic Entity Awareness (2023.findings-emnlp)

Copied to clipboard

Challenge: Pre-trained language models (PLMs) have shown their superiority by pre-training on unstructured text corpus and then fine-tuning on downstream tasks.
Approach: They propose a Knowledge-Enhanced Pre-trained LanguagE model with Topic entity awareness that incorporates the interactions between tokens and mentioned entities in pre-training.
Outcome: The proposed model incorporates the interactions between tokens and mentioned entities in pre-training and is more effective on entity-centric tasks.
PRIME: A Process-Outcome Alignment Benchmark for Verifiable Reasoning in Mathematics and Engineering (2026.acl-long)

Copied to clipboard

Challenge: Current outcome-centric verification paradigms neglect potential errors in the derivation process.
Approach: They propose a process-aware RLVR training paradigm utilizing verifiers selected via **PRIME**.
Outcome: The proposed approach outperforms the baseline verification paradigm on AIME24, AIME25, and Beyond-AIME models.
SLIM: Subtrajectory-Level Elimination for More Effective Reasoning (2025.findings-emnlp)

Copied to clipboard

Challenge: Notable examples include OpenAI’s o1/o3/o4 series and DeepSeek-R1 .
Approach: They develop a framework to identify suboptimal subtrajectories based on human-established criteria . they also use a sampling algorithm to select data whose reasoning process is free from suboptimally subtravertories to the highest degree .
Outcome: The proposed method reduces the number of suboptimal subtrajectories by 25.9% during the inference process.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations