Papers by Guoxin Chen
DecoupleSearch: Decouple Planning and Search via Hierarchical Reward Modeling (2025.emnlp-main)
Copied to clipboard
Hao Sun, Zile Qiao, Bo Wang, Guoxin Chen, Yingyan Hou, Yong Jiang, Pengjun Xie, Fei Huang, Yan Zhang
| Challenge: | Retrieval-Augmented Generation (RAG) systems have emerged as a pivotal methodology for enhancing Large Language Models (LLMs). |
| Approach: | They propose a framework that decouples planning and search processes using dual value models, enabling independent optimization of plan reasoning and search grounding. |
| Outcome: | The proposed framework decouples planning and search processes using dual value models, enabling independent optimization of plan reasoning and search grounding. |
Beyond Query Memorization: Large Language Model Routing with Query Decomposition and Historical Matching (2026.acl-long)
Copied to clipboard
Bo Lv, Jingbo Sun, Jianwei Lv, Chen Tang, Shaojie Zhang, Nayu Liu, Guoxin Yu, Zihao Li, Qichao Zhang, Dongbin Zhao, Ping Luo, Yue Yu
| Challenge: | Existing routing methods rely on direct mapping from queries to models based on surface-level features, leading to poor generalizability on out-of-distribution data. |
| Approach: | They propose a new routing framework that recasts the routing task as a matching process of sifting similar queries from historical logs. |
| Outcome: | The proposed framework improves matching accuracy while lowering inference costs . it decouples linguistic surface forms from task-intrinsic requirements . |
MPrompt: Exploring Multi-level Prompt Tuning for Machine Reading Comprehension (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing soft prompt methods focus on designing the input-independent prompts that steer the model to fit the domain of the new dataset. |
| Approach: | They propose a multi-level prompt tuning method that utilizes prompts at task-specific, domain-specific and context-specific levels to enhance the comprehension of input semantics. |
| Outcome: | The proposed method improves on 12 benchmarks on various QA formats and achieves an average improvement of 1.94% over the state-of-the-art methods. |
From Data-Centric to Sample-Centric: Enhancing LLM Reasoning via Progressive Optimization (2026.acl-long)
Copied to clipboard
| Challenge: | Reinforcement learning with verifiable rewards (RLVR) has recently advanced the reasoning capabilities of large language models (LLMs). |
| Approach: | They propose a method that incorporates partial solution prefixes from expert demonstrations to guide the policy. |
| Outcome: | The proposed methods outperform strong baselines, yielding faster convergence and a higher performance ceiling. |
SEER: Facilitating Structured Reasoning and Explanation via Reinforcement Learning (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods focus on single-step reasoning, ignoring logical dependencies between steps. |
| Approach: | They propose a method that maximizes a structure-based return to facilitate structured reasoning and explanation. |
| Outcome: | The proposed method outperforms state-of-the-art methods on EntailmentBank and STREET benchmarks. |
Table-Critic: A Multi-Agent Framework for Collaborative Criticism and Refinement in Table Reasoning (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to decompose large language models (LLMs) lack effective mechanisms to identify and correct errors in intermediate reasoning steps, leading to cascading error propagation. |
| Approach: | They propose a multi-agent framework that facilitates collaborative criticism and iterative refinement of the reasoning process until convergence to correct solutions. |
| Outcome: | The proposed framework achieves superior accuracy and error correction rates while maintaining computational efficiency and lower solution degradation rate. |
Step-level Value Preference Optimization for Mathematical Reasoning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for generating preference-level annotations do not capture the fine-grained quality of model outputs in multi-step reasoning tasks. |
| Approach: | They propose an algorithm to automatically annotate step-level preferences for multi-step reasoning using Monte Carlo Tree Search. |
| Outcome: | The proposed algorithm achieves state-of-the-art performance on in-domain and out-of domain mathematical reasoning benchmarks. |
EFSA: Towards Event-Level Financial Sentiment Analysis (2024.acl-long)
Copied to clipboard
| Challenge: | a large-scale Chinese dataset contains 12,160 news articles and 13,725 quintuples . a four-hop Chain-of-Thought LLM-based approach is devised for this task . |
| Approach: | They propose to extend financial sentiment analysis to event-level since events usually serve as the subject of the sentiment in financial text. |
| Outcome: | The proposed method can reach the current state-of-the-art on a large-scale Chinese dataset. |