Papers by Mingjie Zhang
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. |
Towards Boosting LLMs-driven Relevance Modeling with Progressive Retrieved Behavior-augmented Prompting (2025.coling-industry)
Copied to clipboard
| Challenge: | Existing approaches to relevance modeling have lacked generalization and accuracy . recent studies have focused on capturing the semantic relationships between queries and items . |
| Approach: | They propose a framework that integrates world knowledge stored in LLMs with specialized domain knowledge represented by user behavior data for promising performance. |
| Outcome: | The proposed framework can handle full-scale search traffics of Alipay with acceptable cost and latency. |
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. |
Reconstruct Before Summarize: An Efficient Two-Step Framework for Condensing and Summarizing Meeting Transcripts (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to meeting summarization are limited due to noise, lengthy transcripts, and scattered salient information. |
| Approach: | They propose a two-step framework for meeting summarization that leverages a self-supervised paradigm to reconstruct transcripts and a relative positional bucketing algorithm to equip models to generate the summary. |
| Outcome: | The proposed method significantly reduces memory consumption and processing time on two meeting summarization datasets. |
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. |
Tuning Less, Prompting More: In-Context Preference Learning Pipeline for Natural Language Transformation (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to natural language transformation (NLT) tasks face significant challenges, such as the computational costs of leveraging large pre-trained models and the limited generalization ability of fine-tuned smaller models. |
| Approach: | They propose a framework that combines prompting with fine-tuning to enhance smaller models by integrating In-Context Examples from retrieval. |
| Outcome: | The proposed framework outperforms existing methods across MT and TST tasks. |
LeLoRA: Learnable Low-Rank Adaptation of Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to fine-tuning large language models (LLMs) rely on manually specified and fixed hyperparameters, resulting in suboptimal performance and low parameter efficiency. |
| Approach: | They propose a framework that allows for dynamically learned adaptive adaptation strategies to be used to fine-tune large language models. |
| Outcome: | The proposed framework outperforms baselines in adapting large language models. |
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. |