Improving Top-K Decoding for Non-Autoregressive Semantic Parsing via Intent Conditioning (2022.coling-1)
Copied to clipboard
| Challenge: | Semantic parsing (SP) is a core component of modern virtual assistants like Google Assistant and Amazon Alexa. |
| Approach: | They propose a non-autoregressive (NAR) semantic parser that introduces intent conditioning on the decoder. |
| Outcome: | The proposed model reduces inference latency while maintaining competitive parsing quality. |
Similar Papers
Non-Autoregressive Semantic Parsing for Compositional Task-Oriented Dialog (2021.naacl-main)
Copied to clipboard
| Challenge: | Semantic parsing using sequence-to-sequence models is stymied by higher compute requirements and higher latency. |
| Approach: | They propose a non-autoregressive approach to predict semantic parse trees with an efficient seq2seq model architecture. |
| Outcome: | The proposed architecture achieves an 81% reduction in latency on TOP dataset and retains competitive performance over non-pretrained models on three different semantic parsing datasets. |
Diving into the Decoding Space of Non-Autoregressive Models via Lexically Constrained Search (2026.acl-short)
Copied to clipboard
| Challenge: | Non-autoregressive (NAR) models have been mainly developed to improve decoding efficiency. |
| Approach: | They propose a search-based decoding algorithm which is comparable to the autoregressive Grid Beam Search (GBS) method. |
| Outcome: | The proposed method does not suffer from the MAP degradation issue as the autoregressive method does. |
An Empirical Study of Iterative Refinements for Non-autoregressive Translation (2025.acl-long)
Copied to clipboard
| Challenge: | Iterative non-autoregressive (NAR) models have recently demonstrated impressive performance in varied generation tasks, surpassing the autoregressive Transformer. |
| Approach: | They propose a strategy to conduct efficient refinements without performance declines by using two simple metrics to identify potential problems existing in current refinement processes. |
| Outcome: | The proposed model outperforms the autoregressive Transformer by around one BLEU on average. |
Improving Non-autoregressive Neural Machine Translation with Monolingual Data (2020.acl-main)
Copied to clipboard
| Challenge: | Neural machine translation is usually done via knowledge distillation from an autoregressive (AR) model. |
| Approach: | They leverage large monolingual corpora to improve the NAR model's performance by transferring the autoregressive model' s generalization ability while preventing overfitting. |
| Outcome: | The proposed methods on the WMT14 En-De and WMT16 En-Ro news translation tasks show that monolingual data augmentation improves the NAR model to approach the teacher AR model’s performance. |
Span Pointer Networks for Non-Autoregressive Task-Oriented Semantic Parsing (2021.findings-emnlp)
Copied to clipboard
Akshat Shrivastava, Pierce Chuang, Arun Babu, Shrey Desai, Abhinav Arora, Alexander Zotov, Ahmed Aly
| Challenge: | a novel approach to map utterances to semantic frames is based on non-autoregressive parsers that shift the decoding task from text generation to span prediction. |
| Approach: | They propose a non-autoregressive, task-oriented parser which shifts the decoding task from text generation to span prediction and produces endpoints as opposed to text. |
| Outcome: | The proposed model bridges the quality gap between non-autoregressive and autoregressive parsers, achieving 87 EM on TOPv2 and shows a 70% reduction in latency and 83% reduction in memory at beam size 5 compared to prior non-regressives. |
Pushing the Limits of AMR Parsing with Self-Learning (2020.findings-emnlp)
Copied to clipboard
Young-Suk Lee, Ramón Fernandez Astudillo, Tahira Naseem, Revanth Gangi Reddy, Radu Florian, Salim Roukos
| Challenge: | Abstract Meaning Representation (AMR) parsing has experienced a notable growth in performance in the last two years due to the impact of transfer learning and the development of novel architectures specific to AMR. |
| Approach: | They propose to use AMR annotations to generate synthetic text and refine actions oracle without additional human annotations for AMR parsing. |
| Outcome: | The proposed models improve on AMR 1.0 and 2.0 without human annotations. |
Non-Autoregressive Text Generation with Pre-trained Language Models (2021.eacl-main)
Copied to clipboard
| Challenge: | Autoregressive generation models generate tokens in a left-to-right, token-by-token fashion, resulting in lag in inference. |
| Approach: | They propose to use BERT as the backbone of a non-autoregressive generation model for greatly improved performance. |
| Outcome: | The proposed model outperforms existing non-autoregressive models and achieves competitive performance with many strong autoregressive model. |
Exploring Non-Autoregressive Text Style Transfer (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for text style transfer use autoregressive decoding, but they are slow and low parallelizability. |
| Approach: | They propose a base NAR model by directly adapting the common training scheme from its AutoRegressive counterpart. |
| Outcome: | The proposed model sacrifices performance due to lack of conditional dependence between output tokens . knowledge distillation, contrastive learning, and iterative decoding are employed to improve the model . |
Treepiece: Faster Semantic Parsing via Tree Tokenization (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Autoregressive (AR) encoder-decoder neural networks are slow in sequential prediction of natural language to machine-readable parse trees. |
| Approach: | They propose a technique that tokenizes a parse tree into subtrees and generates one subtrea per decoding step. |
| Outcome: | The proposed approach shows 4.6 times faster decoding speed and comparable speed but significantly higher accuracy compared to non-autoregressive (NAR) models. |
SmBoP: Semi-autoregressive Bottom-up Semantic Parsing (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing semantic parsers decode syntax using a top-down depth-first traversal. |
| Approach: | They propose a semi-autoregressive bottom-up parser that constructs at decoding step t the top-K sub-trees of height t. |
| Outcome: | The proposed method achieves 2.2x speed-up in decoding time and 5x speed up in training time on a zero-shot semantic parsing benchmark. |