English
Related papers

Related papers: Short Boolean Formulas as Explanations in Practice

200 papers

Model explainability is crucial for human users to be able to interpret how a proposed classifier assigns labels to data based on its feature values. We study generalized linear models constructed using sets of feature value rules, which…

Machine Learning · Statistics 2023-11-06 Sanjeeb Dash , Soumyadip Ghosh , Joao Goncalves , Mark S. Squillante

To increase the adoption of counterfactual explanations in practice, several criteria that these should adhere to have been put forward in the literature. We propose counterfactual explanations using optimization with constraint learning…

Machine Learning · Computer Science 2022-12-15 Donato Maragno , Tabea E. Röber , Ilker Birbil

A task of interest in machine learning (ML) is that of ascribing explanations to the predictions made by ML models. Furthermore, in domains deemed high risk, the rigor of explanations is paramount. Indeed, incorrect explanations can and…

Artificial Intelligence · Computer Science 2025-07-11 Mohamed Siala , Jordi Planes , Joao Marques-Silva

Automated decision making is used routinely throughout our everyday life. Recommender systems decide which jobs, movies, or other user profiles might be interesting to us. Spell checkers help us to make good use of language. Fraud detection…

Machine Learning · Computer Science 2020-07-15 Alexander Jung , Pedro H. J. Nardelli

*Minimal sufficient reasons* represent a prevalent form of explanation - the smallest subset of input features which, when held constant at their corresponding values, ensure that the prediction remains unchanged. Previous *post-hoc*…

Machine Learning · Computer Science 2025-03-04 Shahaf Bassan , Ron Eliav , Shlomit Gur

Many recent algorithms for approximate model counting are based on a reduction to combinatorial searches over random subsets of the space defined by parity or XOR constraints. Long parity constraints (involving many variables) provide…

Computational Complexity · Computer Science 2016-09-12 Shengjia Zhao , Sorathan Chaturapruek , Ashish Sabharwal , Stefano Ermon

Explanation methods aim to make neural networks more trustworthy and interpretable. In this paper, we demonstrate a property of explanation methods which is disconcerting for both of these purposes. Namely, we show that explanations can be…

A local surrogate for an AI-model correcting a simpler 'base' model is introduced representing an analytical method to yield explanations of AI-predictions. The approach is studied here in the context of the base model being linear…

Machine Learning · Statistics 2023-09-12 Florian Sobieczky , Manuela Geiß

Model explainability is essential for the creation of trustworthy Machine Learning models in healthcare. An ideal explanation resembles the decision-making process of a domain expert and is expressed using concepts or terminology that is…

Machine Learning · Computer Science 2021-07-14 Sumedha Singla , Stephen Wallace , Sofia Triantafillou , Kayhan Batmanghelich

It is generally accepted that all models are wrong -- the difficulty is determining which are useful. Here, a useful model is considered as one that is capable of combining data and expert knowledge, through an inversion or calibration…

Machine Learning · Statistics 2017-03-22 George M. Mathews , John Vial

Calibration strengthens the trustworthiness of black-box models by producing better accurate confidence estimates on given examples. However, little is known about if model explanations can help confidence calibration. Intuitively, humans…

Computation and Language · Computer Science 2022-11-08 Dongfang Li , Baotian Hu , Qingcai Chen

We study the faithfulness of an explanation system to the underlying prediction model. We show that this can be captured by two properties, consistency and sufficiency, and introduce quantitative measures of the extent to which these hold.…

Machine Learning · Computer Science 2022-02-03 Sanjoy Dasgupta , Nave Frost , Michal Moshkovitz

This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two…

Data Structures and Algorithms · Computer Science 2018-04-17 Carlos Barrón-Romero

Explanations on relational data are hard to verify since the explanation structures are more complex (e.g. graphs). To verify interpretable explanations (e.g. explanations of predictions made in images, text, etc.), typically human subjects…

Artificial Intelligence · Computer Science 2024-01-08 Abisha Thapa Magar , Anup Shakya , Somdeb Sarkhel , Deepak Venugopal

Machine learning methods are being increasingly applied in sensitive societal contexts, where decisions impact human lives. Hence it has become necessary to build capabilities for providing easily-interpretable explanations of models'…

Machine Learning · Computer Science 2021-04-13 Alfredo Carrillo , Luis F. Cantú , Luis Tejerina , Alejandro Noriega

The problem of counting the number of models of a given Boolean formula has numerous applications, including computing the leakage of deterministic programs in Quantitative Information Flow. Model counting is a hard, #P-complete problem.…

Logic in Computer Science · Computer Science 2024-05-24 Michele Boreale , Daniele Gorla

Despite the wide use of explainability techniques to attempt to understand the behavior of Artificial Intelligence (AI), the generated explanations may not always be reliable. An explanation can appear plausible to humans but fail to…

Machine Learning · Computer Science 2026-05-28 Tomás Pereira , João Vitorino , Eva Maia , Isabel Praça

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…

Machine Learning · Computer Science 2020-01-16 Lior Wolf , Tomer Galanti , Tamir Hazan

In a standard regression problem, we have a set of explanatory variables whose effect on some response vector is modeled. For wide binary data, such as genetic marker data, we often have two limitations. First, we have more parameters than…

Methodology · Statistics 2021-09-20 Katharina Parry , Leo N. Geppert , Alexander Munteanu , Katja Ickstadt

We consider the problem of linearizing a pseudo-Boolean function $f : \{0,1\}^n \to \mathbb{R}$ by means of $k$ Boolean functions. Such a linearization yields an integer linear programming formulation with only $k$ auxiliary variables. This…

Discrete Mathematics · Computer Science 2024-08-14 Matthias Walter
‹ Prev 1 3 4 5 6 7 10 Next ›