Interpretable Early Failure Detection via Machine Learning and Trace Checking-based Monitoring

• URL: http://arxiv.org/abs/2508.17786v1
• Date: Mon, 25 Aug 2025 08:30:01 GMT
• Title: Interpretable Early Failure Detection via Machine Learning and Trace Checking-based Monitoring
• Authors: Andrea Brunello, Luca Geatti, Angelo Montanari, Nicola Saccomanno,
• Abstract summary: We develop a framework for interpretable early failure detection based on vectorized trace checking.<n>The framework shows a 2-10% net improvement in key performance metrics compared to the state-of-the-art methods.
• Score: 9.565145785280452
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Monitoring is a runtime verification technique that allows one to check whether an ongoing computation of a system (partial trace) satisfies a given formula. It does not need a complete model of the system, but it typically requires the construction of a deterministic automaton doubly exponential in the size of the formula (in the worst case), which limits its practicality. In this paper, we show that, when considering finite, discrete traces, monitoring of pure past (co)safety fragments of Signal Temporal Logic (STL) can be reduced to trace checking, that is, evaluation of a formula over a trace, that can be performed in time polynomial in the size of the formula and the length of the trace. By exploiting such a result, we develop a GPU-accelerated framework for interpretable early failure detection based on vectorized trace checking, that employs genetic programming to learn temporal properties from historical trace data. The framework shows a 2-10% net improvement in key performance metrics compared to the state-of-the-art methods.

Related papers

• Quantitative Monitoring of Signal First-Order Logic [11.310581148639088]
  We provide the first robustness-based quantitative semantics for Signal First-Order Logic (SFO)<n>SFO offers expressive real-time specifications over such signals, but currently comes only with Boolean semantics and has no tool support.<n>This is the first publicly available prototype for online quantitative monitoring of full SFO.
  arXiv  Detail & Related papers  (2026-02-28T16:23:11Z)
• Detecting Object Tracking Failure via Sequential Hypothesis Testing [80.7891291021747]
  Real-time online object tracking in videos constitutes a core task in computer vision.<n>We propose interpreting object tracking as a sequential hypothesis test, wherein evidence for or against tracking failures is gradually accumulated over time.<n>We propose both supervised and unsupervised variants by leveraging either ground-truth or solely internal tracking information.
  arXiv  Detail & Related papers  (2026-02-13T14:57:15Z)
• Fine-Grained Traceability for Transparent ML Pipelines [10.182692014427909]
  FG-Trac is a model-agnostic framework that establishes fine-grained sample-level traceability throughout machine learning pipelines.<n>It defines an explicit mechanism for capturing and verifying sample lifecycle events across preprocessing and training.<n>It computes contribution scores explicitly grounded in training checkpoints, and anchors these traces to tamper-evident cryptographic commitments.
  arXiv  Detail & Related papers  (2026-01-21T13:21:30Z)
• Taming Imperfect Process Verifiers: A Sampling Perspective on Backtracking [54.43083499412643]
  Test-time algorithms that combine the generative power of language models with process verifiers offer a promising lever for eliciting new reasoning capabilities.<n>We introduce a new process-guided test-time sampling algorithm, VGB, which uses theoretically grounded backtracking to achieve provably better robustness to verifier errors.
  arXiv  Detail & Related papers  (2025-10-03T16:21:14Z)
• Investigating task-specific prompts and sparse autoencoders for activation monitoring [0.0]
  Internal activations of language models encode additional information that could be useful for this.<n>Recent work has proposed several approaches which may improve on naive linear probing.<n>We develop and test novel refinements of these methods and compare them against each other.
  arXiv  Detail & Related papers  (2025-04-28T21:28:17Z)
