<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Computational nanotechnology</journal-id><journal-title-group><journal-title xml:lang="en">Computational nanotechnology</journal-title><trans-title-group xml:lang="ru"><trans-title>Computational nanotechnology</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2313-223X</issn><issn publication-format="electronic">2587-9693</issn><publisher><publisher-name xml:lang="en">YUR-VAK</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">309715</article-id><article-id pub-id-type="doi">10.33693/2313-223X-2025-12-2-28-36</article-id><article-id pub-id-type="edn">QGDHYM</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>CYBERSECURITY</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>КИБЕРБЕЗОПАСНОСТЬ</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Analysis of the effectiveness and robustness of neural networks with early exits in computer vision tasks</article-title><trans-title-group xml:lang="ru"><trans-title>Анализ эффективности и робастности нейронных сетей с ранними выходами в задачах компьютерного зрения</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-1154-6151</contrib-id><contrib-id contrib-id-type="spin">4334-5520</contrib-id><name-alternatives><name xml:lang="en"><surname>Chesalin</surname><given-names>Alexander N.</given-names></name><name xml:lang="ru"><surname>Чесалин</surname><given-names>Александр Николаевич</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Cand. Sci. (Eng.), Associate Professor; Head, Department of Computer and Information Security, Institute of Artificial Intelligence</p></bio><bio xml:lang="ru"><p>кандидат технических наук, доцент; заведующий, кафедра компьютерной и информационной безопасности, Институт искусственного интеллекта</p></bio><email>chesalin_an@mail.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="spin">4948-2180</contrib-id><name-alternatives><name xml:lang="en"><surname>Stavtsev</surname><given-names>Alexey V.</given-names></name><name xml:lang="ru"><surname>Ставцев</surname><given-names>Алексей Вячеславович</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Cand. Sci. (Phys.-Math.); associate professor, Department of Computer and Information Security, Institute of Artificial Intelligence</p></bio><bio xml:lang="ru"><p>кандидат физико-математических наук; доцент, кафедра компьютерной и информационной безопасности, Институт искусственного интеллекта</p></bio><email>stavcev@mirea.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="spin">1935-5513</contrib-id><name-alternatives><name xml:lang="en"><surname>Ushkova</surname><given-names>Nadezhda N.</given-names></name><name xml:lang="ru"><surname>Ушкова</surname><given-names>Надежда Николаевна</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>senior lecturer, Department of Computer and Information Security, Institute of Artificial Intelligence</p></bio><bio xml:lang="ru"><p>старший преподаватель, кафедра компьютерной и информационной безопасности, Институт искусственного интеллекта</p></bio><email>ushkova@mirea.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0001-1450-0714</contrib-id><contrib-id contrib-id-type="spin">7264-9403</contrib-id><name-alternatives><name xml:lang="en"><surname>Charugin</surname><given-names>Valentin V.</given-names></name><name xml:lang="ru"><surname>Чаругин</surname><given-names>Валентин Валерьевич</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>lecturer, Department of Computer and Information Security, Institute of Artificial Intelligence</p></bio><bio xml:lang="ru"><p>преподаватель, кафедра компьютерной и информационной безопасности, Институт искусственного интеллекта</p></bio><email>сharugin_v@mirea.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0003-4950-7726</contrib-id><contrib-id contrib-id-type="spin">4080-4997</contrib-id><name-alternatives><name xml:lang="en"><surname>Charugin</surname><given-names>Valery V.</given-names></name><name xml:lang="ru"><surname>Чаругин</surname><given-names>Валерий Валерьевич</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>lecturer, Department of Computer and Information Security, Institute of Artificial Intelligence</p></bio><bio xml:lang="ru"><p>преподаватель, кафедра компьютерной и информационной безопасности, Институт искусственного интеллекта</p></bio><email>сharugin@mirea.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">MIREA – Russian Technological University</institution></aff><aff><institution xml:lang="ru">МИРЭА – Российский технологический университет</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2025-08-19" publication-format="electronic"><day>19</day><month>08</month><year>2025</year></pub-date><volume>12</volume><issue>2</issue><fpage>28</fpage><lpage>36</lpage><history><date date-type="received" iso-8601-date="2025-09-18"><day>18</day><month>09</month><year>2025</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2025, Yur-VAK</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2025, Юр-ВАК</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="en">Yur-VAK</copyright-holder><copyright-holder xml:lang="ru">Юр-ВАК</copyright-holder><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://www.urvak.ru/contacts/</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rcsi.science/2313-223X/article/view/309715">https://journals.rcsi.science/2313-223X/article/view/309715</self-uri><abstract xml:lang="en"><p>Many embedded systems and Internet of Things (IoT) devices use neural network algorithms for various information processing tasks. At the same time, developers face the problem of insufficient computing resources for effective functioning, especially in real-time (pseudo-) tasks. In this regard, the urgent task is to find a balance between the quality of the results and computational complexity. One of the ways to increase the computational efficiency of neural networks is to use neural network architectures with early exits (for example, BranchyNet), which allow making decisions before passing through all layers of the neural network, depending on the source data for a given reliability of the results. <bold>The purpose of the study:</bold> to analyze the applicability, effectiveness and robustness of neural networks with early exits (BranchyResNet18) in computer vision tasks. The analysis is based on the GTSRB road sign dataset. <bold>The research methodology</bold> is an experimental efficiency analysis based on the calculation of the number of floating-point operations (FLOP) to obtain results with a given accuracy, and an experimental robustness analysis based on the generation of various noise effects and adversarial attacks. <bold>Research results:</bold> estimates of the effectiveness of neural networks with early exit and their robustness to unintended and intentional disturbances have been obtained.</p></abstract><trans-abstract xml:lang="ru"><p>Во многих встраиваемых системах и устройствах интернета вещей (IoT) применяются нейросетевые алгоритмы для различных задач обработки информации. При этом разработчики сталкиваются с проблемой недостаточности вычислительных ресурсов для эффективного функционирования, особенно в задачах реального (псевдо) времени. В связи с этим актуальной является задача нахождение баланса между качеством результатов и вычислительной сложностью. Одним из способов повышения вычислительной эффективности нейронных сетей, является применение архитектур нейронных сетей с ранними выходами (например, BranchyNet), позволяющие принимать решения до прохождения всех слоев нейронной сети, в зависимости от исходных данных при заданной достоверности результатов. <bold>Цель исследования:</bold> провести анализ применимости, эффективности и робастности нейронных сетей с ранними выходами (BranchyResNet18) в задачах компьютерного зрения. Анализ проводится на основе набора данных дорожных знаков GTSRB. <bold>Методология исследования</bold> представляет собой экспериментальный анализ эффективности на основе расчета количества операций с плавающей запятой (FLOP) для получения результатов с заданной точностью, и экспериментальный анализ робастности на основе генерации различных шумовых воздействий и состязательных атак. <bold>Результаты исследования:</bold> получены оценки эффективности нейронных сетей с ранним выходом и их робастность к непреднамеренным и преднамеренным возмущениям.</p></trans-abstract><kwd-group xml:lang="en"><kwd>neural networks with early exit</kwd><kwd>improving the efficiency of neural networks</kwd><kwd>robustness</kwd><kwd>adversarial attacks</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>нейронные сети с ранним выходом</kwd><kwd>повышение эффективности нейронных сетей</kwd><kwd>робастность</kwd><kwd>состязательные атаки</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">Jacob B., Kligys S., Chen B. et al. Quantization and training of neural networks for efficient integer-arithmetic-only inference. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 2018. Pp. 2704–2713. URL: https://arxiv.org/abs/1712.05877</mixed-citation><mixed-citation xml:lang="ru">Jacob B., Kligys S., Chen B. et al. Quantization and training of neural networks for efficient integer-arithmetic-only inference // Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 2018. Pp. 2704–2713. URL: https://arxiv.org/abs/1712.05877</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">Torkunova Yu.V., Milovanov D.V. Optimization of neural networks: Methods and their comparison using the example of text mining. International Journal of Advanced Studies. 2023. Vol. 13. No. 4. Pp. 142–158. (In Rus.). DOI: 10.12731/2227-930X2023-13-4-142-158.</mixed-citation><mixed-citation xml:lang="ru">Торкунова Ю.В., Милованов Д.В. Оптимизация нейронных сетей: методы и их сравнение на примере интеллектуального анализа текста // International Journal of Advanced Studies. 2023. Т. 13. № 4. C. 142–158. DOI: 10.12731/2227-930X2023-13-4-142-158.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">Han S., Pool J., Tran J., Dally W.J. Learning both weights and connections for efficient neural networks. In: Advances in Neural Information Processing Systems (NeurIPS). 2015. URL: https://arxiv.org/abs/1506.02626</mixed-citation><mixed-citation xml:lang="ru">Han S., Pool J., Tran J., Dally W.J. Learning both weights and connections for efficient neural networks // Advances in Neural Information Processing Systems (NeurIPS). 2015. URL: https://arxiv.org/abs/1506.02626</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">Denton E.L., Zaremba W., Bruna J. et al. Exploiting linear structure within convolutional networks for efficient evaluation. In: Advances in Neural Information Processing Systems (NeurIPS). 2014. URL: https://arxiv.org/abs/1404.0736</mixed-citation><mixed-citation xml:lang="ru">Denton E.L., Zaremba W., Bruna J. et al. Exploiting linear structure within convolutional networks for efficient evaluation // Advances in Neural Information Processing Systems (NeurIPS). 2014. URL: https://arxiv.org/abs/1404.0736</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">Hinton G., Vinyals O., Dean J. Distilling the knowledge in a neural network. arXiv Preprint arXiv:1503.02531. 2015. URL: https://arxiv.org/abs/1503.02531</mixed-citation><mixed-citation xml:lang="ru">Hinton G., Vinyals O., Dean J. Distilling the knowledge in a neural network // arXiv Preprint arXiv:1503.02531. 2015. URL: https://arxiv.org/abs/1503.02531</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">Ivanov E.A., Mamonova T.E. Comparison of neural network model compression methods when used on a microcontroller. In: Youth and modern information technologies. Proceedings of the XXI International Scientific and Practical Conference of Students, Postgraduates and Young Scientists (Tomsk, April 15–18, 2024). Tomsk, 2024. Pp. 176–180.</mixed-citation><mixed-citation xml:lang="ru">Иванов Е.А., Мамонова Т.Е. Сравнение методов сжатия модели нейронной сети при использовании на микроконтроллере // Молодежь и современные информационные технологии: сборник трудов XXI Междунар. науч.-практ. конф. студентов, аспирантов и молодых ученых (Томск, 15–18 апреля 2024 г.). Томск, 2024. C. 176–180.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">Ullrich K., Meeds E., Welling M. Soft weight-sharing for neural network compression. In: International Conference on Learning Representations (ICLR). 2017. URL: https://arxiv.org/abs/1702.04008</mixed-citation><mixed-citation xml:lang="ru">Ullrich K., Meeds E., Welling M. Soft weight-sharing for neural network compression // International Conference on Learning Representations (ICLR). 2017. URL: https://arxiv.org/abs/1702.04008</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">Scardapane S., Scarpiniti M., Baccarelli E., Uncini A. Why should we add early exits to neural networks? arXiv Preprint arXiv:2004.12814. 2020. URL: https://arxiv.org/abs/2004.12814</mixed-citation><mixed-citation xml:lang="ru">Scardapane S., Scarpiniti M., Baccarelli E., Uncini A. Why should we add early exits to neural networks? // arXiv Preprint arXiv:2004.12814. 2020. URL: https://arxiv.org/abs/2004.12814</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">Cheng Y., Wang D., Zhou P., Zhang T. A Survey of model compression and acceleration for deep neural networks. arXiv Preprint arXiv:1710.09282. 2017. URL: https://arxiv.org/abs/1710.09282</mixed-citation><mixed-citation xml:lang="ru">Cheng Y., Wang D., Zhou P., Zhang T. A Survey of model compression and acceleration for deep neural networks // arXiv Preprint arXiv:1710.09282. 2017. URL: https://arxiv.org/abs/1710.09282</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">Bajpai D.J., Hanawal M.K. A survey of early exit deep neural networks in NLP. arXiv Preprint arXiv:2501.07670. 2025. URL: https://arxiv.org/abs/2501.07670</mixed-citation><mixed-citation xml:lang="ru">Bajpai D.J., Hanawal M.K. A survey of early exit deep neural networks in NLP // arXiv Preprint arXiv:2501.07670. 2025. URL: https://arxiv.org/abs/2501.07670</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">Panda P., Sengupta A., Roy K. Conditional deep learning for energy-efficient and enhanced pattern recognition. In: Design, Automation &amp; Test in Europe Conference (DATE). 2016. Pp. 475–480.</mixed-citation><mixed-citation xml:lang="ru">Panda P., Sengupta A., Roy K. Conditional deep learning for energy-efficient and enhanced pattern recognition // Design, Automation &amp; Test in Europe Conference (DATE). 2016. Pp. 475–480.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">Teerapittayanon S., McDanel B., Kung H.T. BranchyNet: Fast inference via early exiting from deep neural networks. arXiv Preprint arXiv:1709.01686. 2017. URL: https://arxiv.org/abs/1709.01686</mixed-citation><mixed-citation xml:lang="ru">Teerapittayanon S., McDanel B., Kung H.T. BranchyNet: Fast inference via early exiting from deep neural networks // arXiv Preprint arXiv:1709.01686. 2017. URL: https://arxiv.org/abs/1709.01686</mixed-citation></citation-alternatives></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">Kaya Y., Hong S., Dumitras T. Shallow-deep networks: Understanding and mitigating network overthinking. In: Proceedings of the 36th International Conference on Machine Learning (ICML). 2019. Pp. 3301–3310.</mixed-citation><mixed-citation xml:lang="ru">Kaya Y., Hong S., Dumitras T. Shallow-deep networks: Understanding and mitigating network overthinking // Proceedings of the 36th International Conference on Machine Learning (ICML). 2019. Pp. 3301–3310.</mixed-citation></citation-alternatives></ref><ref id="B14"><label>14.</label><citation-alternatives><mixed-citation xml:lang="en">Laskaridis S., Venieris S.I., Almeida M. et al. SPINN: Synergistic progressive inference of neural networks over device and cloud. In: Proceedings of the 26th Annual International Conference on Mobile Computing and Networking (MobiCom’20). 2020. Pp. 1–15.</mixed-citation><mixed-citation xml:lang="ru">Laskaridis S., Venieris S.I., Almeida M. et al. SPINN: Synergistic progressive inference of neural networks over device and cloud // Proceedings of the 26th Annual International Conference on Mobile Computing and Networking (MobiCom’20). 2020. Pp. 1–15.</mixed-citation></citation-alternatives></ref><ref id="B15"><label>15.</label><citation-alternatives><mixed-citation xml:lang="en">Huang G., Chen D., Li T. et al. Multi-scale dense networks for resource efficient image classification. In: International Conference on Learning Representations (ICLR). 2018. 14 p.</mixed-citation><mixed-citation xml:lang="ru">Huang G., Chen D., Li T. et al. Multi-scale dense networks for resource efficient image classification // International Conference on Learning Representations (ICLR). 2018. 14 p.</mixed-citation></citation-alternatives></ref><ref id="B16"><label>16.</label><citation-alternatives><mixed-citation xml:lang="en">Kaya Y., Dumitras T. When does dynamic computation help early-exiting neural networks? In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW). 2021. Pp. 2709–2718.</mixed-citation><mixed-citation xml:lang="ru">Kaya Y., Dumitras T. When does dynamic computation help early-exiting neural networks? // Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW). 2021. Pp. 2709–2718.</mixed-citation></citation-alternatives></ref><ref id="B17"><label>17.</label><citation-alternatives><mixed-citation xml:lang="en">Venieris S.I., Laskaridis S., Lane N.D. Dynamic neural networks: A survey. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI). 2023. Vol. 45. No. 2. Pp. 2076–2098.</mixed-citation><mixed-citation xml:lang="ru">Venieris S.I., Laskaridis S., Lane N.D. Dynamic neural networks: A survey // IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI). 2023. Vol. 45. No. 2. Pp. 2076–2098.</mixed-citation></citation-alternatives></ref><ref id="B18"><label>18.</label><citation-alternatives><mixed-citation xml:lang="en">Viola P., Jones M. Rapid object detection using a boosted cascade of simple features. CVPR. 2001. Vol. 1.</mixed-citation><mixed-citation xml:lang="ru">Viola P., Jones M. Rapid object detection using a boosted cascade of simple features // CVPR. 2001. Vol. 1.</mixed-citation></citation-alternatives></ref><ref id="B19"><label>19.</label><citation-alternatives><mixed-citation xml:lang="en">Chesalin A.N. Application of cascade classification algorithms for improving intrusion detection systems. Nonlinear World. 2022. Vol. 20. No. 1. Pp. 24–41. (In Rus.)</mixed-citation><mixed-citation xml:lang="ru">Чесалин А.Н. Применение каскадных алгоритмов классификации для совершенствования систем обнаружения вторжений // Нелинейный мир. 2022. Т. 20. № 1. C. 24–41.</mixed-citation></citation-alternatives></ref><ref id="B20"><label>20.</label><citation-alternatives><mixed-citation xml:lang="en">He K., Zhang X., Ren S., Sun J. Deep residual learning for image recognition. arXiv:1512.03385v1 [cs.CV]. 2015.</mixed-citation><mixed-citation xml:lang="ru">He K., Zhang X., Ren S., Sun J. Deep residual learning for image recognition // arXiv:1512.03385v1 [cs.CV]. 2015.</mixed-citation></citation-alternatives></ref><ref id="B21"><label>21.</label><citation-alternatives><mixed-citation xml:lang="en">Sai Abhishek, Allena Venkata. Resnet18 model with sequential layer for computing accuracy on image classification dataset. International Journal of Scientific Research in Computer Science, Engineering and Information Technology. 2022. Vol. 10. Pp. 2320–2882.</mixed-citation><mixed-citation xml:lang="ru">Sai Abhishek, Allena Venkata. Resnet18 model with sequential layer for computing accuracy on image classification dataset // International Journal of Scientific Research in Computer Science, Engineering and Information Technology. 2022. Vol. 10. Pp. 2320–2882.</mixed-citation></citation-alternatives></ref><ref id="B22"><label>22.</label><citation-alternatives><mixed-citation xml:lang="en">Stallkamp J., Schlipsing M., Salmen J., Igel C. The German traffic sign recognition benchmark: A multi-class classification competition. In: IEEE International Joint Conference on Neural Networks (IJCNN). 2011.</mixed-citation><mixed-citation xml:lang="ru">Stallkamp J., Schlipsing M., Salmen J., Igel C. The German Traffic Sign Recognition Benchmark: A multi-class classification competition // IEEE International Joint Conference on Neural Networks (IJCNN). 2011.</mixed-citation></citation-alternatives></ref><ref id="B23"><label>23.</label><mixed-citation>Sovrasov V. Ptflops: A flops counting tool for neural networks in Pytorch framework. 2024. URL: https://github.com/sovrasov/flops-counter.pytorch</mixed-citation></ref><ref id="B24"><label>24.</label><citation-alternatives><mixed-citation xml:lang="en">Gonzalez R., Woods R. Digital image processing. Moscow: Technosphere, 2005, 1072 p.</mixed-citation><mixed-citation xml:lang="ru">Гонсалес Р., Вудс Р. Цифровая обработка изображений. М.: Техносфера, 2005. 1072 с.</mixed-citation></citation-alternatives></ref><ref id="B25"><label>25.</label><citation-alternatives><mixed-citation xml:lang="en">Kim H. Torchattacks: A PyTorch repository for adversarial attacks. arXiv:2010.01950. 2020.</mixed-citation><mixed-citation xml:lang="ru">Kim H. Torchattacks: A PyTorch repository for adversarial attacks // arXiv:2010.01950. 2020.</mixed-citation></citation-alternatives></ref><ref id="B26"><label>26.</label><citation-alternatives><mixed-citation xml:lang="en">Moosavi-Dezfooli S.-M., Fawzi A., Frossard P. DeepFool: A simple and accurate method to fool deep neural networks. arXiv:1511.04599. 2015.</mixed-citation><mixed-citation xml:lang="ru">Moosavi-Dezfooli S.-M., Fawzi A., Frossard P. DeepFool: A simple and accurate method to fool deep neural networks // arXiv:1511.04599. 2015.</mixed-citation></citation-alternatives></ref><ref id="B27"><label>27.</label><citation-alternatives><mixed-citation xml:lang="en">Rauber J., Brendel W., Bethge M. Foolbox: A Python toolbox to benchmark the robustness of machine learning models. arXiv:1707.04131. 2017.</mixed-citation><mixed-citation xml:lang="ru">Rauber J., Brendel W., Bethge M. Foolbox: A Python toolbox to benchmark the robustness of machine learning models // arXiv:1707.04131. 2017.</mixed-citation></citation-alternatives></ref><ref id="B28"><label>28.</label><citation-alternatives><mixed-citation xml:lang="en">Goodfellow I., Shlens J., Szegedy C. Explaining and harnessing adversarial examples. arXiv:1412.6572. 2015.</mixed-citation><mixed-citation xml:lang="ru">Goodfellow I., Shlens J., Szegedy C. Explaining and harnessing adversarial examples // arXiv:1412.6572. 2015.</mixed-citation></citation-alternatives></ref></ref-list></back></article>
