English
Related papers

Related papers: Extracting Robust Register Automata from Neural Ne…

200 papers

In this work, we introduce DeepDFA, a novel approach to identifying Deterministic Finite Automata (DFAs) from traces, harnessing a differentiable yet discrete model. Inspired by both the probabilistic relaxation of DFAs and Recurrent Neural…

Machine Learning · Computer Science 2024-08-19 Elena Umili , Roberto Capobianco

Rule extraction from black-box models is critical in domains that require model validation before implementation, as can be the case in credit scoring and medical diagnosis. Though already a challenging problem in statistical learning in…

Machine Learning · Computer Science 2018-11-16 Qinglong Wang , Kaixuan Zhang , Alexander G. Ororbia , Xinyu Xing , Xue Liu , C. Lee Giles

Algorithm extraction aims to synthesize executable programs directly from models trained on algorithmic tasks, enabling de novo algorithm discovery without relying on human-written code. However, applying this paradigm to Transformer is…

Machine Learning · Computer Science 2026-03-20 Yifan Zhang , Wei Bi , Kechi Zhang , Dongming Jin , Jie Fu , Zhi Jin

Recurrent Neural Networks (RNNs) have achieved tremendous success in sequential data processing. However, it is quite challenging to interpret and verify RNNs' behaviors directly. To this end, many efforts have been made to extract finite…

Computation and Language · Computer Science 2022-09-28 Zeming Wei , Xiyue Zhang , Meng Sun

Apart from the high accuracy of machine learning models, what interests many researchers in real-life problems (e.g., fraud detection, credit scoring) is to find hidden patterns in data; particularly when dealing with their challenging…

Dominance-based Rough Approach (DRSA) has been proposed as a machine learning and knowledge discovery methodology to handle Multiple Criteria Decision Aiding (MCDA). Due to its capacity of asking the decision maker (DM) for simple…

Artificial Intelligence · Computer Science 2022-10-10 Jerzy Błaszczyński , Salvatore Greco , Benedetto Matarazzo , Marcin Szeląg

Model learning (a.k.a. active automata learning) is a highly effective technique for obtaining black-box finite state models of software components. Thus far, generalisation to infinite state systems with inputs/outputs that carry data…

Formal Languages and Automata Theory · Computer Science 2020-09-22 Bharat Garhewal , Frits Vaandrager , Falk Howar , Timo Schrijvers , Toon Lenaerts , Rob Smits

We introduce heap automata, a formalism for automatic reasoning about robustness properties of the symbolic heap fragment of separation logic with user-defined inductive predicates. Robustness properties, such as satisfiability,…

Logic in Computer Science · Computer Science 2016-10-25 Christina Jansen , Jens Katelaan , Christoph Matheja , Thomas Noll , Florian Zuleger

Prevailing network control strategies, which rely on static shortest-path logic, suffer from catastrophic "stress concentration" on critical nodes. This paper introduces the System Relaxation Algorithm (SRA), a new control paradigm inspired…

Networking and Internet Architecture · Computer Science 2025-09-23 Zhiyuan Ren , Zhiliang Shuai , Wenchi Cheng

Autonomous systems (AS) often use Deep Neural Network (DNN) classifiers to allow them to operate in complex, high-dimensional, non-linear, and dynamically changing environments. Due to the complexity of these environments, DNN classifiers…

Machine Learning · Computer Science 2024-08-16 Abanoub Ghobrial , Xuan Zheng , Darryl Hond , Hamid Asgari , Kerstin Eder

We investigate hyper-minimization for deterministic register automata (DRAs). We begin by introducing DRA counterparts of classical notions from deterministic finite automata. Building on these foundations, we present an algorithm for…

Formal Languages and Automata Theory · Computer Science 2026-05-06 Yong Li , Qiyi Tang , Di-De Yen

Formally verifying Deep Reinforcement Learning (DRL) systems is a challenging task due to the dynamic continuity of system behaviors and the black-box feature of embedded neural networks. In this paper, we propose a novel abstraction-based…

Artificial Intelligence · Computer Science 2021-06-15 Peng Jin , Min Zhang , Jianwen Li , Li Han , Xuejun Wen

Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…

Formal Languages and Automata Theory · Computer Science 2026-03-27 Florian Frank , Stefan Milius , Jurriaan Rot , Henning Urbat

Artificial neural networks have been successfully applied to a variety of business application problems involving classification and regression. Although backpropagation neural networks generally predict better than decision trees do for…

Neural and Evolutionary Computing · Computer Science 2010-09-28 S. M. Kamruzzaman , Ahmed Ryadh Hasan

Register automata (RAs) are finite automata extended with a finite set of registers to store and compare data from an infinite domain. We study the concept of synchronizing data words in RAs: does there exist a data word that sends all…

Formal Languages and Automata Theory · Computer Science 2019-06-11 Karin Quaas , Mahsa Shirmohammadi

Modern AI systems increasingly comprise multiple interconnected neural networks to tackle complex inference tasks. Testing such systems for robustness and safety entails significant challenges. Current state-of-the-art robustness testing…

Artificial Intelligence · Computer Science 2026-01-28 Sayak Chowdhury , Meenakshi D'Souza

Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite…

Formal Languages and Automata Theory · Computer Science 2019-05-24 Loris D'Antoni , Tiago Ferreira , Matteo Sammartino , Alexandra Silva

The ability to interpret machine learning models has become increasingly important now that machine learning is used to inform consequential decisions. We propose an approach called model extraction for interpreting complex, blackbox…

Machine Learning · Computer Science 2018-03-14 Osbert Bastani , Carolyn Kim , Hamsa Bastani

In Explainable AI, rule extraction translates model knowledge into logical rules, such as IF-THEN statements, crucial for understanding patterns learned by black-box models. This could significantly aid in fields like disease diagnosis,…

Machine Learning · Computer Science 2024-08-16 Yu Chen , Tianyu Cui , Alexander Capstick , Nan Fletcher-Loyd , Payam Barnaghi

Deep Research Agents (DRAs) are promising agentic systems that gather and synthesize information to support research across domains such as financial decision-making, medical analysis, and scientific discovery. Despite recent improvements…

Artificial Intelligence · Computer Science 2026-02-27 Haotian Zhai , Elias Stengel-Eskin , Pratik Patil , Liu Leqi