Optimizing the Running Time of a Trigger Search Algorithm Based on the Principles of Formal Verification of Artificial Neural Networks

Authors

  • Aleksey Tonkikh

  • Ekaterina Stroeva

Keywords:

formal verification, machine learning, trigger injection attacks, backdoor attacks your

Abstract

The article examines the problem of scalability of the algorithm for searching for a trigger in images which is based on the operating principle of the Deep Poly formal verification algorithm The existing implementation had a number of shortcomings According to them the requirements for the optimized version of the algorithm were formulated which were brought to practical implementation Achieved 4 times acceleration compared to the original implementation

Downloads

How to Cite

Aleksey Tonkikh, & Ekaterina Stroeva. (2024). Optimizing the Running Time of a Trigger Search Algorithm Based on the Principles of Formal Verification of Artificial Neural Networks. Global Journal of Computer Science and Technology, 24(D1), 11–19. Retrieved from https://computerresearch.org/index.php/computer/article/view/102389

Optimizing the Running Time of a Trigger Search Algorithm Based on the Principles of Formal Verification of Artificial Neural Networks

Published

2024-08-28