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

Jue Chen 0003

dblp:148/6527-3 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0003-2075-4283ORCID · conflict

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

Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 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.

Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 67% Debugging and program repair · 33%
Artificial intelligence
2 papers
Language models and text generation · 56% Reinforcement learning · 44%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › reinforcement learning for NLP
reinforcement learning for language models
1.012026
RL-PLUS: Countering Capability Boundary Collapse of LLMs in Reinforcement Learning with Hybrid-policy Optimization · ACL (1) 2026
Debugging and program repair
automated program repair
0.912025
Thinking Longer, Not Larger: Enhancing Software Engineering Agents via Scaling Test-Time Compute · ASE 2025
Program synthesis and code generation
code generation with language models
0.912025
Thinking Longer, Not Larger: Enhancing Software Engineering Agents via Scaling Test-Time Compute · ASE 2025
Program synthesis and code generation › code generation with language models
software engineering agents
0.912025
Thinking Longer, Not Larger: Enhancing Software Engineering Agents via Scaling Test-Time Compute · ASE 2025
Natural language and speech › Language models and text generation
test-time scaling
0.312025
Thinking Longer, Not Larger: Enhancing Software Engineering Agents via Scaling Test-Time Compute · ASE 2025

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

test-time compute scaling · 1.7reward model · 1.7rejection sampling · 1.7execution verification · 1.7hybrid policy optimization · 1.0
YearPublicationVenuePosition
2026 RL-PLUS: Countering Capability Boundary Collapse of LLMs in Reinforcement Learning with Hybrid-policy Optimization
abstract
Yihong Dong, Xue Jiang, Yongding Tao, Huanyu Liu, Kechi Zhang, Lili Mou, Rongyu Cao, Yingwei MA, Jue Chen, Binhua Li, Zhi Jin, Fei Huang, Yongbin Li, Ge Li. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Yihong Dong, Yongding Tao, Huanyu Liu 0001, Kechi Zhang, Lili Mou, Rongyu Cao, Yingwei Ma, Jue Chen 0003, Binhua Li, Zhi Jin 0001, Fei Huang 0002, Yongbin Li 0001, Ge Li 0001
ACL (1)9
2025 Thinking Longer, Not Larger: Enhancing Software Engineering Agents via Scaling Test-Time Compute
abstract
Recent advancements in software engineering agents have demonstrated promising capabilities in automating program improvements. However, their reliance on closed-source or resource-intensive models introduces significant deployment challenges in private environments, prompting a critical question: How can personally deployable open-source LLMs (e.g., 32B models running on a single GPU) achieve comparable code reasoning performanceƒ To this end, we propose a unified Test-Time Compute (TTC) scaling framework that leverages increased inference-time computation instead of larger models. Our framework incorporates two complementary strategies: internal TTC and external TTC. Internally, we introduce a development-contextualized trajectory synthesis method leveraging real-world software repositories to bootstrap multi-stage reasoning processes, such as fault localization and patch generation. We further enhance trajectory quality through rejection sampling, rigorously evaluating trajectories along accuracy and complexity. Externally, we propose a novel development-process-based search strategy guided by reward models and execution verification. This approach enables targeted computational allocation at critical development decision points, overcoming limitations of existing "end-point only" verification methods.Evaluations on SWE-bench Verified demonstrate our 32B model achieves a 46% issue resolution rate, surpassing significantly larger models such as DeepSeek R1 671B and OpenAI o1. Additionally, we provide the empirical validation of the test-time scaling phenomenon within SWE agents, revealing that models dynamically allocate more tokens to increasingly challenging problems, effectively enhancing reasoning capabilities. We publicly release all training data, models, and code to facilitate future research.1. In fact, our method has been deployed in Tongyi Lingma, an IDE-based coding assistant developed by Alibaba Cloud, where it helps developers solve real-world programming problems.
Yingwei Ma, Yongbin Li 0001, Yihong Dong, Yanhao Li, Rongyu Cao, Jue Chen 0003, Fei Huang 0002, Binhua Li
ASE8