Luca Di Liello, Siddhant Garg, Luca Soldaini, Alessandro Moschitti
Inference tasks such as answer sentence selection (AS2) or fact verification are typically solved by fine-tuning transformer-based models as individual sentence-pair classifiers. Recent studies show that these tasks benefit from modeling dependencies across multiple candidate sentences jointly. In this paper, we first show that popular pre-trained transformers perform poorly when used for fine-tuning on multi-candidate inference tasks. We then propose a new pre-training objective that models the paragraph-level semantics across multiple input sentences. Our evaluation on three AS2 and one fact verification datasets demonstrates the superiority of our pre-training technique over the traditional ones for transformers used as joint models for multi-candidate inference tasks, as well as when used as cross-encoders for sentence-pair formulations of these tasks. Our code and pre-trained models are released at https://github.com/amazon-research/wqa-multi-sentence-inference .
| Task | Dataset | Metric | Value | Model |
|---|---|---|---|---|
| Question Answering | TrecQA | MAP | 0.911 | RoBERTa-Base Joint + MSPP |
| Question Answering | TrecQA | MRR | 0.952 | RoBERTa-Base Joint + MSPP |
| Question Answering | WikiQA | MAP | 0.887 | RoBERTa-Base Joint MSPP |
| Question Answering | WikiQA | MRR | 0.9 | RoBERTa-Base Joint MSPP |
| Question Answering | ASNQ | MAP | 0.673 | RoBERTa-Base Joint MSPP |
| Question Answering | ASNQ | MRR | 0.737 | RoBERTa-Base Joint MSPP |
| Fact Verification | FEVER | Accuracy | 75.36 | RoBERTa-Base Joint MSPP Flexible |
| Fact Verification | FEVER | Accuracy | 74.39 | RoBERTa-Base Joint MSPP |