Roman Klinger, Emīls Kadik, Vaibhav Srivastav
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The task of abductive natural language inference (αNLI), to decide which hypothesis is the more likely explanation for a set of observations, is a particularly difficult type of NLI. Instead of just determining a causal relationship, it requires common sense to also evaluate how reasonable an explanation is. All recent competitive systems build on top of contextualized representations and make use of transformer architectures for learning an NLI model. When somebody is faced with a particular NLI task, they need to select the best model that is available. This is a time-consuming and resource-intense endeavour. To solve this practical problem, we propose a simple method for predicting the performance without actually fine-tuning the model. We do this by testing how well the pre-trained models perform on the αNLI task when just comparing sentence embeddings with cosine similarity to what the performance that is achieved when training a classifier on top of these embeddings. We show that the accuracy of the cosine similarity approach correlates strongly with the accuracy of the classification approach with a Pearson correlation coefficient of 0.65. Since the similarity computation is orders of magnitude faster to compute on a given dataset (less than a minute vs. hours), our method can lead to significant time savings in the process of model selection.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2202.10408")
get_code_for_paper("2202.10408")
have("2202.10408")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2202.10408.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2202.10408)
Connect an agent — have() is free.