XPROAX-Local explanations for text classification with progressive neighborhood approximation

• URL: http://arxiv.org/abs/2109.15004v1
• Date: Thu, 30 Sep 2021 11:01:07 GMT
• Title: XPROAX-Local explanations for text classification with progressive neighborhood approximation
• Authors: Yi Cai, Arthur Zimek, Eirini Ntoutsi
• Abstract summary: We propose a progressive approximation of the neighborhood using counterfactual instances as initial landmarks. We then refine counterfactuals and generate factuals in the neighborhood of the input instance to be explained. Our experiments on real-world datasets demonstrate that our method outperforms the competitors in terms of usefulness and stability.
• Score: 13.312630052709766
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The importance of the neighborhood for training a local surrogate model to approximate the local decision boundary of a black box classifier has been already highlighted in the literature. Several attempts have been made to construct a better neighborhood for high dimensional data, like texts, by using generative autoencoders. However, existing approaches mainly generate neighbors by selecting purely at random from the latent space and struggle under the curse of dimensionality to learn a good local decision boundary. To overcome this problem, we propose a progressive approximation of the neighborhood using counterfactual instances as initial landmarks and a careful 2-stage sampling approach to refine counterfactuals and generate factuals in the neighborhood of the input instance to be explained. Our work focuses on textual data and our explanations consist of both word-level explanations from the original instance (intrinsic) and the neighborhood (extrinsic) and factual- and counterfactual-instances discovered during the neighborhood generation process that further reveal the effect of altering certain parts in the input text. Our experiments on real-world datasets demonstrate that our method outperforms the competitors in terms of usefulness and stability (for the qualitative part) and completeness, compactness and correctness (for the quantitative part).

Related papers

• Downstream-Pretext Domain Knowledge Traceback for Active Learning [138.02530777915362]
  We propose a downstream-pretext domain knowledge traceback (DOKT) method that traces the data interactions of downstream knowledge and pre-training guidance. DOKT consists of a traceback diversity indicator and a domain-based uncertainty estimator. Experiments conducted on ten datasets show that our model outperforms other state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-07-20T01:34:13Z)
• Guarantee Regions for Local Explanations [29.429229877959663]
  We propose an anchor-based algorithm for identifying regions in which local explanations are guaranteed to be correct. Our method produces an interpretable feature-aligned box where the prediction of the local surrogate model is guaranteed to match the predictive model.
  arXiv  Detail & Related papers  (2024-02-20T06:04:44Z)
• Trust your Good Friends: Source-free Domain Adaptation by Reciprocal Neighborhood Clustering [50.46892302138662]
  We address the source-free domain adaptation problem, where the source pretrained model is adapted to the target domain in the absence of source data. Our method is based on the observation that target data, which might not align with the source domain classifier, still forms clear clusters. We demonstrate that this local structure can be efficiently captured by considering the local neighbors, the reciprocal neighbors, and the expanded neighborhood.
  arXiv  Detail & Related papers  (2023-09-01T15:31:18Z)
• Robust Networked Federated Learning for Localization [7.332862402432447]
  This paper addresses the problem of approximation, which is non-smooth in a federated setting where the data is distributed across a multitude of devices. We propose a method that adopts an $L_$-norm that a robust formulation within a distributed subgradient framework, explicitly designed to handle these obstacles.
  arXiv  Detail & Related papers  (2023-08-31T13:54:37Z)
• Improving the Robustness of Summarization Systems with Dual Augmentation [68.53139002203118]
  A robust summarization system should be able to capture the gist of the document, regardless of the specific word choices or noise in the input. We first explore the summarization models' robustness against perturbations including word-level synonym substitution and noise. We propose a SummAttacker, which is an efficient approach to generating adversarial samples based on language models.
  arXiv  Detail & Related papers  (2023-06-01T19:04:17Z)
• Explaining text classifiers through progressive neighborhood approximation with realistic samples [19.26084350822197]
  The importance of neighborhood construction in local explanation methods has been highlighted in the literature. Several attempts have been made to improve neighborhood quality for high-dimensional data, for example, texts, by adopting generative models. We propose a progressive approximation approach that refines the neighborhood of a to-be-explained decision with a careful two-stage approach.
  arXiv  Detail & Related papers  (2023-02-11T11:42:39Z)
• Point-Level Region Contrast for Object Detection Pre-Training [147.47349344401806]
  We present point-level region contrast, a self-supervised pre-training approach for the task of object detection. Our approach performs contrastive learning by directly sampling individual point pairs from different regions. Compared to an aggregated representation per region, our approach is more robust to the change in input region quality.
  arXiv  Detail & Related papers  (2022-02-09T18:56:41Z)
• Receptive Multi-granularity Representation for Person Re-Identification [46.99913453669368]
  This paper proposes a receptive multi-granularity learning approach to facilitate stripe-based feature learning. By two-branch network architecture, different scales of discriminative identity representation can be learned. Our approach achieves a state-of-the-art accuracy of 96.2%@Rank-1 or 90.0%@mAP on the challenging Market-1501 benchmark.
  arXiv  Detail & Related papers  (2020-08-31T09:26:08Z)
• A flexible outlier detector based on a topology given by graph communities [0.0]
  anomaly detection is essential for optimal performance of machine learning methods and statistical predictive models. Topology is computed using the communities of a weighted graph codifying mutual nearest neighbors in the feature space. Our approach overall outperforms, both, local and global strategies in multi and single view settings.
  arXiv  Detail & Related papers  (2020-02-18T18:40:31Z)
• Contradictory Structure Learning for Semi-supervised Domain Adaptation [67.89665267469053]
  Current adversarial adaptation methods attempt to align the cross-domain features. Two challenges remain unsolved: 1) the conditional distribution mismatch and 2) the bias of the decision boundary towards the source domain. We propose a novel framework for semi-supervised domain adaptation by unifying the learning of opposite structures.
  arXiv  Detail & Related papers  (2020-02-06T22:58:20Z)

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.