%0 Conference Proceedings %T Parallelizable Stack Long Short-Term Memory %A Ding, Shuoyang %A Koehn, Philipp %Y Martins, Andre %Y Vlachos, Andreas %Y Kozareva, Zornitsa %Y Ravi, Sujith %Y Lampouras, Gerasimos %Y Niculae, Vlad %Y Kreutzer, Julia %S Proceedings of the Third Workshop on Structured Prediction for NLP %D 2019 %8 June %I Association for Computational Linguistics %C Minneapolis, Minnesota %F ding-koehn-2019-parallelizable %X Stack Long Short-Term Memory (StackLSTM) is useful for various applications such as parsing and string-to-tree neural machine translation, but it is also known to be notoriously difficult to parallelize for GPU training due to the fact that the computations are dependent on discrete operations. In this paper, we tackle this problem by utilizing state access patterns of StackLSTM to homogenize computations with regard to different discrete operations. Our parsing experiments show that the method scales up almost linearly with increasing batch size, and our parallelized PyTorch implementation trains significantly faster compared to the Dynet C++ implementation. %R 10.18653/v1/W19-1501 %U https://aclanthology.org/W19-1501 %U https://doi.org/10.18653/v1/W19-1501 %P 1-6