201 citations · 466 across the 11 of their papers we have counts for
11 papers
Multiplayer Interactive World Models with Representation Autoencoders
Anthony Hu, Václav Volhejn, Adrien Ramanana Rahary +24
We introduce the first multiplayer world model for highly dynamic environments governed by complex physical interactions. Whereas single-player world models treat the other agents…
Subtraction Gets You More: Gap-Aware Retrieval for Multimodal Multi-Hop QA
Sunah O, Jay-Yoon Lee
In multimodal multi-hop question answering, we focus on the initial retrieval stage via two distinct tasks: (1) evidence set completion, retrieving missing evidence given context,…
Atlas: Few-shot Learning with Retrieval Augmented Language Models
Gautier Izacard, Patrick Lewis, Maria Lomeli +7
Large language models have shown impressive few-shot results on a wide range of tasks. However, when knowledge is key for such results, as is the case for tasks such as question an…
Improving Wikipedia Verifiability with AI
Fabio Petroni, Samuel Broscheit, Aleksandra Piktus +10
Verifiability is a core content policy of Wikipedia: claims that are likely to be challenged need to be backed by citations. There are millions of articles available online and tho…
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
Harsha Vardhan Simhadri, George Williams, Martin Aumüller +9
Despite the broad range of algorithms for Approximate Nearest Neighbor Search, most empirical evaluations of algorithms have focused on smaller datasets, typically of 1 million poi…
Unsupervised Dense Information Retrieval with Contrastive Learning
Gautier Izacard, Mathilde Caron, Lucas Hosseini +4
Recently, information retrieval has seen the emergence of dense retrievers, using neural networks, as an alternative to classical sparse methods based on term-frequency. These mode…
NeurIPS 2020 EfficientQA Competition: Systems, Analyses and Lessons Learned
Sewon Min, Jordan Boyd-Graber, Chris Alberti +50
We review the EfficientQA competition from NeurIPS 2020. The competition focused on open-domain question answering (QA), where systems take natural language questions as input and…
A Memory Efficient Baseline for Open Domain Question Answering
Gautier Izacard, Fabio Petroni, Lucas Hosseini +3
Recently, retrieval systems based on dense representations have led to important improvements in open-domain question answering, and related tasks. While very effective, this appro…
Limits of Mappings
L. Hosseini, J. Nesetril, P. Ossona de Mendez
In this paper we consider a simple algebraic structure --- sets with a single endofunction. We shall see that from the point of view of limits, even this simplest case is both inte…
Treeable Graphings Are Local Limits of Finite Graphs
Lucas Hosseini, Patrice Ossona de Mendez
Let be a graphing, that is a Borel graph defined by measure preserving involutions. We prove that if is {\em treeable} then it arises as the local limit…
Limits of Structures and the Example of Tree-Semilattices
Pierre Charbit, Lucas Hosseini, Patrice Ossona de Mendez
The notion of left convergent sequences of graphs introduced by Lov\' asz et al. (in relation with homomorphism densities for fixed patterns and Szemerédi's regularity lemma) got i…