Carlos Lassance

Mr. Carlos Lassance


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2024 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
TFThibault Formal
Thibault Formal
CLCarlos Lassance
Carlos Lassance
BPBenjamin Piwowarski
Benjamin Piwowarski
SCStéphane Clinchant
Stéphane Clinchant
Sparse representation learning based on Pre-trained Language Models has seen a growing interest in Information Retrieval. Such approaches can take advantage of the proven efficiency of inverted indexes and inherit desirable IR priors such as explicit lexical matching or some degree of interpretability. In this work, we thoroughly develop the framework of sparse representation learning in IR, which unifies term weighting and expansion in a supervised setting. We then build on SPLADE—a sparse expansion-based retriever—and show to which extent it is able to benefit from the same training improvements as dense bi-encoders by studying the effect of distillation, hard negative mining, as well as the Pre-trained Language Model’s initialization on itseffectiveness, leading to state-of-the-art results in both in- and out-of-domain evaluation settings (SPLADE++). We furthermore proposeefficiencyimprovements, allowing us to reach latency requirements on par with traditional keyword-based approaches (Efficient-SPLADE).

10 July 2024
Verified
Conference Paper
Open access
EKEhsan Kamalloo
Ehsan Kamalloo
NTNandan Thakur
Nandan Thakur
CLCarlos Lassance
Carlos Lassance
XMXueguang Ma
Xueguang Ma
JYJheng-Hong Yang
Jheng-Hong Yang
JLJimmy Lin
Jimmy Lin
BEIR is a benchmark dataset originally designed for zero-shot evaluation of retrieval models across 18 different domain/task combinations. In recent years, we have witnessed the growing popularity of models based on representation learning, which naturally begs the question: How effective are these models when presented with queries and documents that differ from the training data? While BEIR was designed to answer this question, our work addresses two shortcomings that prevent the benchmark from achieving its full potential: First, the sophistication of modern neural methods and the complexity of current software infrastructure create barriers to entry for newcomers. To this end, we provide reproducible reference implementations that cover learned dense and sparse models. Second, comparisons on BEIR are performed by reducing scores from heterogeneous datasets into a single average that is difficult to interpret. To remedy this, we present meta-analyses focusing on effect sizes across datasets that are able to accurately quantify model differences. By addressing both shortcomings, our work facilitates future explorations in a range of interesting research questions.

18 July 2023
Verified
Conference Paper
Open access
CLCarlos Lassance
Carlos Lassance
SLSimon Lupart
Simon Lupart
HDHervé Déjean
Hervé Déjean
SCStéphane Clinchant
Stéphane Clinchant
NTNicola Tonellotto
Nicola Tonellotto

5 February 2021 in APSIPA Transactions on Signal and Information Processing
Verified
Journal Article
Open access
PDF file
CLCarlos Lassance
Carlos Lassance
VGVincent Gripon
Vincent Gripon
AOAntonio Ortega
Antonio Ortega
For the past few years, deep learning (DL) robustness (i.e. the ability to maintain the same decision when inputs are subject to perturbations) has become a question of paramount importance, in particular in settings where misclassification can have dramatic consequences. To address this question, authors have proposed different approaches, such as adding regularizers or training using noisy examples. In this paper we introduce a regularizer based on the Laplacian of similarity graphs obtained from the representation of training data at each layer of the DL architecture. This regularizer penalizes large changes (across consecutive layers in the architecture) in the distance between examples of different classes, and as such enforces smooth variations of the class boundaries. We provide theoretical justification for this regularizer and demonstrate its effectiveness to improve robustness on classical supervised learning vision datasets for various types of perturbations. We also show it can be combined with existing methods to increase overall robustness.

17 March 2023
Verified
Book Chapter
Closed access
PDF file
CLCarlos Lassance
Carlos Lassance
HDHervé Dejean
Hervé Dejean
SCStéphane Clinchant
Stéphane Clinchant

18 July 2023
Verified
Conference Paper
Open access
JYJheng-Hong Yang
Jheng-Hong Yang
CLCarlos Lassance
Carlos Lassance
RRRafael Sampaio De Rezende
Rafael Sampaio De Rezende
KSKrishna Srinivasan
Krishna Srinivasan
MRMiriam Redi
Miriam Redi
JLJimmy Lin
Jimmy Lin
This paper presents the AToMiC (Authoring Tools for Multi media Content) dataset, designed to advance research in image/text cross-modal retrieval. While vision--language pretrained transformers have led to significant improvements in retrieval effectiveness, existing research has relied on image-caption datasets that feature only simplistic image--text relationships and underspecified user models of retrieval tasks. To address the gap between these oversimplified settings and real-world applications for multimedia content creation, we introduce a new approach for building retrieval test collections. We leverage hierarchical structures and diverse domains of texts, styles, and types of images, as well as large-scale image--document associations embedded in Wikipedia. We formulate two tasks based on a realistic user model and validate our dataset through retrieval experiments using baseline models. AToMiC offers a testbed for scalable, diverse, and reproducible multimedia retrieval research. Finally, our dataset provides the basis for a dedicated track at the 2023 Text Retrieval Conference (TREC), and is publicly available at https://github.com/TREC-AToMiC/AToMiC.