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, achieving robust generalization to unseen tasks remains a significant challenge. Current…
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…
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…
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…