Robust Text Classification: Analyzing Prototype-Based Networks

• URL: http://arxiv.org/abs/2311.06647v3
• Date: Mon, 28 Oct 2024 01:35:01 GMT
• Title: Robust Text Classification: Analyzing Prototype-Based Networks
• Authors: Zhivar Sourati, Darshan Deshpande, Filip Ilievski, Kiril Gashteovski, Sascha Saralajew,
• Abstract summary: Prototype-Based Networks (PBNs) have been shown to be robust to noise for computer vision tasks. We study whether the robustness properties of PBNs transfer to text classification tasks under both targeted and static adversarial attack settings. We showcase how PBNs' interpretability can help us to understand PBNs' robustness properties.
• Score: 12.247144383314177
• License:
• Abstract: Downstream applications often require text classification models to be accurate and robust. While the accuracy of the state-of-the-art Language Models (LMs) approximates human performance, they often exhibit a drop in performance on noisy data found in the real world. This lack of robustness can be concerning, as even small perturbations in the text, irrelevant to the target task, can cause classifiers to incorrectly change their predictions. A potential solution can be the family of Prototype-Based Networks (PBNs) that classifies examples based on their similarity to prototypical examples of a class (prototypes) and has been shown to be robust to noise for computer vision tasks. In this paper, we study whether the robustness properties of PBNs transfer to text classification tasks under both targeted and static adversarial attack settings. Our results show that PBNs, as a mere architectural variation of vanilla LMs, offer more robustness compared to vanilla LMs under both targeted and static settings. We showcase how PBNs' interpretability can help us to understand PBNs' robustness properties. Finally, our ablation studies reveal the sensitivity of PBNs' robustness to how strictly clustering is done in the training phase, as tighter clustering results in less robust PBNs.

Related papers

• B-cosification: Transforming Deep Neural Networks to be Inherently Interpretable [53.848005910548565]
  'B-cosification' is a novel approach to transform existing pre-trained models to become inherently interpretable. We find that B-cosification can yield models that are on par with B-cos models trained from scratch in terms of interpretability.
  arXiv  Detail & Related papers  (2024-11-01T16:28:11Z)
• Improving Network Interpretability via Explanation Consistency Evaluation [56.14036428778861]
  We propose a framework that acquires more explainable activation heatmaps and simultaneously increase the model performance. Specifically, our framework introduces a new metric, i.e., explanation consistency, to reweight the training samples adaptively in model learning. Our framework then promotes the model learning by paying closer attention to those training samples with a high difference in explanations.
  arXiv  Detail & Related papers  (2024-08-08T17:20:08Z)
• Contrastive variational information bottleneck for aspect-based sentiment analysis [36.83876224466177]
  We propose to reduce spurious correlations for aspect-based sentiment analysis (ABSA) via a novel Contrastive Variational Information Bottleneck framework (called CVIB) The proposed CVIB framework is composed of an original network and a self-pruned network, and these two networks are optimized simultaneously via contrastive learning. Our approach achieves better performance than the strong competitors in terms of overall prediction performance, robustness, and generalization.
  arXiv  Detail & Related papers  (2023-03-06T02:52:37Z)
• Counterbalancing Teacher: Regularizing Batch Normalized Models for Robustness [15.395021925719817]
  Batch normalization (BN) is a technique for training deep neural networks that accelerates their convergence to reach higher accuracy. We show that BN incentivizes the model to rely on low-variance features that are highly specific to the training (in-domain) data. We propose Counterbalancing Teacher (CT) to enforce the student network's learning of robust representations.
  arXiv  Detail & Related papers  (2022-07-04T16:16:24Z)
• On Fragile Features and Batch Normalization in Adversarial Training [83.25056150489446]
  We investigate the role of batch normalization (BN) in adversarial training. BN is used in adversarial training, which is the de-facto standard to learn robust features. Our results indicate that fragile features can be used to learn models with moderate adversarial robustness, while random features cannot.
  arXiv  Detail & Related papers  (2022-04-26T15:49:33Z)
• Diagnosing Batch Normalization in Class Incremental Learning [39.70552266952221]
  Batch normalization (BN) standardizes intermediate feature maps and has been widely validated to improve training stability and convergence. We propose BN Tricks to address the issue by training a better feature extractor while eliminating classification bias. We show that BN Tricks can bring significant performance gains to all adopted baselines.
  arXiv  Detail & Related papers  (2022-02-16T12:38:43Z)
• Clustering Effect of (Linearized) Adversarial Robust Models [60.25668525218051]
  We propose a novel understanding of adversarial robustness and apply it on more tasks including domain adaption and robustness boosting. Experimental evaluations demonstrate the rationality and superiority of our proposed clustering strategy.
  arXiv  Detail & Related papers  (2021-11-25T05:51:03Z)
• Test-time Batch Statistics Calibration for Covariate Shift [66.7044675981449]
  We propose to adapt the deep models to the novel environment during inference. We present a general formulation $alpha$-BN to calibrate the batch statistics. We also present a novel loss function to form a unified test time adaptation framework Core.
  arXiv  Detail & Related papers  (2021-10-06T08:45:03Z)
• AES Systems Are Both Overstable And Oversensitive: Explaining Why And Proposing Defenses [66.49753193098356]
  We investigate the reason behind the surprising adversarial brittleness of scoring models. Our results indicate that autoscoring models, despite getting trained as "end-to-end" models, behave like bag-of-words models. We propose detection-based protection models that can detect oversensitivity and overstability causing samples with high accuracies.
  arXiv  Detail & Related papers  (2021-09-24T03:49:38Z)
• Understanding Structural Vulnerability in Graph Convolutional Networks [27.602802961213236]
  Graph Convolutional Networks (GCNs) are vulnerable to adversarial attacks on the graph structure. We show that structural adversarial examples can be attributed to the non-robust aggregation scheme of GCNs. We show that adopting the aggregation scheme with a high breakdown point could significantly enhance the robustness of GCNs against structural attacks.
  arXiv  Detail & Related papers  (2021-08-13T15:07:44Z)

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.