Inferring Temporal Logic Properties from Data using Boosted Decision Trees

• URL: http://arxiv.org/abs/2105.11508v1
• Date: Mon, 24 May 2021 19:29:02 GMT
• Title: Inferring Temporal Logic Properties from Data using Boosted Decision Trees
• Authors: Erfan Aasi, Cristian Ioan Vasile, Mahroo Bahreinian, Calin Belta
• Abstract summary: This paper is a first step towards interpretable learning-based robot control. We introduce a novel learning problem, called incremental formula and predictor learning. We propose a boosted decision-tree algorithm that leverages weak, but computationally inexpensive, learners to increase prediction and performance.
• Score: 3.4606842570088094
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Many autonomous systems, such as robots and self-driving cars, involve real-time decision making in complex environments, and require prediction of future outcomes from limited data. Moreover, their decisions are increasingly required to be interpretable to humans for safe and trustworthy co-existence. This paper is a first step towards interpretable learning-based robot control. We introduce a novel learning problem, called incremental formula and predictor learning, to generate binary classifiers with temporal logic structure from time-series data. The classifiers are represented as pairs of Signal Temporal Logic (STL) formulae and predictors for their satisfaction. The incremental property provides prediction of labels for prefix signals that are revealed over time. We propose a boosted decision-tree algorithm that leverages weak, but computationally inexpensive, learners to increase prediction and runtime performance. The effectiveness and classification accuracy of our algorithms are evaluated on autonomous-driving and naval surveillance case studies.

Related papers

• Prediction-Powered Inference [68.97619568620709]
  Prediction-powered inference is a framework for performing valid statistical inference when an experimental dataset is supplemented with predictions from a machine-learning system. The framework yields simple algorithms for computing provably valid confidence intervals for quantities such as means, quantiles, and linear and logistic regression coefficients. Prediction-powered inference could enable researchers to draw valid and more data-efficient conclusions using machine learning.
  arXiv  Detail & Related papers  (2023-01-23T18:59:28Z)
• Interpretable Self-Aware Neural Networks for Robust Trajectory Prediction [50.79827516897913]
  We introduce an interpretable paradigm for trajectory prediction that distributes the uncertainty among semantic concepts. We validate our approach on real-world autonomous driving data, demonstrating superior performance over state-of-the-art baselines.
  arXiv  Detail & Related papers  (2022-11-16T06:28:20Z)
• A review of predictive uncertainty estimation with machine learning [0.0]
  We review the topic of predictive uncertainty estimation with machine learning algorithms. We discuss the related metrics (consistent scoring functions and proper scoring rules) for assessing probabilistic predictions. The review expedites our understanding on how to develop new algorithms tailored to users' needs.
  arXiv  Detail & Related papers  (2022-09-17T10:36:30Z)
• Predicting highway lane-changing maneuvers: A benchmark analysis of machine and ensemble learning algorithms [0.0]
  We compare different machine and ensemble learning classification techniques to the rule-based model. We predict two types of discretionary lane-change maneuvers: Overtaking (from slow to fast lane) and fold-down. If the rule-based model provides limited predicting accuracy, especially in case of fold-down, the data-based algorithms, devoid of modeling bias, allow significant prediction improvements.
  arXiv  Detail & Related papers  (2022-04-20T22:55:59Z)
• Time-Incremental Learning from Data Using Temporal Logics [3.167882687550935]
  We propose a method to predict the label of a signal that is received incrementally over time, referred to as prefix signal. We present a novel decision-tree based approach to generate a finite number of Signal Temporal Logic (STL) specifications from the given dataset. The effectiveness and classification performance of our algorithm are evaluated on an urban-driving and a naval-surveillance case studies.
  arXiv  Detail & Related papers  (2021-12-28T21:32:00Z)
• Improving Prediction Confidence in Learning-Enabled Autonomous Systems [2.66512000865131]
  We utilize a feedback loop between learning-enabled components used for classification and the sensors of an autonomous system in order to improve the confidence of the predictions. We design a classifier using Inductive Conformal Prediction (ICP) based on a triplet network architecture in order to learn representations that can be used to quantify the similarity between test and training examples. A feedback loop that queries the sensors for a new input is used to further refine the predictions and increase the classification accuracy.
  arXiv  Detail & Related papers  (2021-10-07T00:40:34Z)
• Classification of Time-Series Data Using Boosted Decision Trees [3.4606842570088094]
  Time-series data classification is central to the analysis and control of autonomous systems, such as robots and self-driving cars. Current frameworks are either inaccurate for real-world applications, such as autonomous driving, or they generate long and complicated formulae that lack interpretability. We introduce a novel learning method, called Boosted Concise Decision Trees (BCDTs), to generate binary classifiers that are represented as Signal Temporal Logic (STL) formulae.
  arXiv  Detail & Related papers  (2021-10-01T15:28:26Z)
• A Novel Anomaly Detection Algorithm for Hybrid Production Systems based on Deep Learning and Timed Automata [73.38551379469533]
  DAD:DeepAnomalyDetection is a new approach for automatic model learning and anomaly detection in hybrid production systems. It combines deep learning and timed automata for creating behavioral model from observations. The algorithm has been applied to few data sets including two from real systems and has shown promising results.
  arXiv  Detail & Related papers  (2020-10-29T08:27:43Z)
• Network Classifiers Based on Social Learning [71.86764107527812]
  We propose a new way of combining independently trained classifiers over space and time. The proposed architecture is able to improve prediction performance over time with unlabeled data. We show that this strategy results in consistent learning with high probability, and it yields a robust structure against poorly trained classifiers.
  arXiv  Detail & Related papers  (2020-10-23T11:18:20Z)
• Representation Learning for Sequence Data with Deep Autoencoding Predictive Components [96.42805872177067]
  We propose a self-supervised representation learning method for sequence data, based on the intuition that useful representations of sequence data should exhibit a simple structure in the latent space. We encourage this latent structure by maximizing an estimate of predictive information of latent feature sequences, which is the mutual information between past and future windows at each time step. We demonstrate that our method recovers the latent space of noisy dynamical systems, extracts predictive features for forecasting tasks, and improves automatic speech recognition when used to pretrain the encoder on large amounts of unlabeled data.
  arXiv  Detail & Related papers  (2020-10-07T03:34:01Z)
• Bias in Multimodal AI: Testbed for Fair Automatic Recruitment [73.85525896663371]
  We study how current multimodal algorithms based on heterogeneous sources of information are affected by sensitive elements and inner biases in the data. We train automatic recruitment algorithms using a set of multimodal synthetic profiles consciously scored with gender and racial biases. Our methodology and results show how to generate fairer AI-based tools in general, and in particular fairer automated recruitment systems.
  arXiv  Detail & Related papers  (2020-04-15T15:58:05Z)

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.