paper-with-me

Papers

Evaluating the Knowledge Base Completion Potential of GPT

2023-10-23 · Blerta Veseli, Simon Razniewski, Jan-Christoph Kalo, Gerhard Weikum

Structured knowledge bases (KBs) are an asset for search engines and other applications, but are inevitably incomplete. Language models (LMs) have been proposed for unsupervised knowledge base completion (KBC), yet, their ability to do this at scale and with high accuracy remains an open question. Prior experimental studies mostly fall short because they only evaluate on popular subjects, or sample already existing facts from KBs. In this work, we perform a careful evaluation of GPT's potential to complete the largest public KB: Wikidata. We find that, despite their size and capabilities, models like GPT-3, ChatGPT and GPT-4 do not achieve fully convincing results on this task. Nonetheless, they provide solid improvements over earlier approaches with smaller LMs. In particular, we show that, with proper thresholding, GPT-3 enables to extend Wikidata by 27M facts at 90% precision.

📄 PDF Abstract BibTeX arXiv:2310.14771

Code (0)

등록된 구현이 없습니다.

Tasks

Knowledge Base Completion

Methods 이 논문이 사용한 방법론

{Dispute@FaQ-s}How to file a dispute with Expedia? How to file a dispute with Expedia? To file a complaint against Expedia, first try contacting their customer service directly. You can reach them by phone at…
Multi-Head Attention 설명 없음
15 Ways to Contact How can i speak to someone at Delta Airlines 설명 없음
Attention 설명 없음
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Position-Wise Feed-Forward Layer 설명 없음
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…

Similar Papers 제목 키워드 기반

On Evaluating Embedding Models for Knowledge Base Completion

2018-10-17 · WS 2019 8 · Yanjie Wang, Daniel Ruffinelli, Rainer Gemulla, Samuel Broscheit 외

Knowledge bases contribute to many web search and mining tasks, yet they are often incomplete. To add missing facts to a given knowledge base, various embedding models have been proposed in the recent literature. Perhaps…

Knowledge Base CompletionQuestion Answering

Evaluating Language Models for Knowledge Base Completion

2023-03-20 · Blerta Veseli, Sneha Singhania, Simon Razniewski, Gerhard Weikum

Structured knowledge bases (KBs) are a foundation of many intelligent applications, yet are notoriously incomplete. Language models (LMs) have recently been proposed for unsupervised knowledge base completion (KBC), yet,…

Knowledge Base Completion

A survey of embedding models of entities and relationships for knowledge graph completion

2017-03-23 · COLING (TextGraphs) 2020 12 · Dat Quoc Nguyen

Knowledge graphs (KGs) of real-world facts about entities and their relationships are useful resources for a variety of natural language processing tasks. However, because knowledge graphs are typically incomplete, it is…

Knowledge Base CompletionKnowledge Graph CompletionKnowledge GraphsLink Prediction

Revisiting Inferential Benchmarks for Knowledge Graph Completion

2023-06-07 · Shuwen Liu, Bernardo Cuenca Grau, Ian Horrocks, Egor V. Kostylev

Knowledge Graph (KG) completion is the problem of extending an incomplete KG with missing facts. A key feature of Machine Learning approaches for KG completion is their ability to learn inference patterns, so that the pr…

Knowledge Graph Completion

Auto-Eval Judge: Towards a General Agentic Framework for Task Completion Evaluation

2025-08-07 · Roshita Bhonsle, Rishav Dutta, Sneha Vavilapalli, Harsh Seth 외 arxiv

The increasing adoption of foundation models as agents across diverse domains necessitates a robust evaluation framework. Current methods, such as LLM-as-a-Judge, focus only on final outputs, overlooking the step-by-step…