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

Ruifeng She

dblp:325/2739 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 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
2 papers
Language models and text generation · 56% Planning, search and constraint satisfaction · 44%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › large language model reasoning
tree of thought reasoning
0.312025
BPP-Search: Enhancing Tree of Thought Reasoning for Mathematical Modeling Problem Solving · ACL (1) 2025

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

probability bounds · 1.7ensemble planning · 1.7contrastive learning · 1.7tree-of-thoughts · 0.9search · 0.9
YearPublicationVenuePosition
2025 BPP-Search: Enhancing Tree of Thought Reasoning for Mathematical Modeling Problem Solving
abstract
Teng Wang, Wing Yin Yu, Zhenqi He, Zehua Liu, HaileiGong HaileiGong, Han Wu, Xiongwei Han, Wei Shi, Ruifeng She, Fangzhou Zhu, Tao Zhong. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
Wing Yin Yu, Zhenqi He, Zehua Liu, HaileiGong HaileiGong, Han Wu 0004, Xiongwei Han, Ruifeng She, Fangzhou Zhu, Tao Zhong 0004
ACL (1)9
2025 Reasoning Planning for Language Models
abstract
Selecting an appropriate reasoning method for a given query remains a key challenge in language model generation. Existing approaches typically generate multiple candidate responses and use an aggregation strategy to select the output answer, often assuming that more candidate answers yield higher accuracy. We revisit this assumption through a rigorous theoretical analysis, deriving accuracy bounds for standard aggregation methods under fixed generation distributions and candidate sizes. Building on these insights, we introduce EPIC, an Ensemble Planning with Contrastive learning framework to learn a shared representation space that captures both model reasoning abilities and query-method compatibility. EPIC incorporates our probability bounds as a regularizer in a utility-driven optimization that balances accuracy and computational cost. Experiments on diverse mathematical reasoning tasks show that EPIC consistently selects optimal reasoning methods, improving accuracy while reducing computational overhead. Our code can be found at https://github.com/nguyenngocbaocmt02/EPIC.
Ngoc Bao Nguyen, Ruifeng She, Xiaojin Fu
NeurIPS3