Error-awareness Accelerates Active Automata Learning

• URL: http://arxiv.org/abs/2602.21674v1
• Date: Wed, 25 Feb 2026 08:20:52 GMT
• Title: Error-awareness Accelerates Active Automata Learning
• Abstract summary: Active automata learning (AAL) algorithms can learn a behavioral model of a system from interacting with it.<n>Modern AAL algorithms fail to scale even if, in every state, most inputs lead to errors.<n>Motivated by these problems, we study learning these systems more efficiently.
• Score: 4.4405560305368725
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Active automata learning (AAL) algorithms can learn a behavioral model of a system from interacting with it. The primary challenge remains scaling to larger models, in particular in the presence of many possible inputs to the system. Modern AAL algorithms fail to scale even if, in every state, most inputs lead to errors. In various challenging problems from the literature, these errors are observable, i.e., they emit a known error output. Motivated by these problems, we study learning these systems more efficiently. Further, we consider various degrees of knowledge about which inputs are non-error producing at which state. For each level of knowledge, we provide a matching adaptation of the state-of-the-art AAL algorithm L# to make the most of this domain knowledge. Our empirical evaluation demonstrates that the methods accelerate learning by orders of magnitude with strong but realistic domain knowledge to a single order of magnitude with limited domain knowledge.

Related papers

• When Does Continual Learning Require Learning [68.55508958298942]
  We show that continual learning is not a single capability.<n>Different patterns of environmental change require fundamentally different update behaviors.<n>We hope that understanding where each method succeeds and fails will guide the design of stronger continual learning systems.
  arXiv  Detail & Related papers  (2026-07-08T18:27:40Z)
• Learning Without Training [0.0]
  This dissertation focuses on three different projects rooted in mathematical theory for machine learning applications.<n>The first project deals with supervised learning and manifold learning.<n>The second project deals with transfer learning, which is the study of how an approximation process or model learned on one domain can be leveraged to improve the approximation on another domain.<n>The third project is concerned with the classification task in machine learning, particularly in the active learning paradigm.
  arXiv  Detail & Related papers  (2026-02-20T04:42:06Z)
• Efficient Machine Unlearning via Influence Approximation [75.31015485113993]
  Influence-based unlearning has emerged as a prominent approach to estimate the impact of individual training samples on model parameters without retraining.<n>This paper establishes a theoretical link between memorizing (incremental learning) and forgetting (unlearning)<n>We introduce the Influence Approximation Unlearning algorithm for efficient machine unlearning from the incremental perspective.
  arXiv  Detail & Related papers  (2025-07-31T05:34:27Z)
• Offline Imitation Learning Through Graph Search and Retrieval [57.57306578140857]
  Imitation learning is a powerful machine learning algorithm for a robot to acquire manipulation skills. We propose GSR, a simple yet effective algorithm that learns from suboptimal demonstrations through Graph Search and Retrieval. GSR can achieve a 10% to 30% higher success rate and over 30% higher proficiency compared to baselines.
  arXiv  Detail & Related papers  (2024-07-22T06:12:21Z)
• KnowTuning: Knowledge-aware Fine-tuning for Large Language Models [83.5849717262019]
  We propose a knowledge-aware fine-tuning (KnowTuning) method to improve fine-grained and coarse-grained knowledge awareness of LLMs. KnowTuning generates more facts with less factual error rate under fine-grained facts evaluation.
  arXiv  Detail & Related papers  (2024-02-17T02:54:32Z)
• Recognizing Unseen Objects via Multimodal Intensive Knowledge Graph Propagation [68.13453771001522]
  We propose a multimodal intensive ZSL framework that matches regions of images with corresponding semantic embeddings. We conduct extensive experiments and evaluate our model on large-scale real-world data.
  arXiv  Detail & Related papers  (2023-06-14T13:07:48Z)
• Learning to solve arithmetic problems with a virtual abacus [0.35911228556176483]
  We introduce a deep reinforcement learning framework that allows to simulate how cognitive agents could learn to solve arithmetic problems. The proposed model successfully learns to perform multi-digit additions and subtractions, achieving an error rate below 1%. We analyze the most common error patterns to better understand the limitations and biases resulting from our design choices.
  arXiv  Detail & Related papers  (2023-01-17T13:25:52Z)
• Continual Learning with Deep Learning Methods in an Application-Oriented Context [0.0]
  An important research area of Artificial Intelligence (AI) deals with the automatic derivation of knowledge from data. One type of machine learning algorithms that can be categorized as "deep learning" model is referred to as Deep Neural Networks (DNNs) DNNs are affected by a problem that prevents new knowledge from being added to an existing base.
  arXiv  Detail & Related papers  (2022-07-12T10:13:33Z)
• ActKnow: Active External Knowledge Infusion Learning for Question Answering in Low Data Regime [7.562843347215286]
  We propose a technique that actively infuses knowledge from Knowledge Graphs (KG) based "on-demand" into learning for Question Answering (QA) We show significant improvements on the ARC Challenge-set benchmark over purely text-based transformer models like RoBERTa in the low data regime.
  arXiv  Detail & Related papers  (2021-12-17T10:39:41Z)
• Characterizing possible failure modes in physics-informed neural networks [55.83255669840384]
  Recent work in scientific machine learning has developed so-called physics-informed neural network (PINN) models. We demonstrate that, while existing PINN methodologies can learn good models for relatively trivial problems, they can easily fail to learn relevant physical phenomena even for simple PDEs. We show that these possible failure modes are not due to the lack of expressivity in the NN architecture, but that the PINN's setup makes the loss landscape very hard to optimize.
  arXiv  Detail & Related papers  (2021-09-02T16:06:45Z)
• Knowledge as Invariance -- History and Perspectives of Knowledge-augmented Machine Learning [69.99522650448213]
  Research in machine learning is at a turning point. Research interests are shifting away from increasing the performance of highly parameterized models to exceedingly specific tasks. This white paper provides an introduction and discussion of this emerging field in machine learning research.
  arXiv  Detail & Related papers  (2020-12-21T15:07:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.