Learning Linear Temporal Specifications from Demonstrations with Uncertainty

• URL: http://arxiv.org/abs/2607.10918v1
• Date: Sun, 12 Jul 2026 20:43:52 GMT
• Title: Learning Linear Temporal Specifications from Demonstrations with Uncertainty
• Abstract summary: We present a framework for learning minimal Linear Temporal Logic formulas from demonstrations with uncertainty.<n>We evaluate our method against state-of-the-art learning approaches and show that it recovers specifications that more closely align with ground-truth formulas under uncertainty.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Learning temporal logic specifications from system demonstrations is essential for tasks such as formal verification and controller synthesis, especially in safety-critical domains. Existing approaches typically assume demonstrations are correct or only affected by misclassification errors. In practice, however, system traces are often uncertain or incomplete due to sensor faults, measurement errors, or data loss. We present a framework for learning minimal Linear Temporal Logic (LTL) formulas from demonstrations with uncertainty. Our approach models uncertainty via Hamming distance to generate possible estimates around each observed trace, which are grouped with constraints requiring that at least one trace per group is consistent with the learned formula. Our problem is then reduced to an equivalent Pseudo-Boolean Optimization. We evaluate our method against state-of-the-art LTL learning approaches and show that it recovers specifications that more closely align with ground-truth formulas under uncertainty.

Related papers

• On Synthesis of Metric Interval Temporal Logics [0.5505634045241289]
  This paper presents the first framework to tackle emphprecise passive learning for an expressive timed logic.<n>Our approach formally reduces the timed learning problem into a scalable untimed one.<n>We evaluate our implementation across several benchmarks, demonstrating the effectiveness of our approach.
  arXiv  Detail & Related papers  (2026-09-01T10:30:46Z)
• Proximal Mediation Analysis with Hidden Recanting Witnesses [6.9475003037956435]
  Many practical settings rely on the assumption that recanting witnesses, defined as treatment-induced mediator-outcome confounders, are either absent or fully known a priori.<n>We develop three novel identification strategies to address the challenge of identifying path-specific effects in the presence of unknown recanting witnesses.
  arXiv  Detail & Related papers  (2026-06-16T07:07:06Z)
• Non-Parametric Rehearsal Learning via Conditional Mean Embeddings [88.89267783967263]
  We propose a non-parametric rehearsal learning approach for textitavoiding undesired future (AUF) problems.<n>Specifically, we use kernel machinery to reformulate the AUF objective into a unified representation that disentangles desirability modeling from action-induced distributional changes.
  arXiv  Detail & Related papers  (2026-05-09T15:30:52Z)
• How LLMs Fail and Generalize in RTL Coding for Hardware Design? [56.361436215029045]
  We introduce a new error taxonomy grounded in problem solvability, inspired by cognitive theory.<n>Our taxonomy categorizes failures into syntactic, semantic, solvable functional, and unsolvable functional types.
  arXiv  Detail & Related papers  (2026-04-26T14:34:49Z)
• Adaptive Unknown Fault Detection and Few-Shot Continual Learning for Condition Monitoring in Ultrasonic Metal Welding [2.578856520461645]
  ultrasonic metal welding (UMW) is widely used in industrial applications but is sensitive to tool wear, surface contamination, and material variability.<n>This paper proposes an adaptive condition monitoring approach that enables unknown fault detection and few-shot continual learning for UMW.
  arXiv  Detail & Related papers  (2026-04-15T04:37:11Z)
• The Hidden Cost of Approximation in Online Mirror Descent [56.99972253009168]
  Online mirror descent (OMD) is a fundamental algorithmic paradigm that underlies many algorithms in optimization, machine learning and sequential decision-making.<n>In this work we initiate a systematic study into inexact OMD, and uncover an intricate relation between regularizer smoothness and robustness to approximation errors.
  arXiv  Detail & Related papers  (2025-11-27T10:09:07Z)
• Revisiting Multivariate Time Series Forecasting with Missing Values [65.30332997607141]
  Missing values are common in real-world time series.<n>Current approaches have developed an imputation-then-prediction framework that uses imputation modules to fill in missing values, followed by forecasting on the imputed data.<n>This framework overlooks a critical issue: there is no ground truth for the missing values, making the imputation process susceptible to errors that can degrade prediction accuracy.<n>We introduce Consistency-Regularized Information Bottleneck (CRIB), a novel framework built on the Information Bottleneck principle.
  arXiv  Detail & Related papers  (2025-09-27T20:57:48Z)
• Neuro-Symbolic Predictive Process Monitoring [7.295472411867107]
  We propose a Neuro-Symbolic Predictive Process Monitoring (PPM) approach that integrates data-driven learning with temporal logic-based prior knowledge.<n>We introduce a novel method to incorporate Linear Temporal Logic over finite traces (LTLf) into the training process of autoregressive sequence predictors.<n> Experimental evaluation on three real-world datasets shows that our method improves suffix prediction accuracy and compliance with temporal constraints.
  arXiv  Detail & Related papers  (2025-08-31T13:07:17Z)
• Understanding and Mitigating Classification Errors Through Interpretable Token Patterns [58.91023283103762]
  Characterizing errors in easily interpretable terms gives insight into whether a classifier is prone to making systematic errors. We propose to discover those patterns of tokens that distinguish correct and erroneous predictions. We show that our method, Premise, performs well in practice.
  arXiv  Detail & Related papers  (2023-11-18T00:24:26Z)
• Learning Prompt-Enhanced Context Features for Weakly-Supervised Video Anomaly Detection [37.99031842449251]
  Video anomaly detection under weak supervision presents significant challenges. We present a weakly supervised anomaly detection framework that focuses on efficient context modeling and enhanced semantic discriminability. Our approach significantly improves the detection accuracy of certain anomaly sub-classes, underscoring its practical value and efficacy.
  arXiv  Detail & Related papers  (2023-06-26T06:45:16Z)
• Bounded (O(1)) Regret Recommendation Learning via Synthetic Controls Oracle [6.935657546323529]
  In online exploration systems where users with fixed preferences repeatedly arrive, bounded regret can be achieved. This result may be of interest for recommender systems, where the popularity of their items is often short-lived. In this work, we conduct a theoretical study to address all these issues while still achieving bounded regret.
  arXiv  Detail & Related papers  (2023-01-29T22:39:50Z)
• Identifiability and Asymptotics in Learning Homogeneous Linear ODE Systems from Discrete Observations [114.17826109037048]
  Ordinary Differential Equations (ODEs) have recently gained a lot of attention in machine learning. theoretical aspects, e.g., identifiability and properties of statistical estimation are still obscure. This paper derives a sufficient condition for the identifiability of homogeneous linear ODE systems from a sequence of equally-spaced error-free observations sampled from a single trajectory.
  arXiv  Detail & Related papers  (2022-10-12T06:46:38Z)

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.