Papers by Xiaoxiao Guo
Self-Supervised Learning for Contextualized Extractive Summarization (P19-1)
Copied to clipboard
| Challenge: | Existing models for extractive summarization are usually trained from scratch with a cross-entropy loss . previous work builds an end-to-end system to learn to choose sentences without explicitly modeling document context . |
| Approach: | They propose three auxiliary pre-training tasks that learn to capture the document context in a self-supervised fashion. |
| Outcome: | The proposed models outperform existing models on a CNN/DM dataset. |
Simple yet Effective Bridge Reasoning for Open-Domain Multi-Hop Question Answering (D19-58)
Copied to clipboard
| Challenge: | Existing work on open-domain multi-hop question answering relies on off-the-shelf information retrieval techniques to retrieve answer passages. |
| Approach: | They propose a new subproblem for open-domain multi-hop question answering . they aim to recognize the anchor from a set of start passages with a reading comprehension model . |
| Outcome: | The proposed method significantly improves the baseline method on the open-domain hotpotQA benchmark. |
Extracting Multiple-Relations in One-Pass with Pre-Trained Transformers (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to extract multiple relations from a paragraph require multiple passes over the paragraph. |
| Approach: | They propose a method to extract multiple relations from a paragraph by encoding the paragraph only once. |
| Outcome: | The proposed approach can perform state-of-the-art on the benchmark ACE 2005. |
JECC: Commonsense Reasoning Tasks Derived from Interactive Fictions (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks focus on a single reasoning type and ask human annotators to write candidate statements related to the particular type of commonsense. |
| Approach: | They propose a new commonsense reasoning dataset based on human’s Interactive Fiction (IF) gameplaywalkthroughs. |
| Outcome: | The proposed dataset is challenging to previous machine reading models and large language models with a significant 20%performance gap compared to human experts. |
Do Multi-hop Readers Dream of Reasoning Chains? (D19-58)
Copied to clipboard
| Challenge: | Existing models for multihop reasoning are limited in their performance . multi-hop reasoning requires the ability to gather information from multiple passages . |
| Approach: | They propose a method that provides the full reasoning chain of multiple passages instead of just one final passage where the answer appears. |
| Outcome: | The proposed model improves on existing models by providing the full reasoning chain of multiple passages instead of just one final passage where the answer appears. |
One-Shot Relational Learning for Knowledge Graphs (D18-1)
Copied to clipboard
| Challenge: | Existing studies on knowledge graph completion require a large number of positive examples for each relation, but long-tail relations are more common in KGs and those newly added relations do not have many known triples for training. |
| Approach: | They propose a one-shot relational learning framework that utilizes the knowledge distilled by embedding models and learns a matching metric by considering both the learned embeddments and one-hop graph structures. |
| Outcome: | The proposed framework improves on existing embedding models and eliminates the need for retraining when dealing with newly added relations. |
Sentence Embedding Alignment for Lifelong Relation Extraction (N19-1)
Copied to clipboard
| Challenge: | Existing approaches to relation extraction require a fixed set of relations . Existing methods assume a closed set of relationships and perform once-and-for-all training on a set of datasets. |
| Approach: | They propose to improve the stochastic gradient methods with a replay memory to alleviate the forgetting problem by anchoring the sentence embedding space. |
| Outcome: | The proposed method outperforms state-of-the-art methods on multiple benchmarks. |
Multi-step Entity-centric Information Retrieval for Multi-Hop Question Answering (D19-58)
Copied to clipboard
Rajarshi Das, Ameya Godbole, Dilip Kavarthapu, Zhiyu Gong, Abhishek Singhal, Mo Yu, Xiaoxiao Guo, Tian Gao, Hamed Zamani, Manzil Zaheer, Andrew McCallum
| Challenge: | Multi-hop question answering (QA) requires an information retrieval system that can find multiple supporting evidence needed to answer the question. |
| Approach: | They propose a technique that uses information of entities present in the initial retrieved evidence to learn to ‘hop’ onto other relevant evidence. |
| Outcome: | The proposed method boosts retrieval performance on a multi-hop question answering dataset with 5 million Wikipedia paragraphs and a model without training increases its performance by 10.59 F1. |
Improving Question Answering over Incomplete KBs with Knowledge-Aware Reader (P19-1)
Copied to clipboard
| Challenge: | Existing models that use incomplete knowledge bases and text data to answer open-domain questions are insufficient to cover full evidence. |
| Approach: | They propose a model which learns to aggregate answer evidence from incomplete knowledge bases and text snippets. |
| Outcome: | The proposed model improves on the widely-used KBQA benchmark WebQSP across settings with different extents of incompleteness. |
Narrative Question Answering with Cutting-Edge Open-Domain QA Techniques: A Comprehensive Study (2021.tacl-1)
Copied to clipboard
| Challenge: | Recent advances in open-domain question answering (ODQA) have led to human-level performance on many datasets. |
| Approach: | They provide a comprehensive and quantitative analysis about the difficulty of book QA . they compare the results of their research with extensive ODQA experiments . |
| Outcome: | The proposed model outperforms existing models on event-oriented questions on the NarrativeQA dataset. |
Context-Aware Conversation Thread Detection in Multi-Party Chat (D19-1)
Copied to clipboard
| Challenge: | In multi-party chat, it is common for multiple conversations to occur concurrently . a new model that automatically disentangles conversation threads is proposed . |
| Approach: | They propose a Context-Aware Thread Detection model that automatically disentangles conversation threads in chat logs. |
| Outcome: | The proposed model outperforms state-of-the-art models on four real-world chat logs. |
Interactive Fiction Game Playing as Multi-Paragraph Reading Comprehension with Reinforcement Learning (2020.emnlp-main)
Copied to clipboard
| Challenge: | Interactive Fiction (IF) games with real human-written natural language texts provide a new natural evaluation for language understanding techniques. |
| Approach: | They propose to re-formulate IF game solving as Multi-Passage Reading Comprehension tasks using context-query attention mechanisms and structured prediction to efficiently generate and evaluate action outputs. |
| Outcome: | The proposed methods achieve high winning rates and low data requirements on the recent IF benchmark (Jericho) |
Imposing Label-Relational Inductive Bias for Extremely Fine-Grained Entity Typing (N19-1)
Copied to clipboard
| Challenge: | Existing entity typing systems exploit type hierarchy provided by KB schema to model label correlations. |
| Approach: | They propose a graph layer that encodes global label co-occurrence statistics and word-level similarities. |
| Outcome: | The proposed model achieves a 15.3% relative F1 improvement on a large dataset with over 10,000 free-form types. |
TWEETQA: A Social Media Focused Question Answering Dataset (P19-1)
Copied to clipboard
Wenhan Xiong, Jiawei Wu, Hong Wang, Vivek Kulkarni, Mo Yu, Shiyu Chang, Xiaoxiao Guo, William Yang Wang
| Challenge: | Social media is becoming an important realtime information source, especially during natural disasters and emergencies. |
| Approach: | They present a large-scale dataset for question answering over social media data . they gather tweets used by journalists and ask human annotators to write questions upon them . |
| Outcome: | The proposed dataset shows that neural models that perform well on formal texts are limited in their performance . the proposed model is still lagging behind human performance with a large margin . |
Diverse Few-Shot Text Classification with Multiple Metrics (N18-1)
Copied to clipboard
Mo Yu, Xiaoxiao Guo, Jinfeng Yi, Shiyu Chang, Saloni Potdar, Yu Cheng, Gerald Tesauro, Haoyu Wang, Bowen Zhou
| Challenge: | Existing methods for few-shot learning are insufficient to capture task variations in natural language domains. |
| Approach: | They propose an adaptive metric learning approach that automatically determines the best weighted combination from a set of metrics obtained from meta-training tasks for a newly seen few-shot task. |
| Outcome: | The proposed method performs favorably against state-of-the-art few shot learning algorithms on real-world sentiment analysis and dialog intent classification datasets. |