Learning Temporal Logic Predicates from Data with Statistical Guarantees
Emi Soroka, Rohan Sinha, Sanjay Lall
TL;DR
The paper tackles learning signal temporal logic predicates from trajectory data with finite-sample guarantees. It integrates expression optimization with conformal prediction to produce predicates along with valid robustness intervals for unseen trajectories, using interval arithmetic to compose predicates efficiently. Key contributions include a unified framework that yields nontrivial, interpretable STL predicates with statistical guarantees, plus ablation studies showing the benefits of TeLEx-like loss and triviality penalties. The approach demonstrates effectiveness on synthetic data and a real-world VRU dataset, highlighting potential for safety-critical verification and constraint-based motion planning in robotics with partial observations.
Abstract
Temporal logic rules are often used in control and robotics to provide structured, human-interpretable descriptions of trajectory data. These rules have numerous applications including safety validation using formal methods, constraining motion planning among autonomous agents, and classifying data. However, existing methods for learning temporal logic predicates from data do not provide assurances about the correctness of the resulting predicate. We present a novel method to learn temporal logic predicates from data with finite-sample correctness guarantees. Our approach leverages expression optimization and conformal prediction to learn predicates that correctly describe future trajectories under mild statistical assumptions. We provide experimental results showing the performance of our approach on a simulated trajectory dataset and perform ablation studies to understand how each component of our algorithm contributes to its performance.
