Papers by Yuzhong Qu
Timeline-based Sentence Decomposition with In Context Learning for Temporal Fact Extraction (2024.acl-long)
Copied to clipboard
| Challenge: | Recent research on temporal fact extraction fails to establish time-to-fact correspondences in complex sentences. |
| Approach: | They propose a timeline-based sentence decomposition strategy using large language models with in-context learning to extract temporal facts from natural language text. |
| Outcome: | The proposed method achieves state-of-the-art on a complex temporal fact extraction dataset. |
Automatic rule generation for time expression normalization (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing SOTA methods for normalization rely on expert-designed rules or grammars . current methods are domain sensitive and not sufficient on emerging corpora . |
| Approach: | They propose a method that generates normalization rules from annotated data without expert intervention. |
| Outcome: | The proposed method surpasses existing rule-based methods on the Tweets benchmark and on the TempEval-3 benchmark. |
Semantic Framework based Query Generation for Temporal Question Answering over Knowledge Graphs (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for temporal question answering ignore intrinsic connections between events that can make them temporally related. |
| Approach: | They propose a temporal question answering method that generates query graphs by exploring relevant facts of mentioned entities. |
| Outcome: | The proposed method outperforms existing methods on two benchmarks over different knowledge graphs. |
Logical Form Generation via Multi-task Learning for Complex Question Answering over Knowledge Bases (2022.coling-1)
Copied to clipboard
| Challenge: | Existing generation-based KBQA methods that translate natural language questions to executable logical forms are proving promising but noise introduced can lead to incorrect results. |
| Approach: | They propose a Generation-based KBQA method that uses auxiliary information to enhance logical form generation by combining unseen KB items with novel combinations. |
| Outcome: | The proposed method achieves state-of-the-art results on ComplexWebQuestions and WebQuestIONSSP datasets. |
TIARA: Multi-grained Retrieval for Robust Question Answering over Large Knowledge Base (2022.emnlp-main)
Copied to clipboard
| Challenge: | KBQA is a challenging area for pre-trained language models due to its extensive space and complexity. |
| Approach: | They propose a model that uses multi-grained retrieval to focus on most relevant KB contexts . constrained decoding is used to control output space and reduce generation errors . |
| Outcome: | The proposed model outperforms existing models on GrailQA and WebQuestionsSP. |
MarkQA: A large scale KBQA dataset with numerical reasoning (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing KBQA datasets are insufficient for numerical reasoning . existing KBqa datasets lack multi-hop reasoning and numerical reasoning. |
| Approach: | They propose a task that necessitates the ability to perform multi-hop reasoning and numerical reasoning. |
| Outcome: | The proposed task necessitates the ability to perform multi-hop reasoning and numerical reasoning. |
AdaLoGN: Adaptive Logic Graph Network for Reasoning-Based Machine Reading Comprehension (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods and limitations for machine reading comprehension are insufficient for logical reasoning over text. |
| Approach: | They propose a neural-symbolic approach which passes messages over a graph representing logical relations between text units to predict an answer. |
| Outcome: | The proposed approach outperforms existing methods on ReClor and LogiQA. |
Leveraging Frequent Query Substructures to Generate Formal Queries for Complex Question Answering (D19-1)
Copied to clipboard
| Challenge: | Existing approaches build universal paraphrasing or ranking models for whole questions . current approaches build a universal ranking model for the whole questions, which fails for complex, long-tail questions. |
| Approach: | They propose a new query generation approach based on frequent query substructures which helps rank existing query structures or build new query structures. |
| Outcome: | The proposed approach significantly outperforms existing models on two benchmark datasets. |
When Retriever-Reader Meets Scenario-Based Multiple-Choice Questions (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Scenario-based question answering (SQA) requires retrieving and reading paragraphs from a large corpus to answer a question contextualized by a long scenario description. |
| Approach: | They propose a model where the retriever is implicitly supervised only using QA labels via a novel word weighting mechanism. |
| Outcome: | The proposed model outperforms strong baselines on multiple-choice questions in three datasets. |
TARGA: Targeted Synthetic Data Generation for Practical Reasoning over Structured Data (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for semantic parsing rely on extensive manually annotated datasets and limited generalization capability to unseen examples. |
| Approach: | They propose a framework that generates high-relevance synthetic data without manual annotation . they generate queries for the queries and use them as demonstrations for in-context learning . |
| Outcome: | The proposed framework outperforms non-fine-tuned methods on KBQA datasets and shows superior sample efficiency, robustness, and generalization capabilities under non-I.I.D. settings. |
GeoSQA: A Benchmark for Scenario-based Question Answering in the Geography Domain at High School Level (D19-1)
Copied to clipboard
| Challenge: | SQA is an emerging application of NLP in the medical, geography, and legal domains. |
| Approach: | They propose a dataset of 1,981 scenarios and 4,110 multiple-choice questions in geography domain at high school level. |
| Outcome: | The proposed dataset consists of 1,981 scenarios and 4,110 multiple-choice questions in the geography domain at high school level. |
Reverse Preference Optimization for Complex Instruction Following (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for identifying and evaluating preference pairs with multiple constraints are noisy. |
| Approach: | They propose a method that dynamically reverses constraints to ensure the chosen response is perfect. |
| Outcome: | The proposed method reduces noise in preference pairs by reversing constraints to ensure the chosen response is perfect. |
Reading Comprehension with Graph-based Temporal-Casual Reasoning (C18-1)
Copied to clipboard
| Challenge: | Existing methods for reading comprehension tasks ignore semantic relations between sentences or use sliding window scanning over the words of the passage without sentence breaks. |
| Approach: | They propose a method to integrate information from multiple sentences to answer complex questions. |
| Outcome: | Experiments on RACE and MCTest show that the proposed approach improves state-of-the-art methods on simple factoid questions. |
QueryAgent: A Reliable and Efficient Reasoning Framework with Environmental Feedback based Self-Correction (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for semantic parsing fail when hallucinations are encountered . QueryAgent solves a question step-by-step and performs stepwise self-correction . |
| Approach: | They propose a framework that solves a query step-by-step and performs stepwise self-correction. |
| Outcome: | The proposed framework outperforms existing methods on GrailQA and GraphQ by 5.7 and 15.0 points. |