SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1908.07724 · 2019

Restricted Recurrent Neural Networks

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 9 functions out of this paper's own repositories and ran 5 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.

RepositoryRoleRan
diaoenmao/Restricted-Recurrent-Neural-Networks canonical 5 of 9
FunctionStatusWhere it lives
check_integrity Ran diaoenmao/Restricted-Recurrent-Neural-Networks/src/datasets/utils.py
code served (permissive licence) · get_code("c37e20d42c55a32a")
dict_to_device Ran diaoenmao/Restricted-Recurrent-Neural-Networks/src/utils.py
code served (permissive licence) · get_code("e2022ae008215798")
make_bar_updater Ran diaoenmao/Restricted-Recurrent-Neural-Networks/src/datasets/utils.py
code served (permissive licence) · get_code("7bc0666f503dda02")
map_label Ran diaoenmao/Restricted-Recurrent-Neural-Networks/src/process.py
code served (permissive licence) · get_code("85afbfb4e512d555")
ntuple Ran diaoenmao/Restricted-Recurrent-Neural-Networks/src/utils.py
code served (permissive licence) · get_code("db14e8c503156aae")
fetch_dataset Not yet run diaoenmao/Restricted-Recurrent-Neural-Networks/src/data.py
code served (permissive licence) · get_code("c82599e5b607127a")
load Not yet run diaoenmao/Restricted-Recurrent-Neural-Networks/src/utils.py
code served (permissive licence) · get_code("ce3f6616d3f105f8")
parse_summary Not yet run diaoenmao/Restricted-Recurrent-Neural-Networks/src/summary.py
code served (permissive licence) · get_code("4edbc8d9f69c2ee4")
show_result Not yet run diaoenmao/Restricted-Recurrent-Neural-Networks/src/process.py
code served (permissive licence) · get_code("dc24a8a7904fcbcb")

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Recurrent Neural Network (RNN) and its variations such as Long Short-Term Memory (LSTM) and Gated Recurrent Unit (GRU), have become standard building blocks for learning online data of sequential nature in many research areas, including natural language processing and speech data analysis. In this paper, we present a new methodology to significantly reduce the number of parameters in RNNs while maintaining performance that is comparable or even better than classical RNNs. The new proposal, referred to as Restricted Recurrent Neural Network (RRNN), restricts the weight matrices corresponding to the input data and hidden states at each time step to share a large proportion of parameters. The new architecture can be regarded as a compression of its classical counterpart, but it does not require pre-training or sophisticated parameter fine-tuning, both of which are major issues in most existing compression techniques. Experiments on natural language modeling show that compared with its classical counterpart, the restricted recurrent architecture generally produces comparable results at about 50\% compression rate. In particular, the Restricted LSTM can outperform classical RNN with even less number of parameters.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1908.07724")
get_code_for_paper("1908.07724")
have("1908.07724")

Connect an agent — have() is free.