SCRIPT: A Scalable Continual Reinforcement Learning Framework for Autonomous Penetration Testing
The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625
Scaffolding in Teacher–Student Interaction: A Decade of Research
van de Pol, J., Volman, M., & Beishuizen, J. (2010) · Educational Psychology Review · doi:10.1007/s10648-010-9127-6 · Cited by 1,873
Memory Aware Synapses: Learning What (not) to Forget
Aljundi, R., Babiloni, F., Elhoseiny, M., Rohrbach, M., & Tuytelaars, T. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01219-9_9 · Cited by 1,590
A Comprehensive Survey of Continual Learning: Theory, Method and Application
Wang, L., Zhang, X., Su, H., & Zhu, J. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3367329 · Cited by 1,113
Transfer Learning in Deep Reinforcement Learning: A Survey
Zhu, Z., Lin, K., Jain, A. K., & Zhou, J. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3292075 · Cited by 861
Replication and Analysis of Ebbinghaus’ Forgetting Curve
Murre, J. M. J., & Dros, J. (2015) · PLOS ONE · doi:10.1371/journal.pone.0120644 · Cited by 777
Experience Replay for Continual Learning
Rolnick, D., Ahuja, A., Schwarz, J., Lillicrap, T. P., & Wayne, G. (2018) · arXiv · doi:10.48550/arxiv.1811.11682 · Cited by 529
Rusu, A. A., Colmenarejo, S. G., Gulcehre, C., Desjardins, G., Kirkpatrick, J., Pascanu, R., Mnih, V., Kavukcuoglu, K., & Hadsell, R. (2015) · arXiv · doi:10.48550/arxiv.1511.06295 · Cited by 270
Towards Continual Reinforcement Learning: A Review and Perspectives
Khetarpal, K., Riemer, M., Rish, I., & Precup, D. (2020) · arXiv · doi:10.48550/arxiv.2012.13490 · Cited by 227
Towards Continual Reinforcement Learning: A Review and Perspectives
Khetarpal, K., Riemer, M., Rish, I., & Precup, D. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13673 · Cited by 224
Research works printed but not linked: 31
- Atkinson, 2021, Pseudo-rehearsal: Achieving deep reinforcement learning without catastrophic forgetting, Neurocomputing, 428, 291, 10.1016/j.neucom.2020.11.050 · DOI
- Brehmer, 2005, The dynamic OODA loop: Amalgamating boyd’s OODA loop and the cybernetic approach to command and control, Proceedings International Command &Control Research & Technology Symposium
- Chen, 2023, GAIL-PT: An intelligent penetration testing framework with generative adversarial imitation learning, Computers & Security, 126, 10.1016/j.cose.2022.103055 · DOI · Paper page
- Czarnecki, 2019, Distilling policy distillation, vol. 89, 1331
- Dohare, 2021, Continual backprop: Stochastic gradient descent with persistent randomness, CoRR
- Feng, 2023, Dense reinforcement learning for safety validation of autonomous vehicles, Nature, 615, 620, 10.1038/s41586-023-05732-2 · DOI · Paper page
- Holm, 2023, Lore a red team emulation tool, IEEE Trans. Dependable Secur. Comput., 20, 1596, 10.1109/TDSC.2022.3160792 · DOI
- Hore, 2023, Deep VULMAN: a deep reinforcement learning-enabled cyber vulnerability management framework, Expert Systems with Applications, 221, 10.1016/j.eswa.2023.119734 · DOI
- Hung, S. C. Y., Tu, C., Wu, C., Chen, C., Chan, Y., & Chen, C. (2019). Compacting, Picking and Growing for Unforgetting Continual Learning. In Advances in neural information processing systems 32: annual conference on neural information processing systems 2019, neurIPS 2019, December 8-14, 2019, vancouver, BC, Canada (pp. 13647–13657).
- Ilic, 2024, Distributed web hacking by adaptive consensus-based reinforcement learning, Artificial Intelligence, 326, 10.1016/j.artint.2023.104032 · DOI
- Kaplanis, 2019, Policy consolidation for continual reinforcement learning, vol. 97, 3242
- Kim, 2020, Self-knowledge distillation with progressive refinement of targets, 2021 IEEE/CVF International Conference on Computer Vision (ICCV), 6547
- Kirkpatrick, 2016, Overcoming catastrophic forgetting in neural networks, CoRR
- Lan, 2023, Memory-efficient reinforcement learning with value-based knowledge consolidation, Trans. Mach. Learn. Res., 2023
- Li, 2024, DynPen: Automated penetration testing in dynamic network scenarios using deep reinforcement learning, IEEE Transactions on Information Forensics and Security, 19, 8966, 10.1109/TIFS.2024.3461950 · DOI
- Li, 2023, A hierarchical deep reinforcement learning model with expert prior knowledge for intelligent penetration testing, Computers & Security, 132, 10.1016/j.cose.2023.103358 · doi:10.1016/j.cose.2023.103358
- Maeda, 2021, Automating post-exploitation with deep reinforcement learning, Computers & Security, 100, 10.1016/j.cose.2020.102108 · doi:10.1016/j.cose.2020.102108
- Parisi, 2019, Continual lifelong learning with neural networks: A review, Neural Networks, 113, 54, 10.1016/j.neunet.2019.01.012 · DOI · Paper page
- Powers, 2022, CORA: benchmarks, baselines, and metrics as a platform for continual reinforcement learning agents, vol. 199, 705
- Raffin, 2019, Decoupling feature extraction from policy learning: assessing benefits of state representation learning in goal based robotics, CoRR
- Rusu, 2016, Progressive neural networks, CoRR
- Schneier, 1999, Attack trees, Dr. Dobb’s Journal, 24, 21
- Schwarz, 2018, Progress & compress: A scalable framework for continual learning, vol. 80, 4535
- Sheyner, 2002, Automated generation and analysis of attack graphs, Proceedings 2002 IEEE Symposium on Security and Privacy, 273, 10.1109/SECPRI.2002.1004377 · DOI · Paper page
- Vinyals, 2019, Grandmaster level in StarCraft II using multi-agent reinforcement learning, Nature, 1
- Wang, 2022, Lifelong incremental reinforcement learning with online Bayesian inference, IEEE Trans. Neural Networks Learn. Syst., 33, 4003, 10.1109/TNNLS.2021.3055499 · DOI
- Wang, 2023, A Dirichlet process mixture of robust task models for scalable lifelong reinforcement learning, IEEE Trans. Cybern., 53, 7509, 10.1109/TCYB.2022.3170485 · DOI
- Wang, 2022, Knowledge distillation and student-teacher learning for visual intelligence: A review and new outlooks, IEEE Trans. Pattern Anal. Mach. Intell., 44, 3048, 10.1109/TPAMI.2021.3055564 · DOI · Paper page
- Yang, 2025, Behaviour-diverse automatic penetration testing: a coverage-based deep reinforcement learning approach, Frontiers Comput. Sci., 19, 10.1007/s11704-024-3380-1 · DOI · Paper page
- Zhang, 2023, Dynamics-adaptive continual reinforcement learning via progressive contextualization, IEEE Transactions on Neural Networks and Learning Systems, 1
- Zhou, 2024, APRIL: towards scalable and transferable autonomous penetration testing in large action space via action embedding, IEEE Transactions on Dependable and Secure Computing, 1
Metadata
- Authors
- Zhou, S., Liu, J., Lu, Y., Yang, J., Zhang, Y., Lin, B., Zhong, X., & Hu, S.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2025-08
- Volume
- 285
- Pages
- 127827
- ISSN
- 0957-4174
- Cited by
- 11
- References
- 13
- Language
- en
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/legal/tdmrep-license (tdm)
- doi.org/10.15223/policy-017 (stm-asf)
- doi.org/10.15223/policy-037 (stm-asf)
- doi.org/10.15223/policy-012 (stm-asf)
- doi.org/10.15223/policy-029 (stm-asf)
- doi.org/10.15223/policy-004 (stm-asf)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: SCRIPT: A Scalable Continual Reinforcement Learning Framework for Autonomous Penetration Testing. https://app.cochat.ai/papers/10.1016/j.eswa.2025.127827
- The paper
- Zhou, S., Liu, J., Lu, Y., Yang, J., Zhang, Y., Lin, B., Zhong, X., & Hu, S. (2025). SCRIPT: A Scalable Continual Reinforcement Learning Framework for Autonomous Penetration Testing. Expert Systems with Applications. https://doi.org/10.1016/j.eswa.2025.127827
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.