8 papers
Efficient Listwise Reranking with Compressed Document Representations
Hervé Déjean, Stéphane Clinchant
Reranking, the process of refining the output from a first-stage retriever, is often considered computationally expensive, especially when using Large Language Models (LLMs). A com…
On the Challenges and Opportunities of Learned Sparse Retrieval for Code
Simon Lupart, Maxime Louis, Thibault Formal +2
Retrieval over large codebases is a key component of modern LLM-based software engineering systems. Existing approaches predominantly rely on dense embedding models, while learned…
Retrieval-Augmented LLM Agents: Learning to Learn from Experience
Thomas Palmeira Ferraz, Romain Deffayet, Vassilina Nikoulina +2
While large language models (LLMs) have advanced the development of general-purpose agents, robust generalization to unseen tasks remains challenging. Two common approaches are sup…
Naver Labs Europe @ WSDM CUP | Multilingual Retrieval
Thibault Formal, Maxime Louis, Hervé Déjean +1
This report presents our participation to the WSDM Cup 2026 shared task on multilingual document retrieval from English queries. The task provides a challenging benchmark for cross…
Reranking with Compressed Document Representation
Hervé Déjean, Stéphane Clinchant
Reranking, the process of refining the output of a first-stage retriever, is often considered computationally expensive, especially with Large Language Models. Borrowing from recen…
RANa: Retrieval-Augmented Navigation
Gianluca Monaci, Rafael S. Rezende, Romain Deffayet +5
Methods for navigation based on large-scale learning typically treat each episode as a new problem, where the agent is spawned with a clean memory in an unknown environment. While…
PISCO: Pretty Simple Compression for Retrieval-Augmented Generation
Maxime Louis, Hervé Déjean, Stéphane Clinchant
Retrieval-Augmented Generation (RAG) pipelines enhance Large Language Models (LLMs) by retrieving relevant documents, but they face scalability issues due to high inference costs a…
Let your LLM generate a few tokens and you will reduce the need for retrieval
Hervé Déjean
In this paper, we investigate how efficiently large language models (LLM) can be trained to check whether an answer is already stored in their parametric memory. We distill an LLM-…