Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Panagiotis Kouvaros"'
Publikováno v:
AAAI
We introduce an efficient method for the verification of ReLU-based feed-forward neural networks. We derive an automated procedure that exploits dependency relations between the ReLU nodes, thereby pruning the search tree that needs to be considered
Autor:
Denis Osipychev, Panagiotis Kouvaros, Trent Kyono, Dragos D. Margineantu, Alessio Lomuscio, Yang Zheng, Francesco Leofante
Publikováno v:
International Symposium on Formal Methods
Formal Methods ISBN: 9783030908690
FM
Formal Methods ISBN: 9783030908690
FM
Neural networks are being increasingly used for efficient decision making in the aircraft domain. Given the safety-critical nature of the applications involved, stringent safety requirements must be met by these networks. In this work we present a fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db9dfbf4087d2488e0ac0f23fdb47515
http://hdl.handle.net/10044/1/94034
http://hdl.handle.net/10044/1/94034
Publikováno v:
AAMAS
We introduce a model for agent-environment systems where the agents are implemented via feed-forward ReLU neural networks and the environment is non-deterministic. We study the verification problem of such systems against CTL properties. We show that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6b492cd471e89f220627d9a1545a029
http://hdl.handle.net/10044/1/95834
http://hdl.handle.net/10044/1/95834
Autor:
Alessio Lomuscio, Panagiotis Kouvaros
Publikováno v:
IJCAI
We introduce an efficient method for the complete verification of ReLU-based feed-forward neural networks. The method implements branching on the ReLU states on the basis of a notion of dependency between the nodes. This results in dividing the origi
Publikováno v:
International Joint Conference on Artificial Intelligence (IJAC 2021)
IJCAI
IJCAI
We introduce an efficient and tight layer-based semidefinite relaxation for verifying local robustness of neural networks. The improved tightness is the result of the combination between semidefinite relaxations and linear cuts. We obtain a computati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53e6ca5403d279a185c49ca4b8ae1535
http://hdl.handle.net/10044/1/89706
http://hdl.handle.net/10044/1/89706
Publikováno v:
Software Engineering and Formal Methods ISBN: 9783030921231
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::561bae85016183049f32b23611afb3a0
https://doi.org/10.1007/978-3-030-92124-8_26
https://doi.org/10.1007/978-3-030-92124-8_26
Publikováno v:
KR
We investigate the problem of verifying the strategic properties of multi-agent systems equipped with machine learning-based perception units. We introduce a novel model of agents comprising both a perception system implemented via feed-forward neura
Publikováno v:
IJCAI
We study the problem of determining the robustness of a multi-agent system of unbounded size against specifications expressed in a temporal-epistemic logic. We introduce a procedure to synthesise automatically the maximal ratio of faulty agents that
Publikováno v:
26th International Joint Conference on Artificial Intelligence (IJCAI 2017)
26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Aug 2017, Melbourne, Australia. pp.98--104
Scopus-Elsevier
IJCAI
26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Aug 2017, Melbourne, Australia. pp.98--104
Scopus-Elsevier
IJCAI
We introduce parameterised data-aware multi-agent systems, a formalism to reason about the temporal-epistemic properties of arbitrarily large collections of homogeneous agents, each operating on an infinite data domain. We show that their parameteris
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d9527a25cffc0a095be4dcb9238d588
https://hal.science/hal-01629367
https://hal.science/hal-01629367
Autor:
Panagiotis Kouvaros, Alessio Lomuscio
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 31
We define a class of parameterised infinite state multi-agent systems (MAS) that is unbounded in both the number of agents composing the system and the domain of the variables encoding the agents. We analyse their verification problem by combining an