2020 · 12 citations · 4 references
ComputingComputer ScienceComputational LinguisticsMachine LearningNatural Language ProcessingLanguage ModelingLanguage ModelsNatural Language UnderstandingAbductive InferenceAbductive ReasoningCross-entropy LossLearningLearning To RankLearning To Rank Loss FunctionsNatural Language InferenceReasoning Ability
The abductive natural language inference task (αNLI) is proposed to evaluate the abductive reasoning ability of a learning system. In the αNLI task, two observations are given and the most plausible hypothesis is asked to pick out from the candidates. Existing methods simply formulate it as a classification problem, thus a cross-entropy log-loss objective is used during training. However, discriminating true from false does not measure the plausibility of a hypothesis, for all the hypotheses have a chance to happen, only the probabilities are different. To fill this gap, we switch to a ranking perspective that sorts the hypotheses in order of their plausibilities. With this new perspective, a novel L2R2 approach is proposed under the learning-to-rank framework. Firstly, training samples are reorganized into a ranking form, where two observations and their hypotheses are treated as the query and a set of candidate documents respectively. Then, an ESIM model or pre-trained language model, e.g. BERT or RoBERTa, is obtained as the scoring function. Finally, the loss functions for the ranking task can be either pair-wise or list-wise for training. The experimental results on the ART dataset reach the state-of-the-art in the public leaderboard.
4
Learning to rank using gradient descent
Chris Burges, Tal Shaked, Erin Renshaw et al. · 2005 · 2.8K citations
Zhe Cao, Tao Qin, Tie‐Yan Liu et al. · 2007 · 2K citations
Enhanced LSTM for Natural Language Inference
Qian Chen, Xiaodan Zhu, Zhen-Hua Ling et al. · 2017 · 1.2K citations · Full text
Listwise approach to learning to rank
Fen Xia, Tie‐Yan Liu, Jue Wang et al. · 2008 · 701 citations