Papers by Zequn Sun
Knowing the No-match: Entity Alignment with Dangling Cases (2021.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to find entities that cannot find alignment across knowledge graphs (KGs) despite their importance, knowledge graph is expensive and suffers from incompleteness. |
| Approach: | They propose a framework for entity alignment and dangling entity detection that can be used to abstain from predicting alignment for detected dangle entities. |
| Outcome: | The proposed framework can abstain from predicting alignment for detected dangling entities. |
WebClipper: Efficient Evolution of Web Agents with Graph-based Trajectory Pruning (2026.acl-long)
Copied to clipboard
Junjie Wang, Zequn Xie, Dan Yang, Jie Feng, Yue Shen, Duolin Sun, Meixiu Long, Yihan Jiao, Zhehao Tan, Jian Wang, Peng Wei, Jinjie Gu
| Challenge: | Open-source web agents rely on long tool-call trajectories with cyclic reasoning loops and exploration of unproductive branches. |
| Approach: | They propose a framework that compresses web agent trajectories via graph-based pruning. |
| Outcome: | The proposed framework reduces tool-call rounds by 20% while improving accuracy and efficiency while maintaining the same level of performance as existing models. |
Guide the Many-to-One Assignment: Open Information Extraction via IoU-aware Optimal Transport (2023.acl-long)
Copied to clipboard
Kaiwen Wei, Yiran Yang, Li Jin, Xian Sun, Zequn Zhang, Jingyuan Zhang, Xiao Li, Linhao Zhang, Jintao Liu, Guo Zhi
| Challenge: | Open Information Extraction (OIE) aims to extract structured information from text without the limitations of close ontology. |
| Approach: | They propose a method to assign ground truth labels to parallelly generated tuple proposals . they leverage intersection-over-union (IoU) as assignment quality measurement . |
| Outcome: | The proposed method outperforms the state-of-the-art models on three benchmarks. |
Dangling-Aware Entity Alignment with Mixed High-Order Proximities (2022.findings-naacl)
Copied to clipboard
Juncheng Liu, Zequn Sun, Bryan Hooi, Yiwei Wang, Dayiheng Liu, Baosong Yang, Xiaokui Xiao, Muhao Chen
| Challenge: | Existing methods for dangling-aware entity alignment are underexplored but important problem. |
| Approach: | They propose a framework that uses high-order proximities to detect dangling entities and align matchable entities. |
| Outcome: | The proposed framework detects dangling entities and aligns matchable entities better than existing methods. |
Trigger is Not Sufficient: Exploiting Frame-aware Knowledge for Implicit Event Argument Extraction (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods to extract event arguments focus on learning pair-wise information between arguments and the given trigger. |
| Approach: | They propose a framework to extract event-related arguments from a given event frame-level scope. |
| Outcome: | The proposed method achieves state-of-the-art on the RAMS dataset. |
A Span-level Bidirectional Network for Aspect Sentiment Triplet Extraction (2022.emnlp-main)
Copied to clipboard
| Challenge: | Aspect Sentiment Triplet Extraction (ASTE) is a new fine-grained sentiment analysis task . recent studies have focused on solving aspects term extraction, opinion term extraction and aspect-level sentiment classification tasks individually or in combination of two subtasks. |
| Approach: | They propose a span-level bidirectional network which utilizes all possible spans as input and extracts triplets from spans bidirectionally. |
| Outcome: | The proposed framework outperforms state-of-the-art methods and improves performance . it can extract triplets of aspect terms, sentiments, and opinion terms from review sentences . |
Narrative Order Aware Story Generation via Bidirectional Pretraining Model with Optimal Transport Reward (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing storytelling systems suffer from insufficient understanding of event correlations and inadequate awareness of event temporal order. |
| Approach: | They propose a narrative order aware framework to generate coherent stories with flashbacks . they propose 'bidirectional pretraining model with Optimal Transport Reward' to improve quality . |
| Outcome: | The proposed framework generates coherent stories with flashbacks with a novel optimal transport reward. |
Mitigating Lost-in-Retrieval Problems in Retrieval Augmented Multi-Hop Question Answering (2025.acl-long)
Copied to clipboard
| Challenge: | Empirical results show that ChainRAG consistently outperforms baselines in both effectiveness and efficiency. |
| Approach: | They propose a method which sequentially handles each sub-question by completing missing key entities and retrieving relevant sentences from a sentence graph for answer generation. |
| Outcome: | The proposed method outperforms baselines on three multi-hop QA datasets. |
Event Causality Extraction via Implicit Cause-Effect Interactions (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have not exploited the interactions between the cause and effect event that could provide crucial clues for causality reasoning. |
| Approach: | They propose an Implicit Cause-Effect interaction framework which captures the implicit intra- and inter-event interactions by incorporating the privileged information for reasoning. |
| Outcome: | The proposed framework captures the implicit intra- and inter-event interactions by incorporating the privileged information (ground truth event types and arguments) for reasoning. |
KnowLA: Enhancing Parameter-efficient Finetuning with Knowledgeable Adaptation (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing methods for parameter-efficient finetuning (PEFT) are limited and only finetune a small number of parameters using limited instruction data. |
| Approach: | They propose a method that inserts an adaptation layer into an LLM to integrate embeddings of entities appearing in the input text. |
| Outcome: | The proposed method can activate parameterized knowledge in an LLM without changing its parameters or input prompts. |
Knowledge Association with Hyperbolic Knowledge Graph Embeddings (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graphs (KGs) depend on high embedding dimensions and hierarchical structures to achieve expressiveness. |
| Approach: | They propose a hyperbolic relational graph neural network for KG embedding and capture knowledge associations with a high-dimensional transformation. |
| Outcome: | Experiments on entity alignment and type inference show the proposed method is effective and efficient. |