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.
Sophisticated gated recurrent neural network architectures like LSTMs and GRUs have been shown to be highly effective in a myriad of applications. We develop an un-gated unit, the statistical recurrent unit (SRU), that is able to learn long term dependencies in data by only keeping moving averages of statistics. The SRU's architecture is simple, un-gated, and contains a comparable number of parameters to LSTMs; yet, SRUs perform favorably to more sophisticated LSTM and GRU alternatives, often outperforming one or both in various tasks. We show the efficacy of SRUs as compared to LSTMs and GRUs in an unbiased manner by optimizing respective architectures' hyperparameters in a Bayesian optimization scheme for both synthetic and real-world tasks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1703.00381")
get_code_for_paper("1703.00381")
have("1703.00381")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1703.00381.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1703.00381)
Connect an agent — have() is free.