Papers by George Zerveas
Parameter-efficient Modularised Bias Mitigation via AdapterFusion (2023.eacl-main)
Copied to clipboard
Deepak Kumar, Oleg Lesota, George Zerveas, Daniel Cohen, Carsten Eickhoff, Markus Schedl, Navid Rekabsaz
| Challenge: | Large pre-trained language models contain societal biases and carry along these biase . Current approaches to mitigate these bias impose debiasing by updating model parameters, effectively transferring model to irreversible debiased state. |
| Approach: | They propose to develop stand-alone debiasing functionalities separate from the model, which can be integrated into the model on-demand while keeping the core model untouched. |
| Outcome: | The proposed approach improves or maintains effectiveness of bias mitigation, avoids catastrophic forgetting in a multi-attribute scenario, and maintains on-par task performance while granting parameter-efficiency and easy switching between the original and debiased models. |
CODER: An efficient framework for improving retrieval through COntextual Document Embedding Reranking (2022.emnlp-main)
Copied to clipboard
| Challenge: | Contextual document embedding reranking is an efficient and efficient retrieval framework. |
| Approach: | They propose a highly efficient retrieval framework that uses contextual document embedding reranking to incorporate ranking context into training. |
| Outcome: | The proposed framework reduces the computational overhead of a first-stage method and can be used as stand-alone retrieval models. |
Beyond Contrastive Learning: Synthetic Data Enables List-wise Training with Multiple Levels of Relevance (2025.findings-emnlp)
Copied to clipboard
| Challenge: | a new approach to training with binary relevance labels uses synthetic data . contrastive learning with binary correlations leaves out subtle nuances useful for ranking . |
| Approach: | They propose to use waterstein distance as a loss function for training transformer-based retrievers with graduated relevance labels instead of real documents. |
| Outcome: | The proposed method outperforms conventional training with InfoNCE by a large margin on MARCO and BEIR benchmarks without using real documents. |
Enhancing the Ranking Context of Dense Retrieval through Reciprocal Nearest Neighbors (2023.emnlp-main)
Copied to clipboard
| Challenge: | Sparse annotation poses persistent challenges to training dense retrieval models . despite potential future endeavors to extend annotation, issue of false negatives persists . |
| Approach: | They propose a method that smooths out the annotation of unlabeled relevant documents . they use reciprocal nearest neighbors to estimate relevance and rerank candidates . |
| Outcome: | The proposed method reduces the issue of false negatives in contrastive learning by reducing sparsity. |