Papers by Ye Du

27 papers
CP-BCS: Binary Code Summarization Guided by Control Flow Graph and Pseudo Code (2023.emnlp-main)

Copied to clipboard

Challenge: Current work on understanding assembly code is oriented towards generating function names, which involve numerous abbreviations that make them confusing.
Approach: They propose a control flow graph and pseudo code guided binary code summarization framework to learn the comprehensive binary function execution behavior and logic semantics.
Outcome: The proposed framework improves the efficiency of reverse engineering on 3 different binary optimization levels for 3 different computer architectures.
FinToolSyn: A forward synthesis Framework for Financial Tool-Use Dialogue Data with Dynamic Tool Retrieval (2026.findings-acl)

Copied to clipboard

Challenge: Existing data synthesis methods rely on static tools to generate queries . this approach fails to capture the implicit, event-driven nature of real-world needs .
Approach: They propose a forward synthesis framework to generate high-quality financial dialogues . they construct a repository of 43,066 tools and synthesize over 148k dialogue instances .
Outcome: Experiments show that models trained on FinToolSyn achieve a 21.06% improvement . the framework is designed to generate high-quality financial dialogues .
Weight Distillation: Transferring the Knowledge in Neural Network Parameters (2021.acl-long)

Copied to clipboard

Challenge: Knowledge distillation is an effective method for model acceleration and compression.
Approach: They propose to use parameters to distill knowledge from large neural networks to small ones . they propose to do this by using a parameter generator to transfer the knowledge to a small neural network .
Outcome: The proposed method learns a small network 1.88 2.94x faster than the large network but with competitive BLEU points.
A Simple and Effective Approach to Robust Unsupervised Bilingual Dictionary Induction (2020.coling-main)

Copied to clipboard

Challenge: Recent work has questioned the robustness of unsupervised bilingual dictionary induction methods on distant language pairs.
Approach: They propose an iterative dimension reduction method to bridge this gap . they propose a method that initializes and self-learning and inducing a dictionary .
Outcome: The proposed method achieves 13.64 55.53% accuracy between English and four distant languages.
Coreferential Reasoning Learning for Language Representation (2020.emnlp-main)

Copied to clipboard

