Papers by Jiaoyan Chen
DET: A Dual-Encoding Transformer for Relational Graph Embedding (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing approaches to graph representation only consider the local neighbors, sacrificing the Transformer’s ability to attend to elements at any distance. |
| Approach: | They propose a dual-encoding Transformer architecture that uses a structural encoder and a semantic encoder to seek for semantically relevant nodes. |
| Outcome: | The proposed architecture achieves superior performance compared to state-of-the-art attention-based methods on complex relational graphs like KGs and citation networks. |
Zero-shot Text Classification via Reinforced Self-training (2020.acl-main)
Copied to clipboard
Zhiquan Ye, Yuxia Geng, Jiaoyan Chen, Jingmin Chen, Xiaoxiao Xu, SuHang Zheng, Feng Wang, Jun Zhang, Huajun Chen
| Challenge: | Existing methods to learn from unlabeled data are difficult for zero-shot text classification tasks. |
| Approach: | They propose a self-training based method to efficiently leverage unlabeled data. |
| Outcome: | The proposed method significantly outperforms existing methods in zero-shot text classification tasks on benchmarks and a real-world e-commerce dataset. |
Trigger-Argument based Explanation for Event Detection (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing works on ED use words or phrases to explain models’ inner mechanisms, but for ED, the event structure is more enlightening clues to explain model behaviors. |
| Approach: | They propose a Trigger-Argument based Explanation method which can utilize event structure knowledge to uncover a faithful interpretation for existing ED models at neuron level. |
| Outcome: | The proposed method can reveal the process by which the model predicts on the large-scale MAVEN and the widely-used ACE 2005 datasets. |
Noise-powered Multi-modal Knowledge Graph Representation Framework (2025.coling-main)
Copied to clipboard
| Challenge: | Current efforts to integrate MMKG with pretraining are scarce. |
| Approach: | They propose a method that integrates multi-modal entity features into MMKGs using a Transformer-based architecture equipped with modality-level noise masking. |
| Outcome: | The proposed method achieves SOTA performance across ten datasets. |
Novel Relation Detection: Discovering Unknown Relation Types via Multi-Strategy Self-Supervised Learning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to relation extraction can only recognize predefined relation types . new or out-of-scope relation types may continually emerge after the model is deployed . |
| Approach: | They propose a novel relation detection task that uses self-supervised learning to handle shallow semantic similarity problem. |
| Outcome: | The proposed method outperforms state-of-the-art methods on two datasets. |
An Industry Evaluation of Embedding-based Entity Alignment (2020.coling-industry)
Copied to clipboard
| Challenge: | Knowledge graphs (KGs) are increasingly important in various applications such as question answering and search engines. |
| Approach: | They propose to use a supervised learning environment with unbiased seed mappings for training and validation to evaluate alignment methods in an industrial context. |
| Outcome: | The proposed methods are evaluated in an industrial context and are compared with DBpedia and Wikidata benchmarks. |
OntoEA: Ontology-guided Entity Alignment via Joint Knowledge Graph Embedding (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for aligning knowledge graph entities ignore the ontology which contains critical meta information such as classes and membership relationships with entities. |
| Approach: | They propose an ontology-guided method where KGs and ontologies are jointly embedded. |
| Outcome: | Extensive experiments on seven public and industrial benchmarks show the ontology-guided method performs well and is cost-effective. |
Certainty in Uncertainty: Reasoning over Uncertain Knowledge Graphs with Statistical Guarantees (2025.emnlp-main)
Copied to clipboard
Yuqicheng Zhu, Jingcheng Wu, Yizhen Wang, Hongkuan Zhou, Jiaoyan Chen, Evgeny Kharlamov, Steffen Staab
| Challenge: | Existing methods produce only point estimates, without quantifying predictive uncertainty—limiting their reliability in high-stakes applications where understanding confidence in predictions is crucial. |
| Approach: | They propose a framework that generates prediction intervals guaranteed to contain the true score with a user-specified level of confidence. |
| Outcome: | The proposed framework generates prediction intervals guaranteed to contain the true score with a user-specified level of confidence. |
TacoERE: Cluster-aware Compression for Event Relation Extraction (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing work on event relation extraction focuses on modeling the entire document . existing methods cannot handle long-range dependencies and information redundancy . |
| Approach: | They propose a compression-then-extraction paradigm for event relation extraction . they propose document clustering for modeling event dependencies and then a cluster summarization method . |
| Outcome: | The proposed method simplifies and highlights important text content of clusters for mitigating redundancy and event distance. |
What Breaks Knowledge Graph based RAG? Benchmarking and Empirical Insights into Reasoning under Incomplete Knowledge (2026.eacl-long)
Copied to clipboard
Dongzhuoran Zhou, Yuqicheng Zhu, Xiaxia Wang, Hongkuan Zhou, Yuan He, Jiaoyan Chen, Steffen Staab, Evgeny Kharlamov
| Challenge: | Existing evaluation metrics and lenient answer matching criteria obscure meaningful comparisons. |
| Approach: | They propose a general method for constructing benchmarks and a method to assess KG-RAG methods under incomplete knowledge. |
| Outcome: | The proposed method systematically assesses KG-RAG methods under incomplete knowledge. |
Class Lifelong Learning for Intent Detection via Structure Consolidation Networks (2023.findings-acl)
Copied to clipboard
Qingbin Liu, Yanchao Hao, Xiaolong Liu, Bo Li, Dianbo Sui, Shizhu He, Kang Liu, Jun Zhao, Xi Chen, Ningyu Zhang, Jiaoyan Chen
| Challenge: | Existing intent detection models can only handle predefined intent classes in the offline environment. |
| Approach: | They propose a method that continually learns new intent classes from new data . structure-based retrospection and contrastive knowledge distillation are used to solve these problems . |
| Outcome: | The proposed method outperforms existing models on three benchmarks. |
HiRAS: A Hierarchical Multi-Agent Framework for Paper-to-Code Generation and Execution (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to automate computational research use fixed sequential agent pipelines with weak global coordination, which limits their robustness and overall performance. |
| Approach: | They propose a hierarchical multi-agent framework for end-to-end paper reproduction that employs supervisory manager agents to coordinate specialised agents across fine-grained stages. |
| Outcome: | The proposed framework improves the paper2code benchmark and significantly reduces hallucination in the evaluation. |
CoTKR: Chain-of-Thought Enhanced Knowledge Rewriting for Complex Knowledge Graph Question Answering (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge rewriting methods may include irrelevant information, omit crucial details, or fail to align with the question’s semantics. |
| Approach: | They propose a new rewriting method CoTKR for generating reasoning traces and corresponding knowledge in an interleaved manner, thereby mitigating the limitations of single-step knowledge rewrite. |
| Outcome: | The proposed method mitigates the limitations of single-step knowledge rewriting and bridges the preference gap between the knowledge reactor and the question answering (QA) model. |
Language Model Analysis for Ontology Subsumption Inference (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing studies focus on simple, triple-based, relational KBs but omit more sophisticated, logic-based conceptualised KB. |
| Approach: | They propose to use ontology subsumption axioms to probe LMs' knowledge of ontologies by probing datasets from atomic and complex concepts. |
| Outcome: | The proposed methods encode less background knowledge of Subsumption Inference (SI) than traditional Natural Language Inference but can improve on SI significantly when a small number of samples are given. |
Graph-guided Cross-composition Feature Disentanglement for Compositional Zero-shot Learning (2025.findings-acl)
Copied to clipboard
Yuxia Geng, Runkai Zhu, Jiaoyan Chen, Jintai Chen, Xiang Chen, Zhuo Chen, Shuofei Qiao, Yuxiang Wang, Xiaoliang Xu, Sheng-Jun Huang
| Challenge: | Disentanglement of visual features of primitives (i.e., attributes and objects) has shown exceptional results in Compositional Zero-shot Learning (CZSL). |
| Approach: | They propose a solution that takes multiple compositions as inputs and constrains disentangled primitive features to be general across compositions. |
| Outcome: | The proposed architecture significantly improves performance on three popular CZSL benchmarks and has been verified by solid ablation studies. |
Can LLMs Evaluate Complex Attribution in QA? Automatic Benchmarking using Knowledge Graphs (2025.acl-long)
Copied to clipboard
Nan Hu, Jiaoyan Chen, Yike Wu, Guilin Qi, Hongru Wang, Sheng Bi, Yongrui Chen, Tongtong Wu, Jeff Z. Pan
| Challenge: | Attributed Question Answering (AQA) has attracted wide attention, but there are several limitations in evaluating the attributions. |
| Approach: | They propose a large-scale benchmark containing comprehensive attribution categories . they compare 25 automatic evaluators with human evaluers and tested LLM evalators . |
| Outcome: | The proposed method can compare attributions with subtle differences and provide feedback to improve them. |
MINTQA: A Multi-Hop Question Answering Benchmark for Evaluating LLMs on New and Long-tail Knowledge (2026.acl-long)
Copied to clipboard
| Challenge: | Existing studies have shown that large language models can handle knowledge with varying familiarity. |
| Approach: | They propose a benchmark to evaluate multi-hop question answering on new and tail knowledge . they use RAG to integrate external knowledge into large language models . |
| Outcome: | The proposed benchmark evaluates the multi-hop reasoning ability of large language models . it primarily evaluates their ability to handle knowledge with different levels of familiarity . |