Towards Neural Routing with Verified Bounds on Performance
When data-driven algorithms, especially the ones based on deep neural networks (DNNs), replace classical ones, their superior performance often comes with difficulty in their analysis. On the way to compensate for this drawback, formal verification techniques, which can provide reliable guarantees o...
Saved in:
| Main Authors: | Igor Petrovich Buzhinsky, Anatoly Abramovich Shalyto |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2022-09-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1714 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Towards a Coq-verified Chain of Esterel Semantics
by: Rieg, Lionel, et al.
Published: (2025-04-01) -
TC-Verifier: Trans-Compiler-Based Code Translator Verifier with Model-Checking
by: Amira T. Mahmoud, et al.
Published: (2025-04-01) -
Towards the ’Verified Verifier’. Theory and Practice
by: D. A. Kondratyev, et al.
Published: (2014-12-01) -
Exploration and practice of human-machine trustworthy mechanism in XAI
by: LUO Zhongyan, et al.
Published: (2025-01-01) -
Exploration and practice of human-machine trustworthy mechanism in XAI
by: LUO Zhongyan, et al.
Published: (2025-07-01)