Papers by Dandan Song
Static Models, Dynamic World: A Unified Perspective on Temporal Perception in Large Language Models (2026.findings-acl)
Copied to clipboard
Chenhao Li, Dandan Song, Changzhi Zhou, Jun Yang, Yuhang Tian, Huipeng Ma, Guangyuan Feng, Luan Zhang, Xudong Li, Ke Duan
| Challenge: | Large language models are trained on static corpora but deployed in a dynamic world . a foundational tension remains between time and the ability to understand it . |
| Approach: | They formalize temporal queries in an information-theoretic framework based on parametric reachability of temporal premises and answers. |
| Outcome: | The proposed framework formalizes temporal queries in an information-theoretic framework based on parametric reachability of temporal premises and answers . the framework induces four temporal information regimes corresponding to internal reasoning, answer recency, premise anchoring, and genuine world indeterminacy . |
Modularized Interaction Network for Named Entity Recognition (2021.acl-long)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) models focus on word-level information, while segment-based models focus only on word level information. |
| Approach: | They propose a Modularized Interaction Network (MIN) model which utilizes both word-level information and segment-level dependencies. |
| Outcome: | The proposed model outperforms the current state-of-the-art models on three NER benchmark datasets. |
Path-enhanced Pre-trained Language Model for Knowledge Graph Completion (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Pre-trained language models have achieved remarkable knowledge graph completion (KGC) success. |
| Approach: | They propose a path-enhanced pre-trained language model-based knowledge graph completion method which uses multi-view generation to infer missing facts in triple-level and path-level simultaneously. |
| Outcome: | The proposed method significantly improves the performance of the knowledge graph completion task. |
A Framework of Knowledge Graph-Enhanced Large Language Model Based on Question Decomposition and Atomic Retrieval (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to enhance LLMs with knowledge graphs have limited results . knowledge graph question answering (KGQA) provides interpretable reasoning for large language models . |
| Approach: | They propose a framework for KG-enhanced LLM based on question decomposition and atomic retrieval . they propose question decomposing tree as framework for LLM reasoning . |
| Outcome: | The proposed framework outperforms existing reasoning-based baselines on KGQA datasets. |
Multi-Hop Knowledge Editing via Critic-Guided Multi-Agent Reasoning (2026.findings-acl)
Copied to clipboard
Xudong Li, Yuhang Tian, Dandan Song, Zhijing Wu, Shuhao Zhang, Jun Yang, Yongyu Huo, Changzhi Zhou, Xinyu Zhang, Chenhao Li, Huipeng Ma, Luan Zhang, Yan Xu, Qian Liu
| Challenge: | Existing knowledge editing methods rely on unidirectional, feed-forward pipelines . a minor retrieval error or logical mismatch at an early hop can become a silent failure . |
| Approach: | They propose a framework for closed-loop post-edit reasoning that uses a Critic agent to verify coherence and step-wise correctness. |
| Outcome: | Experiments on MQuAKE-2002 and MQuADE-hard show that CARE effectively mitigates error propagation . a minor retrieval error or logical mismatch at an early hop can become a silent failure . |
Separation and Fusion: A Novel Multiple Token Linking Model for Event Argument Extraction (2024.naacl-long)
Copied to clipboard
Jing Xu, Dandan Song, Siu Hui, Zhijing Wu, Meihuizi Jia, Hao Wang, Yanru Zhou, Changzhi Zhou, Ziyi Yang
| Challenge: | Existing methods for event argument extraction (EAE) lack cross-event information and require longer role sequences . et al. (2017): outperforms state-of-the-art methods for EE. |
| Approach: | They propose a separation-and-fusion paradigm to separate the acquisition of cross-event information and fuse it into the argument extraction of a target event. |
| Outcome: | The proposed model outperforms the state-of-the-art models on four widely used datasets. |
A Persona-Aware LLM-Enhanced Framework for Multi-Session Personalized Dialogue Generation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing personalized dialogue models focus on dialogue history and personality information, reducing the responses’ consistency. |
| Approach: | They propose a Persona-Aware LLM-enAnCEd(PALACE) framework that generates responses consistent with dialogue history and personality information across multiple sessions to engage users’ interest in the dialogue. |
| Outcome: | The proposed framework outperforms the state-of-the-art methods in automatic and human evaluation metrics on the MSC and DuLeMon datasets. |
Augmenting Reasoning Capabilities of LLMs with Graph Structures in Knowledge Base Question Answering (2024.findings-emnlp)
Copied to clipboard
Yuhang Tian, Dandan Song, Zhijing Wu, Changzhi Zhou, Hao Wang, Jun Yang, Jing Xu, Ruanmin Cao, HaoYu Wang
| Challenge: | Recent work uses Large Language Models (LLMs) for semantic parsing to address Knowledge Base Question Answering tasks. |
| Approach: | They propose a framework that augments reasoning capabilities of LLMs with Graph Structures in Knowledge Base Question Answering to retrieve question-related graph structures. |
| Outcome: | The proposed framework outperforms existing methods on GrailQA and WebQSP under the few-shot setting. |
Subgraph-Guided Executable Logical Form Generation for Knowledge Base Question Answering (2026.findings-acl)
Copied to clipboard
Yuhang Tian, Dandan Song, Zhijing Wu, Changzhi Zhou, Jun Yang, Huipeng Ma, Chenhao Li, Luan Zhang, Yading Li, Xudong Li, Shenxi Liu, Jing Jiang
| Challenge: | Existing retrieval-augmented approaches focus on ignoring the structural information of the Knowledge Base (KB) and the question. |
| Approach: | They propose a structure-aware subgraph retrieval stage that ranks candidate subgraphs by aligning them with the question’s structure, along with semantic relevance. |
| Outcome: | Experiments on GrailQA, WebQSP, and GraphQuestions show that the proposed framework achieves state-of-the-art performance. |
FPC: Fine-tuning with Prompt Curriculum for Relation Extraction (2022.aacl-main)
Copied to clipboard
| Challenge: | Existing methods for relation extraction ignore semantics of relation labels . prompt-based fine-tuning has been proposed for RE . |
| Approach: | They propose a method for relation extraction using prompt-based fine-tuning . they use auxiliary prompt-tuned learning task to make the model capture semantics of relation labels . |
| Outcome: | The proposed method outperforms existing methods on four widely used RE benchmarks under fully supervised and low-resource settings. |
GRV-KBQA: A Three-Stage Framework for Knowledge Base Question Answering with Decoupled Logical Structure, Semantic Grounding and Structure-Aware Validation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for Knowledge Base Question Answering generate non-executable queries and inefficiencies in query execution. |
| Approach: | a framework that decouples logical structure generation from semantic grounding is proposed . the framework explicitly enforces KB constraints to improve alignment between generated logical forms and KB structures. |
| Outcome: | GRV-KBQA decouples logical structure generation from semantic grounding and incorporates structure-aware validation to enhance accuracy. |
PEK: A Parameter-Efficient Framework for Knowledge-Grounded Dialogue Generation (2024.findings-acl)
Copied to clipboard
| Challenge: | Pre-trained language models have shown great dialogue generation capability in different scenarios, but the huge VRAM consumption when fine-tuning them is one of their drawbacks. |
| Approach: | They propose a parameter-efficient framework for knowledge-enhanced dialogue generation that leverages external knowledge documents and knowledge graphs to enhance its generation capabilities. |
| Outcome: | The proposed framework outperforms baseline methods on multiple evaluation metrics on Wizard of Wikipedia and CMU_DoG datasets. |
Dually Self-Improved Counterfactual Data Augmentation Using Large Language Model (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to generate counterfactual data augmentation are limited due to imbalance and biases in real-world training data. |
| Approach: | They propose a self-improved method for generating high-quality counterfacts using large language models. |
| Outcome: | The proposed method generates high-quality counterfacts on the natural language inference task using lightweight and task-specific LLMs. |
A Multi-turn Machine Reading Comprehension Framework with Rethink Mechanism for Emotion-Cause Pair Extraction (2022.coling-1)
Copied to clipboard
| Challenge: | Emotion-cause pair extraction (ECPE) is an emerging task in emotion cause analysis, which extracts potential emotion-caused pairs from an emotional document. |
| Approach: | They propose a document-level machine reading comprehension task to model complex relations between emotions and causes while avoiding generating the pairing matrix. |
| Outcome: | The proposed framework outperforms existing state-of-the-art methods on the emotion cause corpus and can model complex relations between emotions and causes while avoiding pairing matrix. |
TinyJudge: Unverifiable Constraint Alignment via Lightweight Specialist Ensembles (2026.acl-long)
Copied to clipboard
Yirong Zeng, Yufei Liu, Xiao Ding, Yutai Hou, Yuxian Wang, Wu Ning, Haonan Song, Dandan Tu, Qixun Zhang, Yuxiang He, Bibo Cai, Ting Liu
| Challenge: | Instruction Following (IF) is a core capability of LLMs, requiring strict adherence to diverse constraints. |
| Approach: | They propose a framework that uses tiny language models to evaluate instruction following . they propose to use a set of specialized tiny language model to provide rewards for soft constraints. |
| Outcome: | The proposed framework outperforms baseline models by 12% and speeds up training time by 3. |
CompKBQA: Component-wise Task Decomposition for Knowledge Base Question Answering (2025.emnlp-main)
Copied to clipboard
Yuhang Tian, Dandan Song, Zhijing Wu, Pan Yang, Changzhi Zhou, Jun Yang, Hao Wang, Huipeng Ma, Chenhao Li, Luan Zhang
| Challenge: | Existing knowledge base question answering methods struggle with complex queries. |
| Approach: | They propose a framework that optimizes the process of fine-tuning a LLM for generating logical forms by enabling it to learn relevant sub-tasks like skeleton generation, topic entity generation, and relevant relations generation. |
| Outcome: | The proposed framework achieves state-of-the-art on two benchmark KBQA datasets, WebQSP and CWQ. |