Mining Beyond the Bools: Learning Data Transformations and Temporal Specifications

• URL: http://arxiv.org/abs/2603.06710v1
• Date: Thu, 05 Mar 2026 19:56:25 GMT
• Title: Mining Beyond the Bools: Learning Data Transformations and Temporal Specifications
• Abstract summary: We extend mining procedures to operate over richer datatypes.<n>We demonstrate our approach reactive programs from mined specifications on the OpenAI-Gymnasium ToyText environments.
• Score: 2.5164739639003364
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Mining specifications from execution traces presents an automated way of capturing characteristic system behaviors. However, existing approaches are largely restricted to Boolean abstractions of events, limiting their ability to express data-aware properties. In this paper, we extend mining procedures to operate over richer datatypes. We first establish candidate functions in our domain that cover the set of traces by leveraging Syntax Guided Synthesis (SyGuS) techniques. To capture these function applications temporally, we formalize the semantics of TSL$_f$, a finite-prefix interpretation of Temporal Stream Logic (TSL) that extends LTL$_f$ with support for first-order predicates and functional updates. This allows us to unify a corresponding procedure for learning the data transformations and temporal specifications of a system. We demonstrate our approach synthesizing reactive programs from mined specifications on the OpenAI-Gymnasium ToyText environments, finding that our method is more robust and orders of magnitude more sample-efficient than passive learning baselines on generalized problem instances.

Related papers

• SemPiper: Interactive Code Synthesis for Semantic Operators in Machine Learning Pipelines [7.868559688632956]
  We demonstrate SemPipes, a programming model that extends machine learning pipelines with semantic data operators.<n>For the semantic operators, SemPipes synthesizes specialized implementations at pipeline training time.<n>We show how semantic operators enable controllable, optimizable, and practical integration of LLMs into ML pipeline development.
  arXiv  Detail & Related papers  (2026-06-12T11:40:09Z)
• Step-Level Sparse Autoencoder for Reasoning Process Interpretation [48.99201531966593]
  Large Language Models (LLMs) have achieved strong complex reasoning capabilities through Chain-of-Thought (CoT) reasoning.<n>We propose step-level sparse autoencoder (SSAE), which serves as an analytical tool to disentangle different aspects of LLMs' reasoning steps into sparse features.<n> Experiments on multiple base models and reasoning tasks show the effectiveness of the extracted features.
  arXiv  Detail & Related papers  (2026-03-03T14:25:02Z)
• Semantically Labelled Automata for Multi-Task Reinforcement Learning with LTL Instructions [61.479946958462754]
  We study multi-task reinforcement learning (RL), a setting in which an agent learns a single, universal policy.<n>We present a novel task embedding technique leveraging a new generation of semantic translations-to-automata.
  arXiv  Detail & Related papers  (2026-02-06T14:46:27Z)
• Zero-Shot Instruction Following in RL via Structured LTL Representations [54.08661695738909]
  Linear temporal logic (LTL) is a compelling framework for specifying complex, structured tasks for reinforcement learning (RL) agents.<n>Recent work has shown that interpreting instructions as finite automata, which can be seen as high-level programs monitoring task progress, enables learning a single generalist policy capable of executing arbitrary instructions at test time.<n>We propose a novel approach to learning a multi-task policy for following arbitrary instructions that addresses this shortcoming.
  arXiv  Detail & Related papers  (2025-12-02T10:44:51Z)
• Bridging Logic and Learning: Decoding Temporal Logic Embeddings via Transformers [2.33432538444645]
  We train a Transformer-based decoder-only model to invert semantic embeddings of logic formulae.<n>We show that the model is able to generate valid formulae after only 1 epoch and to generalize to the semantics of the logic in about 10 epochs.
  arXiv  Detail & Related papers  (2025-07-10T14:35:37Z)
• Learning Probabilistic Temporal Logic Specifications for Stochastic Systems [24.82640206181621]
  We propose a novel learning algorithm that infers conciseL specifications from a set of Markov chains.<n>We demonstrate the effectiveness of our algorithm in two use cases: learning from policies induced by algorithms and learning from a probabilistic model.
  arXiv  Detail & Related papers  (2025-05-17T18:19:35Z)
• STLCG++: A Masking Approach for Differentiable Signal Temporal Logic Specification [9.039665244779185]
  We present STLCG++, a masking-based approach that parallelizes STL computation and backpropagation across timesteps.<n>We also introduce a smoothing technique to enable the differentiation of time interval bounds, thereby expanding STL's applicability in gradient-based optimization tasks.
  arXiv  Detail & Related papers  (2025-01-08T00:06:43Z)
• 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)
• TLINet: Differentiable Neural Network Temporal Logic Inference [10.36033062385604]
  This paper introduces TLINet, a neural-symbolic framework for learning STL formulas. In contrast to existing approaches, we introduce approximation methods for max operator designed specifically for temporal logic-based gradient techniques. Our framework not only learns the structure but also the parameters of STL formulas, allowing flexible combinations of operators and various logical structures.
  arXiv  Detail & Related papers  (2024-05-03T16:38:14Z)
• State Sequences Prediction via Fourier Transform for Representation Learning [111.82376793413746]
  We propose State Sequences Prediction via Fourier Transform (SPF), a novel method for learning expressive representations efficiently. We theoretically analyze the existence of structural information in state sequences, which is closely related to policy performance and signal regularity. Experiments demonstrate that the proposed method outperforms several state-of-the-art algorithms in terms of both sample efficiency and performance.
  arXiv  Detail & Related papers  (2023-10-24T14:47:02Z)
• Instruction Position Matters in Sequence Generation with Large Language Models [67.87516654892343]
  Large language models (LLMs) are capable of performing conditional sequence generation tasks, such as translation or summarization. We propose enhancing the instruction-following capability of LLMs by shifting the position of task instructions after the input sentences.
  arXiv  Detail & Related papers  (2023-08-23T12:36:57Z)

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.