Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise

no code implementations • 21 Sep 2022 • Igor Khmelnitsky, Serge Haddad, Lina Ye, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy

Angluin's L* algorithm learns the minimal (complete) deterministic finite automaton (DFA) of a regular language using membership and equivalence queries.

Classification PAC learning

Property-Directed Verification of Recurrent Neural Networks

no code implementations • 22 Sep 2020 • Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye

This paper presents a property-directed approach to verifying recurrent neural networks (RNNs).