activity
20122023
most citedRetrieval-Augmented Generation for Knowledge-Intensive NLP Tasks

3.1k citations · 6.9k across the 91 of their papers we have counts for

collaborators
Showing cs.AIShow all

9 papers · 1 filter

cs.AI2020★ 32 cited

Learning Reasoning Strategies in End-to-End Differentiable Proving

Pasquale Minervini, Sebastian Riedel, Pontus Stenetorp +2

Attempts to render deep learning models interpretable, data-efficient, and robust have seen some success through hybridisation with rule-based systems, for example, in Neural Theor…

cs.AI2018★ 17 cited

Logical Rule Induction and Theory Learning Using Neural Theorem Proving

Andres Campero, Aldo Pareja, Tim Klinger +2

A hallmark of human cognition is the ability to continually acquire and distill observations of the world into meaningful, predictive theories. In this paper we present a new mecha…

cs.AI2018★ 16 cited

Towards Neural Theorem Proving at Scale

Pasquale Minervini, Matko Bosnjak, Tim Rocktäschel +1

Neural models combining representation learning and reasoning in an end-to-end trainable manner are receiving increasing interest. However, their use is severely limited by their c…

cs.AI2017★ 22 cited

Adversarial Sets for Regularising Neural Link Predictors

Pasquale Minervini, Thomas Demeester, Tim Rocktäschel +1

In adversarial training, a set of models learn together by pursuing competing goals, usually defined on single data instances. However, in relational learning and other non-i.i.d d…

cs.AI2017★ 42 cited

Knowledge Graph Completion via Complex Tensor Factorization

Théo Trouillon, Christopher R. Dance, Johannes Welbl +3

In statistical relational learning, knowledge graph completion deals with automatically understanding the structure of large knowledge graphs---labeled directed graphs---and predic…

cs.AI2016★ 1.1k cited

Complex Embeddings for Simple Link Prediction

Théo Trouillon, Johannes Welbl, Sebastian Riedel +2

In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to sol…