Can Sequence-to-Sequence Transformers Naturally Understand Sequential Instructions?

26394

Authors

nan

Abstract

AbstractWhile many real-life tasks require reasoning over multi-step sequential instructions, collecting fine-grained annotations for each intermediate step can be prohibitively expensive. In this work, we study how general pretrained sequence-to-sequence transformers perform under varying types of annotation for sequential instruction understanding. We conduct experiments using T5 (Raffel et al., 2020) on a commonly-used multi-step instruction understanding dataset SCONE (Long et al., 2016) that includes three sub-tasks. First, we show that with only gold supervision for the final step of a multi-step instruction sequence, depending on the sequential properties of different tasks, transformers may exhibit extremely bad performance on intermediate steps, in stark contrast with their performance on the final step. Next, we explore two directions to relieve this problem. We show that with the same limited annotation budget, using supervision uniformly distributed across different steps (instead of only final-step supervision), we can greatly improve the performance on intermediate steps with a drop in final-step performance. Further, we explore a contrastive learning approach to provide training signals on intermediate steps with zero intermediate gold supervision. This, however, achieves mixed results. It significantly improves the model’s bad intermediate-step performance on one subtask, but also shows decreased performance on another subtask.

Keywords

nan

Full Content

Proceedings of the The 12th Joint Conference on Lexical and Computational Semantics (*SEM 2023), pages 24–39 July 13-14, 2023 ©2023 Association for Computational Linguistics When Truth Matters – Addressing Pragmatic Categories in Natural Language Inference (NLI) by Large Language Models (LLMs) Reto Gubelmann University of St. Gallen reto.gubelmann@unisg.ch Aikaterini-Lida Kalouli CIS - LMU Munich katerina.kalouli@hotmail.com Christina Niklaus University of St. Gallen christina.niklaus@unisg.ch Siegfried Handschuh University of St. Gallen siegfried.handschuh@unisg.ch Abstract In this paper, we focus on the ability of large language models (LLMs) to accommodate dif- ferent pragmatic sentence types, such as ques- tions, commands, as well as sentence fragments for natural language inference (NLI). On the commonly used notion of logical inference, nothing can be inferred from a question, a com- mand, or an incomprehensible sentence frag- ment. We find MNLI, arguably the most impor- tant NLI dataset, and hence models fine-tuned on this dataset, insensitive to this fact. Using a symbolic semantic parser, we develop and make publicly available, fine-tuning datasets designed specifically to address this issue, with promising results. We also make a first explo- ration of ChatGPT’s concept of entailment. 1 Introduction: “I didn’t say that!’ Committing oneself to the truth of a certain claim always implies or suggests one’s commitment to the truth of a number of other claims, and it pre- cludes one’s commitment to the truth of a second set of claims. This is the essence of the logical no- tion of entailment (here used synonymously with inference) and contradiction. For instance, some- body who claims “Loral did harm national security” is also committed to the less specific claim “Some- thing or somebody did harm national security”. The concept of inference is itself quite complex. As Gubelmann et al. (2022) detail, valid inferences can be divided into deductively valid inferences, where it is not logically (see Plantinga 1974) possi- ble that the premise is true while the conclusion is false, and inductively valid inferences (also called abductions), where it is possible that the premise is true while the conclusion is false, but where the truth of the premise is in general a good reason for the truth of the conclusion. For two utterances to be able to (deductively or inductively) entail or contradict each other, they have to be of the correct pragmatic category. While assertions or claims are able to stand in these logi- cal relationships, the same does not hold for other pragmatic kinds of utterances, such as questions or commands, as they do not involve making a claim that could be true or false and hence commit their author to the truth of certain claims that could then entail or contradict other claims. For instance, uttering (P) in example (1) does not commit the speaker to Loral’s harming of national security – she’s simply asking a question, not making a claim. Hence if, after uttering (P) from (1), somebody replies with “So you claim that somebody did harm national security”, the appropriate response would be “I didn’t say that!”. Neither …

Content truncated to 500 words

Labeled Text

AbstractWhile many real-life tasks require reasoning over multi-step sequential instructions, collecting fine-grained annotations for each intermediate step can be prohibitively expensive. In this work, we study how general pretrained sequence-to-sequence transformers perform under varying types of annotation for sequential instruction understanding. We conduct experiments using T5 (Raffel et al., 2020) on a commonly-used multi-step instruction understanding dataset SCONE (Long et al., 2016) that includes three sub-tasks. First, we show that with only gold supervision for the final step of a multi-step instruction sequence, depending on the sequential properties of different tasks, transformers may exhibit extremely bad performance on intermediate steps, in stark contrast with their performance on the final step. Next, we explore two directions to relieve this problem. We show that with the same limited annotation budget, using supervision uniformly distributed across different steps (instead of only final-step supervision), we can greatly improve the performance on intermediate steps with a drop in final-step performance. Further, we explore a contrastive learning approach to provide training signals on intermediate steps with zero intermediate gold supervision. This, however, achieves mixed results. It significantly improves the model’s bad intermediate-step performance on one subtask, but also shows decreased performance on another subtask.

Publication Details

Paper ID:
26394
Year:
2023
Publication:
TIPSTER
Publication Type:
conf
DOI:
nan