Papers by Shufei Li
Biology-Instructions: A Dataset and Benchmark for Multi-Omics Sequence Understanding Capability of Large Language Models (2025.findings-emnlp)
Copied to clipboard
Haonan He, Yuchen Ren, Yining Tang, Ziyang Xu, Junxian Li, Minghao Yang, Di Zhang, Yuan Dong, Tao Chen, Shufei Zhang, Yuqiang Li, Nanqing Dong, Wanli Ouyang, Dongzhan Zhou, Peng Ye
| Challenge: | Biology-Instructions is the first large-scale instruction-tuning dataset for multi-omics biological sequences. |
| Approach: | They propose a large-scale instruction-tuning dataset for multi-omics biological sequences . they propose 'chatMultiOmics' to overcome limitations of current LLMs on multi-ome tasks . |
| Outcome: | The proposed dataset bridges LLMs and complex biological sequence-related tasks while maintaining conversational fluency. |
Boosting Text-to-SQL through Multi-grained Error Identification (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods for error identification often overlook validation of generated results . text-to-SQL is a technology that converts natural language questions into executable SQL queries . |
| Approach: | They propose to integrate a multi-grained error identification method into existing methods to detect SQL errors. |
| Outcome: | The proposed method can be integrated as a plugin into various methods, providing effective error identification and correction capabilities. |
LLaMA-Berry: Pairwise Optimization for Olympiad-level Mathematical Reasoning via O1-like Monte Carlo Tree Search (2025.naacl-long)
Copied to clipboard
Di Zhang, Jianbo Wu, Jingdi Lei, Tong Che, Jiatong Li, Tong Xie, Xiaoshui Huang, Shufei Zhang, Marco Pavone, Yuqiang Li, Wanli Ouyang, Dongzhan Zhou
| Challenge: | LLaMA-Berry is an advanced mathematical reasoning framework to enhance the problem-solving ability of large language models (LLMs). |
| Approach: | They propose a Monte Carlo Tree Search and Self-Refine framework to optimize reasoning paths and a pairwise reward model to evaluate different paths globally. |
| Outcome: | The proposed framework overcomes inefficiencies and limitations of step-wise and greedy search algorithms, enabling more efficient exploration of solution spaces. |