Reasoning about Counterfactuals and Explanations: Problems, Results and Directions

• URL: http://arxiv.org/abs/2108.11004v1
• Date: Wed, 25 Aug 2021 01:04:49 GMT
• Title: Reasoning about Counterfactuals and Explanations: Problems, Results and Directions
• Authors: Leopoldo Bertossi
• Abstract summary: These approaches are flexible and modular in that they allow the seamless addition of domain knowledge. The programs can be used to specify and compute responsibility-based numerical scores as attributive explanations for classification results.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: There are some recent approaches and results about the use of answer-set programming for specifying counterfactual interventions on entities under classification, and reasoning about them. These approaches are flexible and modular in that they allow the seamless addition of domain knowledge. Reasoning is enabled by query answering from the answer-set program. The programs can be used to specify and compute responsibility-based numerical scores as attributive explanations for classification results.

Related papers

• Evaluating Human Alignment and Model Faithfulness of LLM Rationale [66.75309523854476]
  We study how well large language models (LLMs) explain their generations through rationales. We show that prompting-based methods are less "faithful" than attribution-based explanations.
  arXiv  Detail & Related papers  (2024-06-28T20:06:30Z)
• Clarify When Necessary: Resolving Ambiguity Through Interaction with LMs [58.620269228776294]
  We propose a task-agnostic framework for resolving ambiguity by asking users clarifying questions. We evaluate systems across three NLP applications: question answering, machine translation and natural language inference. We find that intent-sim is robust, demonstrating improvements across a wide range of NLP tasks and LMs.
  arXiv  Detail & Related papers  (2023-11-16T00:18:50Z)
• A Mechanistic Interpretation of Arithmetic Reasoning in Language Models using Causal Mediation Analysis [128.0532113800092]
  We present a mechanistic interpretation of Transformer-based LMs on arithmetic questions. This provides insights into how information related to arithmetic is processed by LMs.
  arXiv  Detail & Related papers  (2023-05-24T11:43:47Z)
• Explainable Data-Driven Optimization: From Context to Decision and Back Again [76.84947521482631]
  Data-driven optimization uses contextual information and machine learning algorithms to find solutions to decision problems with uncertain parameters. We introduce a counterfactual explanation methodology tailored to explain solutions to data-driven problems. We demonstrate our approach by explaining key problems in operations management such as inventory management and routing.
  arXiv  Detail & Related papers  (2023-01-24T15:25:16Z)
• Complementary Explanations for Effective In-Context Learning [77.83124315634386]
  Large language models (LLMs) have exhibited remarkable capabilities in learning from explanations in prompts. This work aims to better understand the mechanisms by which explanations are used for in-context learning.
  arXiv  Detail & Related papers  (2022-11-25T04:40:47Z)
• Answer-Set Programs for Reasoning about Counterfactual Interventions and Responsibility Scores for Classification [0.0]
  We describe how answer-set programs can be used to declaratively specify counterfactual interventions on entities under classification. In particular, they can be used to define and compute responsibility scores as attribution-based explanations for outcomes from classification models.
  arXiv  Detail & Related papers  (2021-07-21T15:41:56Z)
• Score-Based Explanations in Data Management and Machine Learning: An Answer-Set Programming Approach to Counterfactual Analysis [0.0]
  We describe some recent approaches to score-based explanations for query answers in databases and outcomes from classification models in machine learning. Special emphasis is placed on declarative approaches based on answer-set programming to the use of counterfactual reasoning for score specification and computation.
  arXiv  Detail & Related papers  (2021-06-19T19:21:48Z)
• Discrete Reasoning Templates for Natural Language Understanding [79.07883990966077]
  We present an approach that reasons about complex questions by decomposing them to simpler subquestions. We derive the final answer according to instructions in a predefined reasoning template. We show that our approach is competitive with the state-of-the-art while being interpretable and requires little supervision.
  arXiv  Detail & Related papers  (2021-04-05T18:56:56Z)
• Declarative Approaches to Counterfactual Explanations for Classification [0.0]
  We propose answer-set programs that specify and compute counterfactual interventions on entities that are input on a classification model. The resulting counterfactual entities serve as a basis for the definition and computation of causality-based explanation scores for the feature values in the entity under classification.
  arXiv  Detail & Related papers  (2020-11-15T00:44:33Z)
• Score-Based Explanations in Data Management and Machine Learning [0.0]
  We consider explanations for query answers in databases, and for results from classification models. The described approaches are mostly of a causal and counterfactual nature.
  arXiv  Detail & Related papers  (2020-07-24T23:13:27Z)
• An ASP-Based Approach to Counterfactual Explanations for Classification [0.0]
  We propose answer-set programs that specify and compute counterfactual interventions as a basis for causality-based explanations to decisions produced by classification models. They can be applied with black-box models and models that can be specified as logic programs, such as rule-based classifiers.
  arXiv  Detail & Related papers  (2020-04-28T01:36:26Z)

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.