ArrayLSTM
This code was implemented as part of the IEEE S&P DeepCASE [1] paper. We provide a Pytorch implementation of Recurrent Memory Array Structures by Kamil M Rocki. We ask people to cite both works when using the software for academic research papers.
Introduction
The following report introduces ideas augmenting standard Long Short Term Memory (LSTM) architecture with multiple memory cells per hidden unit in order to improve its generalization capabilities. It considers both deterministic and stochastic variants of memory operation. It is shown that the nondeterministic Array-LSTM approach improves state-of-the-art performance on character level text prediction achieving 1.402 BPC on enwik8 dataset. Furthermore, this report estabilishes baseline neural-based results of 1.12 BPC and 1.19 BPC for enwik9 and enwik10 datasets respectively.
Documentation
We provide an extensive documentation including installation instructions and reference at arraylstm.readthedocs.io
References
[1] van Ede, T., Aghakhani, H., Spahn, N., Bortolameotti, R., Cova, M., Continella, A., van Steen, M., Peter, A., Kruegel, C. & Vigna, G. (2022, May). DeepCASE: Semi-Supervised Contextual Analysis of Security Events. In 2022 Proceedings of the IEEE Symposium on Security and Privacy (S&P). IEEE.
[2] Rocki, K.M. (2016). Recurrent memory array structures. In arXiv preprint arXiv:1607.03085.
Bibtex
@inproceedings{vanede2020deepcase,
title={{DeepCASE: Semi-Supervised Contextual Analysis of Security Events}},
author={van Ede, Thijs and Aghakhani, Hojjat and Spahn, Noah and Bortolameotti, Riccardo and Cova, Marco and Continella, Andrea and van Steen, Maarten and Peter, Andreas and Kruegel, Christopher and Vigna, Giovanni},
booktitle={Proceedings of the IEEE Symposium on Security and Privacy (S&P)},
year={2022},
organization={IEEE}
}
@article{rocki2016recurrent,
title={Recurrent memory array structures},
author={Rocki, Kamil},
journal={arXiv preprint arXiv:1607.03085},
year={2016}
}
Metadata
Release files for array-lstm 0.0.1
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| array-lstm-0.0.1.tar.gz | 64.7 kB | Details |
Built distribution (wheel)
| File | Interpreter | ABI | Platform | Reset |
|---|---|---|---|---|
| array_lstm-0.0.1-py3-none-any.whl | Python 3 | none | any | Details |
Total release size: 73.8 kB
Release files / array-lstm-0.0.1.tar.gz
| Download URL | array-lstm-0.0.1.tar.gz |
|---|---|
| Size | 64.7 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
60a841c39833910688ecb8fe016b2480dd26d89cf973ebc19d32081f951a7937
|
|
BLAKE2b-256 checksum How to use checksums |
ed85dff429f33f34c041100e149f0ccdbcdfcecf96d554f1ceeecbb896e4c3dd
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
| Uploaded via |
twine/3.4.1 importlib_metadata/3.7.3 pkginfo/1.7.1 requests/2.25.1 requests-toolbelt/0.9.1 tqdm/4.56.0 CPython/3.8.10
|
Release files / array_lstm-0.0.1-py3-none-any.whl
| Download URL | array_lstm-0.0.1-py3-none-any.whl |
|---|---|
| Size | 9.1 kB |
| Tags | Python 3 |
|
SHA-256 checksum How to use checksums |
191b4d0b14f605c1c02b0c62f8da63799450917a4320297213710de4926ed905
|
|
BLAKE2b-256 checksum How to use checksums |
ff11c0156bb183a76223195fb096a37a61d6492e50eb17667dbaf368b80f2e88
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
| Uploaded via |
twine/3.4.1 importlib_metadata/3.7.3 pkginfo/1.7.1 requests/2.25.1 requests-toolbelt/0.9.1 tqdm/4.56.0 CPython/3.8.10
|