Kandinsky Figures and Kandinsky Patterns are mathematically describable, simple self-contained hence controllable test data sets for the development, validation and training of explainability in artificial intelligence. Whilst Kandinsky Patterns have these computationally manageable properties, they are at the same time easily distinguishable from human observers. Consequently, controlled patterns can be described by both humans and computers. We define a Kandinsky Pattern as a set of Kandinsky Figures, where for each figure an "infallible authority" defines that the figure belongs to the Kandinsky Pattern. With this simple principle we build training and validation data sets for automatic interpretability and context learning. In this paper we describe the basic idea and some underlying principles of Kandinsky Patterns and provide a Github repository to invite the international machine learning research community to a challenge to experiment with our Kandinsky Patterns to expand and thus make progress in the field of explainable AI and to contribute to the upcoming field of explainability and causability.

On the other hand, AM has rapidlyfrom a given document (Lippi 2016). Recent years have seen the development evolved by exploiting state-of-the-art neural architectures of a large number of techniques in this area, on coming from deep learning. So far, the wake of the advancements produced by deep these two worlds have progressed largely independently learning on the whole research field of natural of each other. Only recently, a few works language processing (NLP). Yet, it is widely recognized have taken some steps towards the integration of that the existing AM systems still have such methods, by applying techniques combining a large margin of improvement, as good results sub-symbolic classifiers with knowledge expressed have been obtained with some genres where prior in the form of rules and constraints to AM. knowledge on the structure of the text eases some Niculae et al. (2017) adopted structuredFor instance, AM tasks, but other genres such as legal cases support vector machines and recurrent neural and social media documents still require more networks to collectively classify argument components work (Cabrio and Villata, 2018). Performing and and their relations in short documents, understanding argumentation requires advanced by hard-coding contextual dependencies and constraints reasoning capabilities that are natural skills for humans, of the argument model in a factor graph. but which are difficult to learn for a machine. A joint inference approach for argument component Understanding whether a given piece of classification and relation identification was evidence supports a given claim, or whether two Persing and Ng (2016), followinginstead proposed by claims attack each other, are complex problems a pipeline scheme where integer linear programming that humans are able to address thanks to their is used to enforce mathematical constraints ability to exploit commonsense knowledge, and to on the outcomes of a first-stage set of classifiers.

Predictive models are being increasingly used to support consequential decision making at the individual level in contexts such as pretrial bail and loan approval. As a result, there is increasing social and legal pressure to provide explanations that help the affected individuals not only to understand why a prediction was output, but also how to act to obtain a desired outcome. To this end, several works have proposed methods to generate counterfactual explanations. However, they are often restricted to a particular subset of models (e.g., decision trees or linear models), and cannot directly handle the mixed (numerical and nominal) nature of the features describing each individual. In this paper, we propose a model-agnostic algorithm to generate counterfactual explanations that builds on the standard theory and tools from formal verification. Specifically, our algorithm solves a sequence of satisfiability problems, where a wide variety of predictive models and distances in mixed feature spaces, as well as natural notions of plausibility and diversity, are represented as logic formulas. Our experiments on real-world data demonstrate that our approach can flexibly handle widely deployed predictive models, while providing meaningfully closer counterfactuals than existing approaches.

Explainability issues arise because machine learning outputs are numerical; deep neural networks are so opaque that users don't necessarily know which factor contributed to what aspect of the resulting score. There are several emergent techniques for increasing explainability and interpretability of machine learning results. After organizations gain insight into the black box of intricate machine learning models, the best way to explain those results to customers, regulators and legal entities is to translate them into rules that, by their very definition, offer full transparency for explainable AI. Rules can also highlight points of bias in models.

As artificial intelligence plays an increasingly important role in our society, there are ethical and moral obligations for both businesses and researchers to ensure that their machine learning models are designed, deployed, and maintained responsibly. These models need to be rigorously audited for fairness, robustness, transparency, and interpretability. A variety of methods have been developed that focus on these issues in isolation, however, managing these methods in conjunction with model development can be cumbersome and timeconsuming. In this paper, we introduce a unified and model-agnostic approach to address these issues: Counterfactual Explanations for Robustness, Transparency, Interpretability, and Fairness of Artificial Intelligence models (CERTIFAI). Unlike previous methods in this domain, CERTIFAI is a general tool that can be applied to any black-box model and any type of input data. Given a model and an input instance, CERTIFAI uses a custom genetic algorithm to generate counterfactuals: instances close to the input that change the prediction of the model. We demonstrate how these counterfactuals can be used to examine issues of robustness, interpretability, transparency, and fairness. Additionally, we introduce CERScore, the first black-box model robustness score that performs comparably to methods that have access to model internals.

Post-hoc explanations of machine learning models are crucial for people to understand and act on algorithmic predictions. An intriguing class of explanations is through counterfactuals, hypothetical examples that show people how to obtain a different prediction. We posit that effective counterfactual explanations should satisfy two properties: feasibility of the counterfactual actions given user context and constraints, and diversity among the counterfactuals presented. To this end, we propose a framework for generating and evaluating a diverse set of counterfactual explanations based on average distance and determinantal point processes. To evaluate the actionability of counterfactuals, we provide metrics that enable comparison of counterfactual-based methods to other local explanation methods. We further address necessary tradeoffs and point to causal implications in optimizing for counterfactuals. Our experiments on three real-world datasets show that our framework can generate a set of counterfactuals that are diverse and well approximate local decision boundaries.

Explainable AI is the idea that an AI algorithm should be able to explain how it reached a conclusion in a way that humans can decipher. There's a well-known "black box problem" where an AI algorithm can determine something but is not able to give details about the factors that caused that result. Then, how can people feel that they can authoritatively trust what an AI algorithm says? Getting to the goal of explainable AI is an admirable and necessary feat, but it's not straightforward. Here are four things that the tech industry needs to realize before we get to the point of making explainable AI a reality. It's understandable why people assert that if AI can explain itself, members of the general public, as well as businesses who use AI to make decisions, will believe it's more trustworthy.

We apply ideas from abstract argumentation theory to study cooperative game theory. Building on Dung's results in his seminal paper, we further the correspondence between Dung's four argumentation semantics and solution concepts in cooperative game theory by showing that complete extensions (the grounded extension) correspond to Roth's subsolutions (respectively, the supercore). We then investigate the relationship between well-founded argumentation frameworks and convex games, where in each case the semantics (respectively, solution concepts) coincide; we prove that three-player convex games do not in general have well-founded argumentation frameworks.

In the field of argumentation, the vision of robust argumentation machines is investigated. They explore natural language arguments from available information sources on the web and reason with them on the knowledge level to actively support the deliberation and synthesis of arguments for a particular query of a user. We aim at combining methods from case-based reasoning (CBR), information retrieval, and computational argumentation to contribute to the foundations of such argumentation machines. In this paper, we focus on the retrieval phase of a CBR approach for an argumentation machine and propose similarity measures for arguments represented as argument graphs. We evaluate the similarity measures on a corpus of annotated micro texts containing different topics and demonstrate the benefit of semantic similarity measures as well as the relevance of structural aspects.

Translating machine learning (ML) models effectively to clinical practice requires establishing clinicians' trust. Explainability, or the ability of an ML model to justify its outcomes and assist clinicians in rationalizing the model prediction, has been generally understood to be critical to establishing trust. However, the field suffers from the lack of concrete definitions for usable explanations in different settings. To identify specific aspects of explainability that may catalyze building trust in ML models, we surveyed clinicians from two distinct acute care specialties (Intenstive Care Unit and Emergency Department). We use their feedback to characterize when explainability helps to improve clinicians' trust in ML models. We further identify the classes of explanations that clinicians identified as most relevant and crucial for effective translation to clinical practice. Finally, we discern concrete metrics for rigorous evaluation of clinical explainability methods. By integrating perceptions of explainability between clinicians and ML researchers we hope to facilitate the endorsement and broader adoption and sustained use of ML systems in healthcare.