Papers by Lun Du
LightThinker: Thinking Step-by-Step Compression (2025.emnlp-main)
Copied to clipboard
Jintian Zhang, Yuqi Zhu, Mengshu Sun, Yujie Luo, Shuofei Qiao, Lun Du, Da Zheng, Huajun Chen, Ningyu Zhang
| Challenge: | Recent advances in Large Language Models have demonstrated their remarkable capabilities in complex reasoning tasks, but their efficiency is hindered by the substantial memory and computational costs associated with generating lengthy tokens. |
| Approach: | They propose a method that dynamically compresses verbose thought steps into compact representations and discards original reasoning chains. |
| Outcome: | The proposed method reduces peak memory usage and inference time while maintaining competitive accuracy. |
What Makes AI Research Replicable? Executable Knowledge Graphs as Scientific Knowledge Representations (2026.acl-short)
Copied to clipboard
Yujie Luo, Zhuoyun Yu, Xuehai Wang, Yuqi Zhu, Ningyu Zhang, Lanning Wei, Lun Du, Da Zheng, Huajun Chen
| Challenge: | Existing approaches to replicate AI research are limited by insufficient background knowledge and the limitations of retrieval-augmented generation methods. |
| Approach: | They propose a pluggable, paper-centric knowledge base that integrates code snippets and technical insights extracted from scientific literature into a verifiable, executable representation. |
| Outcome: | The proposed knowledge base shows significant performance gains on paperBench when integrated into three agent frameworks with two different LLMs. |
StructMem: Structured Memory for Long-Horizon Behavior in LLMs (2026.acl-short)
Copied to clipboard
| Challenge: | Existing memory systems lack structure and efficiency in capturing relationships between events. |
| Approach: | They propose a structure-enriched hierarchical memory framework that preserves event-level bindings and induces cross-event connections. |
| Outcome: | The proposed framework preserves event-level bindings and induces cross-event connections while reducing token usage, API calls, and runtime compared to prior memory systems. |
Can We Predict Before Executing Machine Learning Agents? (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to scientific discovery rely on expensive physical execution . a Generate-Execute-Feedback paradigm is costly and slow . |
| Approach: | They propose to internalize execution priors to substitute costly runtime checks with instantaneous predictive reasoning, drawing inspiration from World Models. |
| Outcome: | The proposed framework achieves 61.5% accuracy and robust confidence calibration when primed with a Verified Data Analysis Report. |
RACE: Retrieval-augmented Commit Message Generation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to automatically generate commit messages are repetitive or redundant. |
| Approach: | They propose a retrieval-augmented neural commit message generation method which treats the retrieved similar commit as an exemplar and leverages it to generate an accurate commit message. |
| Outcome: | The proposed method outperforms baselines on a large dataset with five programming languages and can boost existing Seq2Seq models in commit message generation. |
Retrieval-Augmented Language Models are Mimetic Theorem Provers (2025.findings-emnlp)
Copied to clipboard
Wenjie Yang, Ruiyuan Huang, Jiaxing Guo, Zicheng Lyu, Tongshan Xu, Shengzhong Zhang, Lun Du, Da Zheng, Zengfeng Huang
| Challenge: | Large language models often fail to provide rigorous proof-based reasoning for research-level mathematics. |
| Approach: | They propose a simple yet effective RAG framework that augments retrieved proofs with queries and document contexts to improve retrieval performance. |
| Outcome: | The proposed framework improves retrieval performance by 34.19% . dual RAG can be used to prove research-level theorems in theoretical machine learning . |
CAST: Enhancing Code Summarization with Hierarchical Splitting and Reconstruction of Abstract Syntax Trees (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for code summarization do not capture rich information in ASTs . existing methods are labor-intensive and time-consuming to document code with good summaries manually. |
| Approach: | They propose a model that hierarchically splits and reconstructs ASTs by a neural network . they propose to use AST embeddings and a vanilla code token encoder to generate the model . |
| Outcome: | The proposed model splits and reconstructs ASTs into subtrees and then aggregates embeddings of subtreas to get the complete AST. |
Tackling Long Code Search with Splitting, Encoding, and Aggregating (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing pretraining models take the first 256 tokens of code snippets by default, limiting the input length to 512. |
| Approach: | They propose a baseline SEA model which splits long code into code blocks and aggregates them to obtain a comprehensive long code representation. |
| Outcome: | The proposed model can model long code without changing their internal structure and re-pretraining. |
Accelerating Code Search with Deep Hashing and Code Classification (2022.acl-long)
Copied to clipboard
| Challenge: | Code search is to search reusable code snippets from source code corpus based on natural languages queries. |
| Approach: | They propose a method to accelerate code search with deep hashing and code classification by using deep hashes and code hash. |
| Outcome: | The proposed method can save 90% of retrieval time while preserving at least 99% of retrievals accuracy. |
TAP4LLM: Table Provider on Sampling, Augmenting, and Packing Semi-structured Data for Large Language Model Reasoning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing solutions for table reasoning tasks are mainly tested on small tables and face scalability issues and struggle with complex queries due to incomplete or dispersed data across different table sections. |
| Approach: | They propose a table reasoning pre-processor suite that can be used to leverage large language models (LLMs) in table-based tasks. |
| Outcome: | The proposed method improves LLMs’ reasoning capabilities in various tabular tasks and enhances interaction between LLM and tabular data by employing effective pre-processing. |