Papers by Mingjie Li
MathGenie: Generating Synthetic Data with Question Back-translation for Enhancing Mathematical Reasoning of LLMs (2024.acl-long)
Copied to clipboard
| Challenge: | Existing models have demonstrated outstanding capabilities in mathematical reasoning, but there is a performance gap between open-source models and closed-source ones. |
| Approach: | They propose a method for generating diverse and reliable math problems by leveraging the ground-truth solutions of the seed data. |
| Outcome: | The proposed model outperforms open-source models across five representative mathematical reasoning datasets. |
Retrieval and Reasoning on KGs: Integrate Knowledge Graphs into Large Language Models for Complex Question Answering (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have performed impressively in various NLP tasks, but their inherent hallucination phenomena severely challenge their credibility in complex reasoning. |
| Approach: | They propose to integrate explainable Knowledge Graphs (KGs) with LLMs to alleviate hallucinations . they construct subgraphs to enhance the retrieval capabilities of KGs via CoT reasoning. |
| Outcome: | Extensive experiments on two KGQA datasets show that the proposed model achieves convincing performance compared to strong baselines. |
LoopCoder: Scaling Code Intelligence via Looped Language Models (2026.findings-acl)
Copied to clipboard
Jian Yang, Wei Zhang, Shuyue Guo, Yizhi LI, Linzheng Chai, Zhengmao Ye, Shukai Liu, Yuyang Song, Jiajun Wu, Che Liu, Tianyu Zheng, Siwei Wu, Leo L, Xudong Ma, Chuan Hao, Ran Tao, Yan Xing, Jianzhou Wang, Mingjie Tang, Aishan Liu, Zhoujun Li, Xianglong Liu, Weifeng Lv, Bryan Dai
| Challenge: | Large language models have mastered syntax-level code generation, but complex algorithmic reasoning remains a challenge. |
| Approach: | They propose a recurrent inductive bias that aligns with the recursive nature of programming logic. |
| Outcome: | The proposed model achieves comparable performance to standard dense models with more parameters. |
MathCoder-VL: Bridging Vision and Code for Enhanced Multimodal Mathematical Reasoning (2025.findings-acl)
Copied to clipboard
Ke Wang, Junting Pan, Linda Wei, Aojun Zhou, Weikang Shi, Zimu Lu, Han Xiao, Yunqiao Yang, Houxing Ren, Mingjie Zhan, Hongsheng Li
| Challenge: | Large Language Models (LMMs) struggle with simple tasks such as geometry, e.g., arithmetic, and reasoning. |
| Approach: | They propose to leverage code as supervision for cross-modal alignment . they propose to use FigCodifier and ImgCode-8.6M to synthesize novel mathematical figures . |
| Outcome: | The proposed model surpasses GPT-4o and Claude 3.5 Sonnet in the geometry problem-solving subset of MathVista, achieving improvements of 8.9% and 9.2%. |
Empowering Character-level Text Infilling by Eliminating Sub-Tokens (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for character-level infilling relied on predicting sub-tokens, but this strategy was ineffective. |
| Approach: | They propose a method to fill-in-the-mid with Starting and Ending character constraints that avoids predicting sub-tokens in inference. |
| Outcome: | The proposed method surpasses existing methods and offers significant performance gains. |
ReflectionCoder: Learning from Reflection Sequence for Enhanced One-off Code Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods to enhance code generation performance include integrating compiler feedback. |
| Approach: | They propose a method that integrates compiler feedback to improve one-off code generation performance. |
| Outcome: | The proposed method improves one-off code generation performance on three benchmarks and can be applied to other domains that focus on final results and require long reasoning paths. |
Probability-Consistent Preference Optimization for Enhanced LLM Reasoning (2025.findings-acl)
Copied to clipboard
Yunqiao Yang, Houxing Ren, Zimu Lu, Ke Wang, Weikang Shi, Aojun Zhou, Junting Pan, Mingjie Zhan, Hongsheng Li
| Challenge: | Recent advances in preference optimization have demonstrated significant potential for improving mathematical reasoning capabilities in large language models. |
| Approach: | They propose a framework that establishes two quantitative metrics for preference selection: surface-level answer correctness and intrinsic token-level probability consistency. |
| Outcome: | The proposed framework outperforms existing outcome-only criterion approaches across a diverse range of LLMs and benchmarks. |
AnaMeta: A Table Understanding Dataset of Field Metadata Knowledge Shared by Multi-dimensional Data Analysis Tasks (2023.findings-acl)
Copied to clipboard
Xinyi He, Mengyu Zhou, Mingjie Zhou, Jialiang Xu, Xiao Lv, Tianle Li, Yijia Shao, Shi Han, Zejian Yuan, Dongmei Zhang
| Challenge: | Tabular data analysis is performed everyday across various domains. |
| Approach: | They propose to use a dataset of 467k tables with supervision labels for four types of field metadata. |
| Outcome: | The proposed framework improves the understanding capability of tabular models by incorporating distribution and knowledge information. |
Alignment with Fill-In-the-Middle for Enhancing Code Generation (2025.emnlp-main)
Copied to clipboard
Houxing Ren, Zimu Lu, Weikang Shi, Haotian Hou, Yunqiao Yang, Ke Wang, Aojun Zhou, Junting Pan, Mingjie Zhan, Hongsheng Li
| Challenge: | Existing methods for generating test cases with limited training data are not reliable and may be counterproductive. |
| Approach: | They propose a method that splits code snippets into smaller, granular blocks, creating more diverse DPO pairs from the same test cases. |
| Outcome: | The proposed approach shows significant improvements in code generation tasks on benchmark datasets such as HumanEval (+), MBPP (+), and APPS. |
Towards Robust Real-World Spreadsheet Understanding with Multi-Agent Multi-Format Reasoning (2026.acl-long)
Copied to clipboard
| Challenge: | Spreadsheets are among the most widely used data formats in real-world applications . existing large language models treat tables as plain text, overlooking layout cues and visual semantics. |
| Approach: | They propose a two-stage multi-agent framework for spreadsheet understanding that adopts a step-by-step reading and reasoning paradigm. |
| Outcome: | Extensive experiments on two spreadsheet datasets show the proposed framework outperforms existing methods on Spreadsheet Bench. |
Pruning Unsafe Tickets: A Resource-Efficient Framework for Safer and More Robust LLMs (2026.acl-long)
Copied to clipboard
| Challenge: | Empirical evaluations on ML models show substantial reductions in unsafe generations and improved robustness against jailbreak attacks. |
| Approach: | They propose a resource-efficient pruning framework that directly identifies unsafe behaviors while preserving model utility. |
| Outcome: | The proposed framework reduces unsafe generations and improves robustness against jailbreak attacks with minimal utility loss. |
Reward Yourself: Efficient Self Rewards for Trustworthy Sampling (2026.findings-acl)
Copied to clipboard
| Challenge: | Retraining reward models to address privacy leaks and stereotypes is expensive . recent advances in large language models have led to improvements in understanding . |
| Approach: | They propose a lightweight intrinsic reward that can be used to prune existing LLMs to approximate an "untrust" and an ""untrust "" token distribution. |
| Outcome: | Experiments with two reward models and four LLMs show that selfRW improves trustworthiness with minimal impact on general utility benchmarks. |