| Challenge: | Recent work has focused on training semantic parsers via weak supervision from denotations alone. |
| Approach: | They propose an iterative training algorithm that alternates between searching for consistent logical forms and maximizing the marginal likelihood of the retrieved ones. |
| Outcome: | The proposed algorithm outperforms the previous best systems on WikiTableQuestions and Cornell Natural Language Visual Reasoning (NLVR) iteratively train models that provide guidance to subsequent models to search for logical forms of increasing complexity, thus dealing with spuriousness. |
Similar Papers
Enforcing Consistency in Weakly Supervised Semantic Parsing (2021.acl-short)
Copied to clipboard
| Challenge: | Existing methods for training semantic parsers from only (utterance, denotation) supervision are challenging. |
| Approach: | They propose to use consistency between output programs for related inputs to reduce the impact of spurious programs. |
| Outcome: | The proposed formalisms improve model performance even without consistency-based training. |
Weakly Supervised Semantic Parsing by Learning from Mistakes (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Weakly supervised semantic parsing requires searching consistent logical forms in a huge space and dealing with spurious logical form. |
| Approach: | They propose a learning framework that trains parsers via utterance-denotation pairs . they use utterrance-logical form pairs created from mistakes to bootstrap parser . |
| Outcome: | The proposed framework outperforms state-of-the-art methods on WikiSQL, TabFact and other datasets. |
Weakly Supervised Semantic Parsing with Abstract Examples (P18-1)
Copied to clipboard
| Challenge: | training semantic parsers from weak supervision complicates training in two ways . spurious programs that accidentally lead to a correct denotation add noise to training . |
| Approach: | They propose to use tokens in both language utterance and program to map denotations to executable programs. |
| Outcome: | The proposed method improves performance and reaches 82.5% accuracy compared to the best reported accuracy so far. |
Ambiguous Learning from Retrieval: Towards Zero-shot Semantic Parsing (2023.acl-long)
Copied to clipboard
Shan Wu, Chunlei Xin, Hongyu Lin, Xianpei Han, Cao Liu, Jiansong Chen, Fan Yang, Guanglu Wan, Le Sun
| Challenge: | Existing neural semantic parsers require a large amount of training data which is expensive and difficult to obtain. |
| Approach: | They propose a framework for a supervised retrieval system based on pretrained language models . they propose ambiguous supervision to improve the precision and coverage of the task . |
| Outcome: | The proposed approach outperforms state-of-the-art zero-shot parsing methods in ambiguous supervision. |
Semantic Parsing with Dual Learning (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to parse natural language queries are limited by lack of labeled data and constrained decoding. |
| Approach: | They propose a semantic parsing framework with the dual learning algorithm that makes full use of data through a dual-learning game. |
| Outcome: | The proposed approach achieves state-of-the-art performance on ATIS dataset and gets competitive performance on overnight dataset. |
Learning Semantic Parsers from Denotations with Latent Structured Alignments and Abstract Programs (D19-1)
Copied to clipboard
| Challenge: | Semantic parsing aims to map natural language utterances onto machine interpretable meaning representations. |
| Approach: | They propose to instill an inductive bias in the parser to help it distinguish between spurious and correct programs. |
| Outcome: | The proposed model is highly tractable on WikiTableQuestions and WikiSQL datasets. |
Reflect, Rewrite, Repeat: How Simple Arithmetic Enables Advanced Reasoning in Small Language Models (2026.findings-eacl)
Copied to clipboard
Mengdie Flora Wang, Haochen Xie, Mun Young Kim, Baishali Chaudhury, Meghana Ashok, Suren Gunturu, Sungmin Hong, Jae Oh Woo
| Challenge: | Recent advances in language model reasoning require computationally intensive reinforcement learning and massive datasets. |
| Approach: | They propose a framework that combines Direct Preference Optimization and Supervised Fine-Tuning with selective guidance from larger models and iteratively refining solutions through a "reflect, rewrite, repeat" cycle. |
| Outcome: | The proposed framework shows significant performance improvements across arithmetic, symbolic and cognitive reasoning benchmarks. |
A Mutual Information Maximization Approach for the Spurious Solution Problem in Weakly Supervised Question Answering (2021.acl-long)
Copied to clipboard
| Challenge: | Weakly supervised question answering usually has only final answers as supervision signals while correct solutions are not provided. |
| Approach: | They propose to explicitly exploit the semantic correlations between question-answer pairs and predicted answers by maximizing mutual information between question and answer pairs. |
| Outcome: | The proposed method significantly outperforms previous learning methods in terms of task performance and is more effective in training models to produce correct solutions. |
Learning to Learn Semantic Parsers from Natural Language Supervision (D18-1)
Copied to clipboard
| Challenge: | Existing logical forms require a user to be familiar with the underlying structure to learn a semantic parser. |
| Approach: | They propose a method for training semantic parsers from natural language feedback . they use natural language inputs to parse feedback to leverage it as a form of supervision . |
| Outcome: | The proposed algorithm learns a semantic parser from users’ corrections expressed in natural language. |
Few-Shot Semantic Parsing for New Predicates (2021.eacl-main)
Copied to clipboard
| Challenge: | a recent study shows that state-of-the-art neural semantic parsers are less accurate when there is only a handful of utterance-logical form pairs per predicate. |
| Approach: | They propose to use a meta-learning method to train a few-shot learning problem . they also propose to regularize attention scores with alignment statistics and apply a smoothing technique . |
| Outcome: | The proposed method outperforms baselines in one and two-shot settings. |