← Search

Michiel De Jong

9 accepted papers

2024

MEMORY-VQ: Compression for Tractable Internet-Scale Memory

NAACL 2024short

Retrieval augmentation is a powerful but expensive method to make language models more knowledgeable about the world. Memory-based methods like LUMEN (de Jong et al., 2023a) pre-compute token representations for retrieved passages to drastically speed up inference. However, memory also leads to much…

Cited by 0SourcePDFScholar
2023

CoLT5: Faster Long-Range Transformers with Conditional Computation

EMNLP 2023long main

Many natural language processing tasks benefit from long inputs, but processing long documents with Transformers is expensive -- not only due to quadratic attention complexity but also from applying feedforward and projection layers to every token. However, not all tokens are equally important, espe…

Cited by 0SourceScholar
2023

FiDO: Fusion-in-Decoder optimized for stronger performance and faster inference

ACL 2023findings

Fusion-in-Decoder (FiD) is a powerful retrieval-augmented language model that sets the state-of-the-art on many knowledge-intensive NLP tasks. However, the architecture used for FiD was chosen by making minimal modifications to a standard T5 model, which our analysis shows to be highly suboptimal fo…

Cited by 32SourcePDFScholar
2023

GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints

EMNLP 2023short main

Multi-query attention (MQA), which only uses a single key-value head, drastically speeds up decoder inference. However, MQA can lead to quality degradation, and moreover it may not be desirable to train a separate model just for faster inference. We (1) propose a recipe for uptraining existing multi…

Cited by 0SourceScholar
2023

Pre-computed memory or on-the-fly encoding? A hybrid approach to retrieval augmentation makes the most of your compute

ICML 2023poster

Retrieval-augmented language models such as Fusion-in-Decoder are powerful, setting the state of the art on a variety of knowledge-intensive tasks. However, they are also expensive, due to the need to encode a large number of retrieved passages. Some work avoids this cost by pre-encoding a text corp…

Cited by 14SourcePDFScholar
2023

QA Is the New KR: Question-Answer Pairs as Knowledge Bases

AAAI 2023technical

We propose a new knowledge representation (KR) based on knowledge bases (KBs) derived from text, based on question generation and entity linking. We argue that the proposed type of KB has many of the key advantages of a traditional symbolic KB: in particular, it consists of small modular components…

Cited by 8SourcePDFScholar
2022

Generate-and-Retrieve: Use Your Predictions to Improve Retrieval for Semantic Parsing

COLING 2022main

A common recent approach to semantic parsing augments sequence-to-sequence models by retrieving and appending a set of training samples, called exemplars. The effectiveness of this recipe is limited by the ability to retrieve informative exemplars that help produce the correct parse, which is especi…

Cited by 17SourcePDFScholar
2022

Mention Memory: incorporating textual knowledge into Transformers through entity mention attention

ICLR 2022poster

Natural language understanding tasks such as open-domain question answering often require retrieving and assimilating factual information from multiple sources. We propose to address this problem by integrating a semi-parametric representation of a large text corpus into a Transformer model as a sou…

2021

ReadTwice: Reading Very Large Documents with Memories

NAACL 2021long

Knowledge-intensive tasks such as question answering often require assimilating information from different sections of large inputs such as books or article collections. We propose ReadTwice, a simple and effective technique that combines several strengths of prior approaches to model long-range dep…

Cited by 15SourcePDFScholar