We lifted 1 functions out of this paper's own repositories and ran 1 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| opennlplab/hgrn2 | canonical | 1 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| get_name | Ran | opennlplab/hgrn2/run_lra.py pointer only (licence: NONE) · get_code("a0af9c7fffe0400b") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Hierarchically gated linear RNN (HGRN, \citealt{HGRN}) has demonstrated competitive training speed and performance in language modeling while offering efficient inference. However, the recurrent state size of HGRN remains relatively small, limiting its expressiveness. To address this issue, we introduce a simple outer product-based state expansion mechanism, which significantly enlarges the recurrent state size without introducing any additional parameters. This enhancement also provides a linear attention interpretation for HGRN2, enabling hardware-efficient training. Our extensive experiments verify the advantage of HGRN2 over HGRN consistently across different settings and competitive with other recurrent models.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2404.07904")
get_code_for_paper("2404.07904")
have("2404.07904")
Connect an agent — have() is free.