Jinxin Shi
Author directory2026
DualResearch: Entropy-Gated Dual-Graph Retrieval for Answer Reconstruction in Deep Research Agents
Jinxin Shi | Zongsheng Cao | Runmin Ma | Yusong Hu | Jie Zhou | Yue Fan | Xin Li | Lei Bai | Liang He | Bo Zhang
Findings of the Association for Computational Linguistics: EMNLP 2026
Jinxin Shi | Zongsheng Cao | Runmin Ma | Yusong Hu | Jie Zhou | Yue Fan | Xin Li | Lei Bai | Liang He | Bo Zhang
Findings of the Association for Computational Linguistics: EMNLP 2026
Deep Research Agents (DR-Agents) extend LLMs with multi-step retrieval, tool use, and intermediate computation to solve complex problems. However, their execution logs often contain redundant context, noisy evidence, and brittle dependencies among intermediate decisions. As a result, final answers can be sensitive to irrelevant or weakly verified information. We propose DualResearch, a log-based post-processing framework for answer reconstruction. Given a query and a completed DR-Agent log, DualResearch normalizes the log into event records and constructs two evidence graphs: a breadth semantic graph for declarative evidence and a depth causal graph for procedural provenance. It then retrieves breadth nodes and depth paths, assigns higher weights to retrieval channels with more concentrated retained candidate distributions, and jointly considers relevance and cross-view agreement to select evidence for reconstruction; the concentration measure reflects retrieval confidence rather than factual correctness. Experiments on HLE, GAIA, and GPQA show consistent accuracy improvements over underlying DR-Agents and controlled log-reuse baselines.
ERR+: Sequential Entropy Resolution for Efficient and Decisive LLM Reasoning
Xin Jiang | Minhao Wang | Wen Wu | Zhentao Xie | Shangheng Du | Jinxin Shi | Jiabao Zhao | Liang He | Weicong Chen
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Xin Jiang | Minhao Wang | Wen Wu | Zhentao Xie | Shangheng Du | Jinxin Shi | Jiabao Zhao | Liang He | Weicong Chen
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Large reasoning models achieve strong performance on complex tasks by generating extended chain-of-thought (CoT) traces via reinforcement learning with verifiable rewards (RLVR). While current RLVR methods have achieved strong results with correctness-based reward signals, they provide limited guidance on the quality of the reasoning process itself, leaving the internal reasoning structure largely unoptimized. Through empirical analysis across multiple model families, we identify a consistent pattern: correct reasoning traces exhibit more frequent and larger token-level entropy drops within the thinking phase than incorrect ones. We propose ERR+, a two-phase RLVR framework grounded in this observation. The first phase trains with the Entropy Relief Reward (ERR), a bonus proportional to cumulative token-level entropy drops in the thinking phase, log-normalized by response length. Unlike prior methods that suppress entropy, ERR rewards the resolution of uncertainty while leaving exploratory high-entropy states unconstrained. The second phase introduces the Robust Relative Efficiency Reward, which scores each response’s length against co-generated peers via a tanh-transformed within-group z-score. We provide a formal analysis showing that joint optimization of the two objectives induces gradient conflict in early training, motivating the sequential design (Theorem 1). Experiments on five datasets demonstrate consistent improvements in both accuracy and response conciseness across model backbones.Our code is available at https://github.com/XrkArul/err_response.
FlowSearch: Advancing Deep Research with Dynamic Structured Knowledge Flow
Yusong Hu | Runmin Ma | Yue Fan | Jinxin Shi | Zongsheng Cao | Yuhao Zhou | Jiakang Yuan | Shuaiyu Zhang | Shiyang Feng | Xiangchao Yan | Shufei Zhang | Wenlong Zhang | Lei Bai | Bo Zhang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Yusong Hu | Runmin Ma | Yue Fan | Jinxin Shi | Zongsheng Cao | Yuhao Zhou | Jiakang Yuan | Shuaiyu Zhang | Shiyang Feng | Xiangchao Yan | Shufei Zhang | Wenlong Zhang | Lei Bai | Bo Zhang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Deep research is an inherently challenging task that demands both breadth and depth of thinking. It involves navigating diverse knowledge spaces and reasoning over complex, multi-step dependencies, which presents substantial challenges for agentic systems. To address this, we propose FlowSearch, a multi-agent framework that actively constructs and evolves a dynamic structured knowledge flow to drive subtask execution and reasoning. FlowSearch is capable of strategically planning and expanding the knowledge flow to enable parallel exploration and hierarchical task decomposition, while also adjusting the knowledge flow in real time based on feedback from intermediate reasoning outcomes and insights. FlowSearch achieves competitive performance on both general and scientific benchmarks, including GAIA, HLE, GPQA and TRQA, demonstrating its effectiveness in multi-disciplinary research scenarios and its potential to advance scientific discovery. The code will be available.
2025
RMoA: Optimizing Mixture-of-Agents through Diversity Maximization and Residual Compensation
Zhentao Xie | Chengcheng Han | Jinxin Shi | Wenjun Cui | Xin Zhao | Xingjiao Wu | Jiabao Zhao
Findings of the Association for Computational Linguistics: ACL 2025
Zhentao Xie | Chengcheng Han | Jinxin Shi | Wenjun Cui | Xin Zhao | Xingjiao Wu | Jiabao Zhao
Findings of the Association for Computational Linguistics: ACL 2025
Although multi-agent systems based on large language models show strong capabilities on multiple tasks, they are still limited by high computational overhead, information loss, and robustness. Inspired by ResNet’s residual learning, we propose Residual Mixture-of-Agents (RMoA), integrating residual connections to optimize efficiency and reliability. To maximize information utilization from model responses while minimizing computational costs, we innovatively design an embedding-based diversity selection mechanism that greedily selects responses via vector similarity. Furthermore, to mitigate iterative information degradation, we introduce a Residual Extraction Agent to preserve cross-layer incremental information by capturing inter-layer response differences, coupled with a Residual Aggregation Agent for hierarchical information integration. Additionally, we propose an adaptive termination mechanism that dynamically halts processing based on residual convergence, further improving inference efficiency. RMoA achieves state-of-the-art performance on the benchmarks of across alignment, mathematical reasoning, code generation, and multitasking understanding, while significantly reducing computational overhead. Code is available at https://github.com/mindhunter01/RMoA.