We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. We have no repository linked to it either. That is a statement about our graph, not about the paper.
In this paper, we systematically analyze the connecting architectures of recurrent neural networks (RNNs). Our main contribution is twofold: first, we present a rigorous graph-theoretic framework describing the connecting architectures of RNNs in general. Second, we propose three architecture complexity measures of RNNs: (a) the recurrent depth, which captures the RNN's over-time nonlinear complexity, (b) the feedforward depth, which captures the local input-output nonlinearity (similar to the "depth" in feedforward neural networks (FNNs)), and (c) the recurrent skip coefficient which captures how rapidly the information propagates over time. We rigorously prove each measure's existence and computability. Our experimental results show that RNNs might benefit from larger recurrent depth and feedforward depth. We further demonstrate that increasing recurrent skip coefficient offers performance boosts on long term dependency problems.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1602.08210")
get_code_for_paper("1602.08210")
have("1602.08210")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1602.08210.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1602.08210)
Connect an agent — have() is free.