about
Solving Math Word Problems with Double-Decoder Transformer (arxiv.org)
3 points by sel1 on Aug 31, 2019 | hide | past | pdf | discuss on HN

In plain words: A system reads a math word problem and writes the equation, using two decoders trained together—one writing forward, one backward. It beat word-by-word RNN models, even those with special copying tricks, and the two-decoder version outperformed a single decoder.

Abstract

This paper proposes a Transformer-based model to generate equations for math word problems. It achieves much better results than RNN models when copy and align mechanisms are not used, and can outperform complex copy and align RNN models. We also show that training a Transformer jointly in a generation task with two decoders, left-to-right and right-to-left, is beneficial. Such a Transformer performs better than the one with just one decoder not only because of the ensemble effect, but also because it improves the encoder training procedure. We also experiment with adding reinforcement learning to our model, showing improved performance compared to MLE training.

Yuanliang Meng, Anna Rumshisky
arXiv:1908.10924 · cs.LG, cs.CL · submitted Aug 28, 2019
abstract · pdf · html

add comment on HN