Challenge: Existing language representation models cannot explicitly handle coreference, which is essential to the coherent understanding of the whole discourse.
Approach: They propose a language representation model that captures coreferential relations in context.
Outcome: The proposed model can achieve significant improvements on downstream NLP tasks while maintaining comparable performance to baseline models on other common NLP task.
Optimizing User Profiles via Contextual Bandits for Retrieval-Augmented LLM Personalization (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches for personalizing large language models require modifying parameters.
Approach: They propose a lightweight approach to personalizing large language models via retrieval augmentation . relevance serves as an unreliable proxy for utility, they argue .
Outcome: The proposed framework outperforms strong heuristic and retrieval-augmented baselines on nine personalization tasks.
kNN-ICL: Compositional Task-Oriented Parsing Generalization with Nearest Neighbor In-Context Learning (2024.naacl-long)

Copied to clipboard

Challenge: Recent advances in task-oriented parsing involve formulating the task as a sequence-to-sequence problem, relying on a wealth of labeled data.
Approach: They propose a task-oriented parsing framework that integrates nearest-neighbor learning with a nearest-nearest approach.
Outcome: The proposed model can be used to synthesize computer programs based on a natural-language prompt without additional data or specialized prompts.
From Domains to Instances: Dual-Granularity Data Synthesis for LLM Unlearning (2026.findings-acl)

Copied to clipboard

Challenge: Currently, the evaluation of unlearning is limited due to the lack of granularity in the model.
Approach: They propose a framework for synthesizing high-quality forget sets that exploits the target model per se to elicit data that matches its internal knowledge distribution through seed-guided and adversarial prompting.
Outcome: The proposed framework achieves a superior balance of relevance, diversity, and efficiency across benchmarks.
Multi-Agent Collaboration via Cross-Team Orchestration (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have significantly impacted various domains, especially through organized LLM-driven autonomous agents.
Approach: They propose a framework that enables orchestrated teams to jointly propose various task-oriented solutions and interact with their insights in a self-independence while cross-team collaboration environment for superior solutions generation.
Outcome: Experiments show that the framework can generate better software quality compared to state-of-the-art frameworks.
A Fast and High-quality Text-to-Speech Method with Compressed Auxiliary Corpus and Limited Target Speaker Corpus (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods to generate high-quality speech with limited target speaker corpus require extensive training data.
Approach: They propose an auxiliary corpus compression algorithm that reduces the training cost while the naturalness of synthesized speech is not significantly degraded.
Outcome: The proposed method significantly reduces training costs while maintaining the naturalness of synthesized speech.
Context-Fidelity Boosting: Enhancing Faithful Generation through Watermark-Inspired Decoding (2026.findings-acl)

Copied to clipboard

Challenge: Large language models produce content that contradicts or overlooks information provided in the input context, a phenomenon known as faithfulness hallucination.
Approach: They propose a lightweight framework that boosts the generation probability of context-relevant tokens by boosting the generation of tokens.
Outcome: The proposed framework improves faithfulness metrics with minimal generation overhead.
SimVBG: Simulating Individual Values by Backstory Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have strong human-like capabilities, but rarely simulating individualized human values.
Approach: They propose a framework that simulates individual values based on individual backstories . they use structured data on an individual to transform their backstoried information to a backstory .
Outcome: The proposed framework improves top-1 accuracy by more than 10% over retrieval-augmented generation methods.
A DQN-based Approach to Finding Precise Evidences for Fact Verification (2021.acl-long)

Copied to clipboard

Challenge: Existing methods for fact verification do not target the retrieval of precise evidences.
Approach: They propose a DQN-based approach to retrieval of precise evidences . they propose best thresholds for determining the true labels of computed evidences.
Outcome: The proposed method improves accuracy of fact verification by reducing label bias . it can retrieve evidence consisting of the first two sentences, but it can contain unnecessary sentences .
OBLIVIATE: Robust and Practical Machine Unlearning for Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) trained over corpora risk memorizing sensitive, copyrighted, or toxic content.
Approach: They propose a framework that removes targeted data while preserving model utility.
Outcome: The proposed framework resists membership inference attacks, minimizes impact on retained data, and maintains robustness across diverse scenarios.
CodeTool: Enhancing Programmatic Tool Invocation of LLMs via Process Supervision (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to tool invocation are often unnecessarily long and require lengthy reasoning paths.
Approach: They propose a framework for stepwise code generation that improves LLM tool invocation . they incorporate two distinct process rewards: the On-the-spot and the Latent Reward .
Outcome: The proposed framework improves LLM tool invocation by leveraging the concise nature of code.
Tram: A Token-level Retrieval-augmented Mechanism for Source Code Summarization (2024.findings-naacl)

Copied to clipboard

Challenge: Existing methods to generate source code summaries are coarse-grained and noise-filled . however, they do not capture contextual code semantics and are often outdated in continuous software iteration.
Approach: They propose a fine-grained Token-level retrieval-augmented mechanism on the decoder side to enhance performance of neural models.
Outcome: The proposed method produces more low-frequency tokens and is interpretable.
TwinVoice: A Multi-dimensional Benchmark Towards Digital Twins via LLM Persona Simulation (2026.findings-acl)

Copied to clipboard

Challenge: Existing studies show that advanced LLMs produce text indistinguishable from human writing.
Approach: They propose a benchmark to assess persona simulation across diverse contexts by decomposing the evaluation into six fundamental capabilities including opinion consistency, memory recall, logical reasoning, persona tone, and syntactic style.
Outcome: The proposed model achieves moderate accuracy but falls short of the basic capabilities needed to simulate personas in real-world contexts.
Specializing Word Vectors by Spectral Decomposition on Heterogeneously Twisted Graphs (2020.coling-main)

Copied to clipboard

Challenge: Word vectors have a tendency to conflate semantic similarity with semantic relatedness . a new method is proposed to retrofit word vectors with lexical constraints .
Approach: They propose a method that heterogeneously retrofits a similarity matrix with lexical constraints.
Outcome: The proposed method has a competitive performance compared with the state-of-the-art methods.
LLM Safety From Within: Detecting Harmful Content with Internal Representations (2026.acl-long)

Copied to clipboard

Challenge: State-of-the-art guard models rely on terminal-layer representations and overlook safety-relevant features encoded across internal layers.
Approach: They propose a lightweight guard model that harnesses safety neurons from LLM internals without modifying the underlying model.
Outcome: The proposed model outperforms open-source guard models across multiple benchmarks while using 250 fewer trainable parameters.
TL-Training: A Task-Feature-Based Framework for Training Large Language Models in Tool Use (2025.findings-emnlp)

Copied to clipboard

Challenge: a new approach to training large language models (LLMs) overlooks task-specific characteristics in tool use, leading to performance bottlenecks.
Approach: They propose a task-feature-based framework that mitigates the effects of suboptimal training data . they use a dataset to train large-scale LLMs and a reward mechanism tailored to error categories .
Outcome: The proposed framework matches or surpasses open- and closed-source LLMs in tool-use performance using only 1,217 training data points.
PwnGPT: Automatic Exploit Generation Based on Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Automated exploit generation (AEG) is the automatic discovery and exploitation of vulnerabilities against unknown targets.
Approach: They propose an automatic exploit generation framework that automatically solves pwn challenges by using large language models.
Outcome: The proposed framework improves the completion rate of exploits on the openAI o1-preview model and the GPT-4o model.
MIRAGE: Exploring How Large Language Models Perform in Complex Social Interactive Environments (2025.acl-short)

Copied to clipboard

Challenge: Large Language Models (LLMs) have shown remarkable capabilities in environmental perception, reasoning-based decision-making, and simulating complex human behaviors, particularly in interactive role-playing contexts.
Approach: They propose a framework to assess LLMs' proficiency in portraying advanced human behaviors through murder mystery games using eight intricately crafted scripts.
Outcome: The framework evaluates LLMs' performance in portraying advanced human behaviors through murder mystery games.
Feedback-Driven Tool-Use Improvements in Large Language Models via Automated Build Environments (2026.findings-acl)

Copied to clipboard

Challenge: Currently, there are no efficient reinforcement learning (RL) frameworks specifically designed for tool use.
Approach: They propose an automated environment construction pipeline that incorporates scenario decomposition, document generation, function integration, complexity scaling, and localized deployment to enable high-quality training environments without external tools.
Outcome: The proposed framework significantly improves the models’ tool-use performance without degrading their general capabilities.
Preference Heads in Large Language Models: A Mechanistic Framework for Interpretable Personalization (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models exhibit strong implicit personalization ability, but most approaches treat this behavior as a black box.
Approach: They propose a mechanistic interpretation perspective and propose 'sparse' set of Preference Heads . they compute a Preference Contribution Score for each attention head and compare their predictions .
Outcome: The proposed framework computes a Preference Contribution Score (PCS) for each attention head and measures its causal impact on user aligned outputs.
Q-PRM: Adaptive Query Rewriting for Retrieval-Augmented Generation via Step-level Process Supervision (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to rewriting queries often lack supervision signals for intermediate steps . existing approaches rely on outcome-supervised training or heuristic rules to guide the rewrite process .
Approach: They propose a query rewriting framework that generates process-level supervision signals for intermediate steps.
Outcome: a new query rewriting framework outperforms existing approaches on open-domain QA benchmarks.
ToolHop: A Query-Driven Benchmark for Evaluating Large Language Models in Multi-Hop Tool Use (2025.acl-long)

Copied to clipboard

Challenge: Effective evaluation of multi-hop tool use is critical for analyzing the understanding, reasoning, and function-calling capabilities of large language models.
Approach: They propose a dataset that provides rigorous evaluation of multi-hop tool use.
Outcome: The proposed model achieves 49.04% accuracy across five model families.
FedDQC: Data Quality Control in Federated Instruction-tuning of Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Federated Learning (FL) enables privacy-preserving collaborative instruction tuning of large language models.
Approach: They propose a federated instruction tuning framework with dynamic data quality control to solve this problem.
Outcome: The proposed framework improves performance on mixed-quality datasets on synthetic and real-world datasets.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations