English
Related papers

Related papers: Learning Interpretable Temporal Properties from Po…

200 papers

We propose Black Box Explanations through Transparent Approximations (BETA), a novel model agnostic framework for explaining the behavior of any black-box classifier by simultaneously optimizing for fidelity to the original model and…

Artificial Intelligence · Computer Science 2017-07-06 Himabindu Lakkaraju , Ece Kamar , Rich Caruana , Jure Leskovec

This paper considers the problem of learning temporal task specifications, e.g. automata and temporal logic, from expert demonstrations. Task specifications are a class of sparse memory augmented rewards with explicit support for temporal…

Artificial Intelligence · Computer Science 2023-04-25 Marcell Vazquez-Chanlatte , Ameesh Shah , Gil Lederman , Sanjit A. Seshia

Few-shot learning (FSL) presents a challenging learning problem in which only a few samples are available for each class. Decision interpretation is more important in few-shot classification due to a greater chance of error compared to…

Machine Learning · Computer Science 2025-04-01 Mohammad Reza Zarei , Majid Komeili

For performing robotic manipulation tasks, the core problem is determining suitable trajectories that fulfill the task requirements. Various approaches to compute such trajectories exist, being learning and optimization the main driving…

Robotics · Computer Science 2022-09-08 Akshay Dhonthi , Philipp Schillinger , Leonel Rozo , Daniele Nardi

Cyber-physical system applications such as autonomous vehicles, wearable devices, and avionic systems generate a large volume of time-series data. Designers often look for tools to help classify and categorize the data. Traditional machine…

Many risk-sensitive applications require Machine Learning (ML) models to be interpretable. Attempts to obtain interpretable models typically rely on tuning, by trial-and-error, hyper-parameters of model complexity that are only loosely…

Machine Learning · Computer Science 2020-05-29 Marco Virgolin , Andrea De Lorenzo , Eric Medvet , Francesca Randone

We propose an automata theoretic learning algorithm for the identification of black-box switched linear systems whose switching logics are event-driven. A switched system is expressed by a deterministic finite automaton (FA) whose node…

Systems and Control · Electrical Eng. & Systems 2021-11-11 Atreyee Kundu , Pavithra Prabhakar

In machine learning algorithm design, there exists a trade-off between the interpretability and performance of the algorithm. In general, algorithms which are simpler and easier for humans to comprehend tend to show worse performance than…

Machine Learning · Computer Science 2024-07-15 Eric M. Vernon , Naoki Masuyama , Yusuke Nojima

Machine Learning (ML) provides important techniques for classification and predictions. Most of these are black-box models for users and do not provide decision-makers with an explanation. For the sake of transparency or more validity of…

Machine Learning · Computer Science 2021-02-26 Léonard Kwuida , Dmitry I. Ignatov

Local explanation frameworks aim to rationalize particular decisions made by a black-box prediction model. Existing techniques are often restricted to a specific type of predictor or based on input saliency, which may be undesirably…

Machine Learning · Computer Science 2019-02-12 Brandon Carter , Jonas Mueller , Siddhartha Jain , David Gifford

State of the art machine learning algorithms are highly optimized to provide the optimal prediction possible, naturally resulting in complex models. While these models often outperform simpler more interpretable models by order of…

Machine Learning · Statistics 2016-11-24 Yotam Hechtlinger

Interpretability of AI models allows for user safety checks to build trust in these models. In particular, decision trees (DTs) provide a global view on the learned model and clearly outlines the role of the features that are critical to…

Machine Learning · Computer Science 2023-04-13 Hector Kohler , Riad Akrour , Philippe Preux

Automata learning is a successful tool for many application domains such as robotics and automatic verification. Typically, automata learning techniques operate in a supervised learning setting (active or passive) where they learn a finite…

Machine Learning · Computer Science 2025-08-25 Simon Lutz , Daniil Kaminskyi , Florian Wittbold , Simon Dierl , Falk Howar , Barbara König , Emmanuel Müller , Daniel Neider

Despite the high performance of neural network-based time series forecasting methods, the inherent challenge in explaining their predictions has limited their applicability in certain application areas. Due to the difficulty in identifying…

Machine Learning · Computer Science 2023-01-09 Ozan Ozyegen , Juyoung Wang , Mucahit Cevik

The rapid evolution of machine learning (ML) has led to the widespread adoption of complex "black box" models, such as deep neural networks and ensemble methods. These models exhibit exceptional predictive performance, making them…

Machine Learning · Computer Science 2025-03-28 Moncef Garouani , Josiane Mothe , Ayah Barhrhouj , Julien Aligon

Explainable AI is an emerging field providing solutions for acquiring insights into automated systems' rationale. It has been put on the AI map by suggesting ways to tackle key ethical and societal issues. Existing explanation techniques…

Machine Learning · Computer Science 2022-05-02 Ioannis Mollas , Nick Bassiliades , Grigorios Tsoumakas

Deep generative models, while revolutionizing fields like image and text generation, largely operate as opaque ``black boxes'', hindering human understanding, control, and alignment. While methods like sparse autoencoders (SAEs) show…

Machine Learning · Computer Science 2026-04-03 Lingjing Kong , Shaoan Xie , Guangyi Chen , Yuewen Sun , Xiangchen Song , Eric P. Xing , Kun Zhang

Time series classification is a task of paramount importance, as this kind of data often arises in safety-critical applications. However, it is typically tackled with black-box deep learning methods, making it hard for humans to understand…

Machine Learning · Computer Science 2025-08-28 Irene Ferfoglia , Simone Silvetti , Gaia Saveri , Laura Nenzi , Luca Bortolussi

Although deep learning models have proven effective at solving problems in natural language processing, the mechanism by which they come to their conclusions is often unclear. As a result, these models are generally treated as black boxes,…

Computation and Language · Computer Science 2017-02-28 W. James Murdoch , Arthur Szlam

Large language models (LLMs) have demonstrated strong performance on formal language tasks, yet whether this reflects genuine symbolic reasoning or pattern matching on familiar constructions remains unclear. We introduce a benchmark for…

Computation and Language · Computer Science 2026-01-21 Shlok Shelat , Jay Raval , Souvik Roy , Manas Gaur