What If: Generating Code to Answer Simulation Questions
Not on the map. Why?
Abstract (arXiv)
Many texts, especially in chemistry and biology, describe complex processes. We focus on texts that describe a chemical reaction process and questions that ask about the process's outcome under different environmental conditions. To answer questions about such processes, one needs to understand the interactions between the different entities involved in the process and to simulate their state transitions during the process execution under different conditions. A state transition is defined as the memory modification the program does to the variables during the execution. We hypothesize that generating code and executing it to simulate the process will allow answering such questions. We, therefore, define a domain-specific language (DSL) to represent processes. We contribute to the community a unique dataset curated by chemists and annotated by computer scientists. The dataset is composed of process texts, simulation questions, and their corresponding computer codes represented by the DSL.We propose a neural program synthesis approach based on reinforcement learning with a novel state-transition semantic reward. The novel reward is based on the run-time semantic similarity between the predicted code and the reference code. This allows simulating complex process transitions and thus answering simulation questions. Our approach yields a significant boost in accuracy for simulation questions: 88% accuracy as opposed to 83% accuracy of the state-of-the-art neural program synthesis approaches and 54% accuracy of state-of-the-art end-to-end text-based approaches.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 24 of its 37 references that are in the map. First posted on arXiv 16 Apr 2022.
Builds on
24 of 37 references.
References · 24
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,811
- 2018Deep contextualized word representationscited by 2,290
- 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,554
- 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 903
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
- 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 662
12 more
- 2015Sequence Level Training with Recurrent Neural Networkscited by 576
- 2018SWAG: A Large-Scale Adversarial Dataset for Grounded Commonsense Inferencecited by 333
- 2016Language to Logical Form with Neural Attentioncited by 158
- 2016Data Recombination for Neural Semantic Parsingcited by 111
- 2018Coarse-to-Fine Decoding for Neural Semantic Parsingcited by 110
- 2020Birds have four legs?! NumerSense: Probing Numerical Commonsense Knowledge of Pre-trained Language Modelscited by 110
- 2016Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervisioncited by 103
- 2019A Discrete Hard EM Approach for Weakly Supervised Question Answeringcited by 78
- 2019WIQA: A dataset for "What if..." reasoning over procedural textcited by 71
- 2018Deep Reinforcement Learning For Sequence to Sequence Modelscited by 39
- 2018Interactive Semantic Parsing for If-Then Recipes via Hierarchical Reinforcement Learningcited by 7
- 2019On Policy Gradientscited by 6
Built on by
Citing papers per year: 2024: 2.
2 papers.