Structured Self-Supervised Pretraining for Commonsense Knowledge Graph Completion (2021.tacl-1)
Copied to clipboard
| Challenge: | Existing approaches focus on generating concepts that have direct and obvious relationships with existing concepts and lack an ability to generate unobvious concepts. |
| Approach: | They propose a general graph-to-paths pretraining framework that leverages high-order structures in CKGs to capture high-level relationships between concepts. |
| Outcome: | The proposed framework can capture high-order relationships between concepts in four special cases: long path, path-to-path, router, and graph-node-path. |
Similar Papers
I Know What You Asked: Graph Path Learning using AMR for Commonsense Reasoning (2020.coling-main)
Copied to clipboard
| Challenge: | a large amount of pre-defined commonsense knowledge is available for commonsensense reasoning . humans acquire commonsence in their lives, but machines cannot learn commonseense without assistance. |
| Approach: | They propose an AMR-ConceptNet-Pruned (ACP) graph that is pruned from a full integrated graph . they show that the ACP graph interprets the reasoning path and predicts the correct answer . |
| Outcome: | The proposed graph outperforms baseline models in the commonsenseQA task . it shows that the reasoning path can be interpreted with the relations and concepts provided by the graph . |
Connecting the Dots: A Knowledgeable Path Generator for Commonsense Question Answering (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing QA systems do not have commonsense knowledge or cannot reason with it. |
| Approach: | They propose to augment a general commonsense QA framework with a knowledgeable path generator by extrapolating existing paths from a KG with 'state-of-the-art' language model. |
| Outcome: | The generated paths are interpretable, novel, and relevant to the task. |
Commonsense Knowledge Transfer for Pre-trained Language Models (2023.findings-acl)
Copied to clipboard
| Challenge: | Recent advances in pre-trained language models have transformed the landscape of natural language processing. |
| Approach: | They propose a framework to transfer commonsense knowledge stored in a neural commonsensing model to a general-purpose pre-trained language model. |
| Outcome: | Empirical results show that the proposed framework improves the model’s performance on downstream tasks that require commonsense reasoning. |
CN-AutoMIC: Distilling Chinese Commonsense Knowledge from Pretrained Language Models (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing commonsense knowledge graphs are limited to English, hindering research in non-English languages. |
| Approach: | They propose a Chinese CKG generated from multilingual PLMs that is translated into Chinese . they propose 'generate-by-category' strategy to reduce invalid generation . |
| Outcome: | The proposed CKG has high quality and diversity, surpassing the direct translation version of similar English CKGs. |
ATAP: Automatic Template-Augmented Commonsense Knowledge Graph Completion via Pre-Trained Language Models (2024.emnlp-main)
Copied to clipboard
| Challenge: | Commosense knowledge graphs (CKGC) are powerful representations of real-world commonsense knowledge. |
| Approach: | They propose a framework that uses automatically generated prompt templates combined with pre-trained language models to improve CKGC performance. |
| Outcome: | The proposed framework mitigates the long-tail problem and improves CKGC performance on a large dataset. |
COMET: Commonsense Transformers for Automatic Knowledge Graph Construction (P19-1)
Copied to clipboard
| Challenge: | Existing studies on commonsense knowledge base construction only store loosely structured open-text descriptions of knowledge. |
| Approach: | They propose a commonsense knowledge base construction model that generates rich commonsensense descriptions in natural language. |
| Outcome: | The proposed models can generate rich and diverse commonsense descriptions in natural language. |
Revisiting Generative Commonsense Reasoning: A Pre-Ordering Approach (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing approaches to generative commonsense reasoning hypothesize that pre-trained models lack sufficient parametric knowledge for this task. |
| Approach: | They propose to use order-agnostic input to elaborately manipulate the order of the given concepts before generation to evaluate their commonsense knowledge. |
| Outcome: | The proposed approach outperforms more sophisticated models with a lot of external data and resources in the task of generating a logical sentence from a set of concepts. |
C3KG: A Chinese Commonsense Conversation Knowledge Graph (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing commonsense knowledge bases organize tuples in an isolated manner, causing problems for chatbots . |
| Approach: | They create a Chinese commonsense conversation knowledge graph which integrates social commonsensm and dialog flow information. |
| Outcome: | The proposed graph incorporates social commonsense knowledge and dialog flow information. |
CAKE: A Scalable Commonsense-Aware Framework For Multi-View Knowledge Graph Completion (2022.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding techniques rely on fact-view data to predict missing links between entities, limiting their performance. |
| Approach: | They propose a commonsense-aware knowledge embedding framework which generates commonsensense from factual triples with entity concepts for a KGC task. |
| Outcome: | The proposed framework could produce high-quality negative triples and joint commonsense and fact-view link prediction. |
Commonsense Knowledge Graph Completion Via Contrastive Pretraining and Node Clustering (2023.findings-acl)
Copied to clipboard
| Challenge: | Commonsense knowledge graphs are typically represented by short text, resulting in many different nodes representing the same concept. |
| Approach: | They propose a framework based on Contrastive Pretraining and Node Clustering to solve these problems. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on two CSKG completion benchmarks. |