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.
The success of large-scale language models like GPT can be attributed to their ability to efficiently predict the next token in a sequence. However, these models rely on constant computational effort regardless of the complexity of the token they are predicting, lacking the capacity for iterative refinement. In this paper, we introduce a novel Loop Neural Network, which achieves better performance by utilizing longer computational time without increasing the model size. Our approach revisits the input multiple times, refining the prediction by iteratively looping over a subset of the model with residual connections. We demonstrate the effectiveness of this method through experiments comparing versions of GPT-2 with our loop models, showing improved performance in language modeling tasks while maintaining similar parameter counts. Importantly, these improvements are achieved without the need for extra training data.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2409.14199")
get_code_for_paper("2409.14199")
have("2409.14199")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2409.14199.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2409.14199)
Connect an agent — have() is free.