Applying Attribution Explanations in Truth-Discovery Quantitative Bipolar Argumentation Frameworks

• URL: http://arxiv.org/abs/2409.05831v1
• Date: Mon, 9 Sep 2024 17:36:39 GMT
• Title: Applying Attribution Explanations in Truth-Discovery Quantitative Bipolar Argumentation Frameworks
• Authors: Xiang Yin, Nico Potyka, Francesca Toni,
• Abstract summary: Argument Attribution Explanations (AAEs) and Relation Attribution Explanations (RAEs) are used to explain the strength of arguments under gradual semantics. We apply AAEs and RAEs to Truth Discovery QBAFs, which assess the trustworthiness of sources and their claims. We find that both AAEs and RAEs can provide interesting explanations and can give non-trivial and surprising insights.
• Score: 18.505289553533164
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Explaining the strength of arguments under gradual semantics is receiving increasing attention. For example, various studies in the literature offer explanations by computing the attribution scores of arguments or edges in Quantitative Bipolar Argumentation Frameworks (QBAFs). These explanations, known as Argument Attribution Explanations (AAEs) and Relation Attribution Explanations (RAEs), commonly employ removal-based and Shapley-based techniques for computing the attribution scores. While AAEs and RAEs have proven useful in several applications with acyclic QBAFs, they remain largely unexplored for cyclic QBAFs. Furthermore, existing applications tend to focus solely on either AAEs or RAEs, but do not compare them directly. In this paper, we apply both AAEs and RAEs, to Truth Discovery QBAFs (TD-QBAFs), which assess the trustworthiness of sources (e.g., websites) and their claims (e.g., the severity of a virus), and feature complex cycles. We find that both AAEs and RAEs can provide interesting explanations and can give non-trivial and surprising insights.

Related papers

• GRSQA -- Graph Reasoning-Structured Question Answering Dataset [50.223851616680754]
  We introduce the Graph Reasoning-Structured Question Answering dataset (GRS-QA), which includes both semantic contexts and reasoning structures for QA pairs. Unlike existing M-QA datasets, GRS-QA explicitly captures intricate reasoning pathways by constructing reasoning graphs. Our empirical analysis reveals that LLMs perform differently when handling questions with varying reasoning structures.
  arXiv  Detail & Related papers  (2024-11-01T05:14:03Z)
• Atomic Fact Decomposition Helps Attributed Question Answering [30.75332718824254]
  Attributed Question Answering (AQA) aims to provide both a trustworthy answer and a reliable attribution report for a question. This paper proposes an Atomic fact decomposition-based Retrieval and Editing framework. It decomposes the generated long-form answers into molecular clauses and atomic facts by the instruction-tuned LLMs.
  arXiv  Detail & Related papers  (2024-10-22T05:25:54Z)
• CE-QArg: Counterfactual Explanations for Quantitative Bipolar Argumentation Frameworks (Technical Report) [18.505289553533164]
  We propose an iterative algorithm named Counterfactual Explanations for Quantitative bipolar Argumentation frameworks (CE-QArg) CE-QArg can identify valid and cost-effective counterfactual explanations based on two core modules, polarity and priority. We discuss some formal properties of our counterfactual explanations and empirically evaluate CE-QArg on randomly generated QBAFs.
  arXiv  Detail & Related papers  (2024-07-11T13:34:11Z)
• Iterative Utility Judgment Framework via LLMs Inspired by Relevance in Philosophy [66.95501113584541]
  Utility and topical relevance are critical measures in information retrieval. We propose an Iterative utiliTy judgmEnt fraMework to promote each step of the cycle of Retrieval-Augmented Generation.
  arXiv  Detail & Related papers  (2024-06-17T07:52:42Z)
• Explaining Arguments' Strength: Unveiling the Role of Attacks and Supports (Technical Report) [13.644164255651472]
  We propose a novel theory of Relation Attribution Explanations (RAEs) RAEs offer fine-grained insights into the role of attacks and supports in quantitative bipolar argumentation towards obtaining the arguments' strength. We show the application value of RAEs in fraud detection and large language models case studies.
  arXiv  Detail & Related papers  (2024-04-22T16:02:48Z)
• Instantiations and Computational Aspects of Non-Flat Assumption-based Argumentation [18.32141673219938]
  We study an instantiation-based approach for reasoning in possibly non-flat ABA. We propose two algorithmic approaches for reasoning in possibly non-flat ABA.
  arXiv  Detail & Related papers  (2024-04-17T14:36:47Z)
• CASA: Causality-driven Argument Sufficiency Assessment [79.13496878681309]
  We propose CASA, a zero-shot causality-driven argument sufficiency assessment framework. PS measures how likely introducing the premise event would lead to the conclusion when both the premise and conclusion events are absent. Experiments on two logical fallacy detection datasets demonstrate that CASA accurately identifies insufficient arguments.
  arXiv  Detail & Related papers  (2024-01-10T16:21:18Z)
• Merging Generated and Retrieved Knowledge for Open-Domain QA [72.42262579925911]
  COMBO is a compatibility-Oriented knowledge Merging for Better Open-domain QA framework. We show that COMBO outperforms competitive baselines on three out of four tested open-domain QA benchmarks.
  arXiv  Detail & Related papers  (2023-10-22T19:37:06Z)
• Argument Attribution Explanations in Quantitative Bipolar Argumentation Frameworks (Technical Report) [17.9926469947157]
  We propose a novel theory of Argument Explanations (AAEs) by incorporating the spirit of feature attribution from machine learning. AAEs are used to determine the influence of arguments towards topic arguments of interest. We study desirable properties of AAEs, including some new ones and some partially adapted from the literature to our setting.
  arXiv  Detail & Related papers  (2023-07-25T15:36:33Z)
• Enriching Relation Extraction with OpenIE [70.52564277675056]
  Relation extraction (RE) is a sub-discipline of information extraction (IE) In this work, we explore how recent approaches for open information extraction (OpenIE) may help to improve the task of RE. Our experiments over two annotated corpora, KnowledgeNet and FewRel, demonstrate the improved accuracy of our enriched models.
  arXiv  Detail & Related papers  (2022-12-19T11:26:23Z)
• Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering [50.546622625151926]
  We propose a new framework to exploit more valid facts while obtaining explainability for multi-hop QA. Our framework contains three new ideas: (a) tt AMR-SG, an AMR-based Semantic Graph, constructed by candidate fact AMRs to uncover any hop relations among question, answer and multiple facts, (b) a novel path-based fact analytics approach exploiting tt AMR-SG to extract active facts from a large fact pool to answer questions, and (c) a fact-level relation modeling leveraging graph convolution network (GCN) to guide the reasoning process.
  arXiv  Detail & Related papers  (2021-05-25T09:14:55Z)

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.