We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1904.03409")
get_code_for_paper("1904.03409")
have("1904.03409")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1904.03409.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1904.03409)
Connect an agent — have() is free.