Noisy Positive-Unlabeled Learning with Self-Training for Speculative Knowledge Graph Reasoning (2023.findings-acl)
Copied to clipboard
Ruijie Wang, Baoyu Li, Yichen Lu, Dachun Sun, Jinning Li, Yuchen Yan, Shengzhong Liu, Hanghang Tong, Tarek Abdelzaher
| Challenge: | State-of-the-art methods fail in speculative reasoning task on knowledge graphs . state-of the-art approaches assume correctness of fact is determined by its presence in KG . |
| Approach: | They propose a speculative reasoning task on real-world knowledge graphs . they propose nPUGraph that estimates correctness of both collected and uncollected facts . |
| Outcome: | The proposed framework improves the robustness of a label posterior-aware graph encoder against false positive links and identifies missing facts to provide high-quality grounds of reasoning. |
Similar Papers
PretrainRL: Alleviating Factuality Hallucination of Large Language Models at the Beginning (2026.findings-acl)
Copied to clipboard
Langming Liu, Kangtao Lv, Haibin Chen, Weidong Zhang, Yejing Wang, Shilei Liu, Xin Tong, Yujin Yuan, Yongwei Wang, Wenbo Su, Bo Zheng
| Challenge: | Large language models suffer from factual hallucinations where they generate verifiable falsehoods. |
| Approach: | They propose a framework that integrates reinforcement learning into the pretraining phase to consolidate factual knowledge. |
| Outcome: | The proposed framework significantly alleviates factual hallucinations and outperforms state-of-the-art methods. |
Unsupervised Fact Checking by Counter-Weighted Positive and Negative Evidential Paths in A Knowledge Graph (2020.coling-main)
Copied to clipboard
| Challenge: | Misinformation spreads across media, community, and knowledge graphs in the Web by human agents and information extraction algorithms. |
| Approach: | They propose a rule-based approach that finds positive and negative evidential paths in a knowledge graph for a given factual statement and calculates a truth score for the given statement by unsupervised ensemble. |
| Outcome: | The proposed approach outperforms the state-of-the-art unsupervised approaches by up to 0.12 AUC-ROC and even outperfies the supervised approach by up 0.05 AUC. |
NegatER: Unsupervised Discovery of Negatives in Commonsense Knowledge Bases (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in knowledge base construction techniques focus on the acquisition of positive (true) KB statements, but negative (false) statements are important for discriminative reasoning. |
| Approach: | They propose a framework that ranks potential negatives in commonsense KBs using a contextual language model. |
| Outcome: | The proposed framework ranks negatives in commonsense KBs using a language model . it yields positives that are more grammatical, coherent, and informative . |
Don’t Mess with Mister-in-Between: Improved Negative Search for Knowledge Graph Completion (2023.eacl-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph completion use a dual-encoding framework with a bottleneck that allows for fast approximate search over a vast collection of candidates. |
| Approach: | They propose to use a dual-encoder framework to find more informative negatives by searching for candidates with high lexical overlaps. |
| Outcome: | The proposed methods improve on the large-scale Wikidata5M dataset and combine different kinds of strategies to achieve state-of-the-art performance. |
SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models (2022.acl-long)
Copied to clipboard
| Challenge: | Text-based methods lag behind graph embedding-based approaches for knowledge graph completion (KGC) |
| Approach: | They propose three types of negatives to improve contrastive learning to improve learning efficiency. |
| Outcome: | The proposed model outperforms embedding-based methods on several benchmark datasets. |
Learning Only from Relevant Keywords and Unlabeled Documents (D19-1)
Copied to clipboard
| Challenge: | Existing methods for document classification are limited due to labeling and privacy concerns. |
| Approach: | They propose a super-vised text classification framework that provides keywords as a hint for classifying a document to a target class. |
| Outcome: | The proposed framework is simple to implement and has flexible choices of models, e.g., linear models or neural networks. |
Towards Unified Representations of Knowledge Graph and Expert Rules for Machine Learning and Reasoning (2022.aacl-main)
Copied to clipboard
| Challenge: | Empirical study shows superiority of proposed method over time-tested knowledge-driven and data-driven methods. |
| Approach: | They propose a cognitive knowledge graph that unifies expert rules and relational facts as the substrate of machine learning and reasoning models. |
| Outcome: | Empirical results show the proposed method superior to time-tested methods . the proposed model can perform both learning and reasoning with labeled data . |
Analyze Like a Venture Capitalist: Information-Gain and Knowledge Enhanced Graph Reasoning for Startup Success Prediction (2026.findings-acl)
Copied to clipboard
| Challenge: | Most venture capital investments fail, while a few deliver outsized returns. |
| Approach: | They propose a framework that synthesizes relational evidence across sources . they propose combining information-gain-driven retriever and knowledge base to ground reasoning . |
| Outcome: | The proposed framework achieves +5.9% F1 and +22.1% Precision@5 over state-of-the-art baselines. |
Training-Free Adaptive Speculative Decoding via Linguistic Priors (2026.findings-acl)
Copied to clipboard
| Challenge: | Speculative decoding (SPD) is a promising technique to accelerate Large Language Models (LLMs). current approaches neglect the inherent heterogeneity of natural language and fail to distinguish between semantically-rich content and structurally-predictable syntax. |
| Approach: | They propose a training-free framework that leverages linguistic priors to enable adaptive drafting and verification. |
| Outcome: | The proposed framework significantly accelerates inference without additional training. |
Claim Check-Worthiness Detection as Positive Unlabelled Learning (2020.findings-emnlp)
Copied to clipboard
| Challenge: | a unified approach to claim check-worthiness detection is a critical component of fact checking systems. |
| Approach: | They propose a unified approach which corrects for misinformation by positive unlabelled learning . they propose citation needed detection from Wikipedia and a ranking task which is a critical component of automatic fact checking systems. |
| Outcome: | The proposed method outperforms the state of the art in two of the three tasks studied in English. |