Papers by Zifeng Ding
Memory-R1: Enhancing Large Language Model Agents to Manage and Utilize Memories via Reinforcement Learning (2026.acl-long)
Copied to clipboard
Sikuan Yan, Xiufeng Yang, Zuchao Huang, Ercong Nie, Zifeng Ding, Zonggen Li, Xiaowen Ma, Jinhe Bi, Kristian Kersting, Jeff Z. Pan, Hinrich Schuetze, Volker Tresp, Yunpu Ma
| Challenge: | Large Language Models (LLMs) are stateless and limited by a finite context window, preventing them from maintaining knowledge across long conversations or evolving tasks. |
| Approach: | They propose a reinforcement learning framework that empowers LLMs to actively manage external memory through two specialized agents. |
| Outcome: | The proposed framework outperforms baselines and benchmarks across diverse question types, three benchmarks, and multiple model scales. |
Temporal Fact Reasoning over Hyper-Relational Knowledge Graphs (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models of temporal fact reasoning do not explicitly specify temporal information for each fact. |
| Approach: | They propose a new type of data structure called hyper-relational TKG to study temporal fact reasoning over HKGs. |
| Outcome: | The proposed model is based on two new benchmark HTKG datasets . it provides additional key-value pairs (i.e., qualifiers) for each KG fact . |
zrLLM: Zero-Shot Relational Learning on Temporal Knowledge Graphs with Large Language Models (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing methods to forecast links on temporal knowledge graphs are embedding-based . but they face a strong challenge in modeling the unseen zero-shot relations . |
| Approach: | They propose to embed knowledge graphs (TKGF) entities and relations based on observed contexts into embedding-based methods to model unseen zero-shot relations. |
| Outcome: | The proposed methods show strong performance on traditional TKG forecasting benchmarks, but they face a strong challenge in modeling unseen zero-shot relations that have no prior graph context. |
Parameter-Efficient Routed Fine-Tuning: Mixture-of-Experts Demands Mixture of Adaptation Modules (2026.findings-eacl)
Copied to clipboard
| Challenge: | Existing Parameter-Efficient Fine-Tuning (PEFT) strategies that focus on specialized experts are not effective for Mixture-of-Experts (MoE). |
| Approach: | They propose to integrate a dynamic routing mechanism among specialized experts in Mixture-of-Experts (MoE) . |
| Outcome: | Extensive experiments on commonsense and math reasoning tasks validate the performance and efficiency of the proposed routed approach. |
TCP: a Benchmark for Temporal Constraint-Based Planning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing benchmarks evaluate temporal reasoning and planning in isolation and under limited forms of complexity. |
| Approach: | They propose a temporal constraint-based planning benchmark that assesses temporal reasoning and planning capabilities in large language models. |
| Outcome: | The proposed model fails to perform well under limited constraints and lacks temporal grounding. |
BMIKE-53: Investigating Cross-Lingual Knowledge Editing with In-Context Learning (2025.acl-long)
Copied to clipboard
| Challenge: | Using a benchmark for cross-lingual knowledge editing, knowledge editing is underexplored. |
| Approach: | They propose a benchmark for cross-lingual in-context knowledge editing that spans 53 languages and three KE datasets. |
| Outcome: | The proposed benchmark systematically evaluates cross-lingual knowledge editing (IKE) under zero-shot, one-shot and few-shot setups. |
Can Knowledge Graphs Make Large Language Models More Trustworthy? An Empirical Study Over Open-ended Question Answering (2025.acl-long)
Copied to clipboard
| Challenge: | Existing benchmarks for integrating Knowledge Graphs with Large Language Models focus on closed-ended tasks, leaving a gap in evaluating performance on more complex, real-world scenarios. |
| Approach: | They propose a benchmark to evaluate LLMs augmented with KGs in open-ended, real-world question answering settings. |
| Outcome: | The proposed benchmark reflects practical complexities through diverse question types and incorporates metrics to quantify both hallucination rates and reasoning improvements in LLM+KG models. |
When One LLM Drools, Multi-LLM Collaboration Rules (2026.acl-long)
Copied to clipboard
Shangbin Feng, Wenxuan Ding, Alisa Liu, Zifeng Wang, Weijia Shi, Yike Wang, Shannon Zejiang Shen, Xiaochuang Han, Hunter Lang, Chen-Yu Lee, Tomas Pfister, Yejin Choi, Yulia Tsvetkov
| Challenge: | a single general-purpose LLM is not enough to produce a reliable output, argues this paper . a multi-LLM collaboration approach addresses reliability, democratization, and pluralism . |
| Approach: | They argue that a single general-purpose LLM is not enough to produce a reliable output . they organize existing multi-LLM collaboration methods into a hierarchy based on access and information exchange . |
| Outcome: | The proposed method addresses reliability, democratization, and pluralism challenges a single LLM fails to produce a reliable output. |
Learning Neural Ordinary Equations for Forecasting Future Links on Temporal Knowledge Graphs (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for temporal knowledge graphs model the temporal KGs in discrete state spaces, whereas static models model the KG in discretized state spaces. |
| Approach: | They propose a continuum model that extends the idea of neural ordinary differential equations to multi-relational graph convolutional networks and encodes both temporal and structural information into continuous-time dynamic embeddings. |
| Outcome: | The proposed model outperforms existing models on five benchmark datasets showing it can predict future links on temporal knowledge graphs. |
ECOLA: Enhancing Temporal Knowledge Embeddings with Contextualized Language Representations (2023.findings-acl)
Copied to clipboard
Zhen Han, Ruotong Liao, Jindong Gu, Yao Zhang, Zifeng Ding, Yujia Gu, Heinz Koeppl, Hinrich Schütze, Volker Tresp
| Challenge: | Existing enhancement approaches cannot be applied to temporal knowledge graphs (tKGs) existing enhancement approaches assume knowledge embedding is time-independent, whereas entity embedded in tKG models evolves . |
| Approach: | They propose to use textual data to enhance temporal knowledge embedding by Enhanced Temporal Knowledge Embeddings with Contextualized Language Representations (ECOLA) to evaluate ECOLA, they introduce three new datasets for training and evaluation. |
| Outcome: | The proposed model significantly improves Hits@1 on the link prediction task. |
Predicate-Conditional Conformalized Answer Sets for Knowledge Graph Embeddings (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods provide probabilistic guarantees over a reference set of queries and answers, but they fail to identify when the answers to a query are uncertain. |
| Approach: | They propose a method that approximates predicate-conditional coverage guarantees while maintaining compact prediction sets. |
| Outcome: | The proposed method provides predicate-conditional coverage guarantees while maintaining compact prediction sets. |