• On Interpreting the Effectiveness of Unsupervised Software Traceability with Information Theory [12.390314973658466]
  Unsupervised traceability techniques often assume traceability patterns are present within textual data.<n>We introduce self-information, cross-entropy, and mutual information (MI) as metrics to measure the informativeness and reliability of traceability links.<n>We show that an average MI of 4.81 bits, loss of 1.75, and noise of 0.28 bits signify that there are information-theoretic limits on the effectiveness of unsupervised traceability techniques.
  arXiv  Detail & Related papers  (2024-12-06T01:29:29Z)
• Extreme Value Modelling of Feature Residuals for Anomaly Detection in Dynamic Graphs [14.8066991252587]
  detecting anomalies in a temporal sequence of graphs can be applied to areas such as the detection of accidents in transport networks and cyber attacks in computer networks.<n>Existing methods for detecting abnormal graphs can suffer from multiple limitations, such as high false positive rates and difficulties with handling variable-sized graphs and non-trivial temporal dynamics.<n>We propose a technique where temporal dependencies are explicitly modelled via time series analysis of a large set of pertinent graph features, followed by using residuals to remove the dependencies.
  arXiv  Detail & Related papers  (2024-10-08T05:00:53Z)
• Bisimulation Learning [55.859538562698496]
  We compute finite bisimulations of state transition systems with large, possibly infinite state space. Our technique yields faster verification results than alternative state-of-the-art tools in practice.
  arXiv  Detail & Related papers  (2024-05-24T17:11:27Z)
• Graph Spatiotemporal Process for Multivariate Time Series Anomaly Detection with Missing Values [67.76168547245237]
  We introduce a novel framework called GST-Pro, which utilizes a graphtemporal process and anomaly scorer to detect anomalies. Our experimental results show that the GST-Pro method can effectively detect anomalies in time series data and outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-01-11T10:10:16Z)
• Uncovering the Missing Pattern: Unified Framework Towards Trajectory Imputation and Prediction [60.60223171143206]
  Trajectory prediction is a crucial undertaking in understanding entity movement or human behavior from observed sequences. Current methods often assume that the observed sequences are complete while ignoring the potential for missing values. This paper presents a unified framework, the Graph-based Conditional Variational Recurrent Neural Network (GC-VRNN), which can perform trajectory imputation and prediction simultaneously.
  arXiv  Detail & Related papers  (2023-03-28T14:27:27Z)
• PULL: Reactive Log Anomaly Detection Based On Iterative PU Learning [58.85063149619348]
  We propose PULL, an iterative log analysis method for reactive anomaly detection based on estimated failure time windows. Our evaluation shows that PULL consistently outperforms ten benchmark baselines across three different datasets.
  arXiv  Detail & Related papers  (2023-01-25T16:34:43Z)
• Self-Supervised Training with Autoencoders for Visual Anomaly Detection [61.62861063776813]
  We focus on a specific use case in anomaly detection where the distribution of normal samples is supported by a lower-dimensional manifold. We adapt a self-supervised learning regime that exploits discriminative information during training but focuses on the submanifold of normal examples. We achieve a new state-of-the-art result on the MVTec AD dataset -- a challenging benchmark for visual anomaly detection in the manufacturing domain.
  arXiv  Detail & Related papers  (2022-06-23T14:16:30Z)
• An Entropic Relevance Measure for Stochastic Conformance Checking in Process Mining [9.302180124254338]
  We present an entropic relevance measure for conformance checking, computed as the average number of bits required to compress each of the log's traces. We show that entropic relevance is computable in time linear in the size of the log, and provide evaluation outcomes that demonstrate the feasibility of using the new approach in industrial settings.
  arXiv  Detail & Related papers  (2020-07-18T02:25:33Z)
• Learned Factor Graphs for Inference from Stationary Time Sequences [107.63351413549992]
  We propose a framework that combines model-based algorithms and data-driven ML tools for stationary time sequences. neural networks are developed to separately learn specific components of a factor graph describing the distribution of the time sequence. We present an inference algorithm based on learned stationary factor graphs, which learns to implement the sum-product scheme from labeled data.
  arXiv  Detail & Related papers  (2020-06-05T07:06: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.