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.
In recent studies, linear recurrent neural networks (LRNNs) have achieved Transformer-level performance in natural language and long-range modeling, while offering rapid parallel training and constant inference cost. With the resurgence of interest in LRNNs, we study whether they can learn the hidden rules in training sequences, such as the grammatical structures of regular language. We theoretically analyze some existing LRNNs and discover their limitations in modeling regular language. Motivated by this analysis, we propose a new LRNN equipped with a block-diagonal and input-dependent transition matrix. Experiments suggest that the proposed model is the only LRNN capable of performing length extrapolation on regular language tasks such as Sum, Even Pair, and Modular Arithmetic. The code is released at \url{https://github.com/tinghanf/RegluarLRNN}.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2309.07412")
get_code_for_paper("2309.07412")
have("2309.07412")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2309.07412.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2309.07412)
Connect an agent — have() is free.