Use Perturbations when Learning from Explanations

Machine learning from explanations (MLX) is an approach to learning that uses human-provided explanations of relevant or irrelevant features for each input to ensure that model predictions are right for the right reasons. Existing MLX approaches rely on local model interpretation methods and require strong model smoothing to align model and human explanations, leading to sub-optimal performance. We recast MLX as a robustness problem, where human explanations specify a lower dimensional manifold from which perturbations can be drawn, and show both theoretically and empirically how this approach alleviates the need for strong model smoothing. We consider various approaches to achieving robustness, leading to improved performance over prior MLX methods. Finally, we show how to combine robustness with an earlier MLX method, yielding state-of-the-art results on both synthetic and real-world benchmarks.

Paper

References (43)

Scroll for more · 31 remaining

Similar papers

Peer review

Reviewer WA6d7/10 · confidence 4/52023-06-23

Summary

This paper proposes a novel approach to Machine Learning from Explanations (MLX), the setting in which data points for learning are paired with human-annotated “explanations”, usually in the form of image masks marking regions that are known to be irrelevant with respect to the downstream prediction task. Previous methods for MLX made use of regularization-based techniques, forcing the learnt function to be locally independent of the irrelevant features for the training data points. The authors show that these methods require strong model smoothing to be effective, to the extent that downstream task performance is heavily penalized. They then propose “robustness-based” methods, which force the model to be robust to perturbation across the irrelevant features, and show theoretically and practically that these techniques work even without heavy regularization smoothing. The authors then show, using three benchmarks, that their technique works in practice, but best results are obtained by combining robustness and regularization-based methods.

Strengths

The paper improves on methods from an existing problem setting, applies robustness techniques where they had not been tried before, and convincingly shows both with theory and experiments that such techniques work. The theorems, despite their simplified setting, intuitively demonstrate why the approach works better than the alternatives. The experimental results convincingly show that the robustness-based techniques work better than regularization-based techniques.

Weaknesses

While the contribution itself is nicely self-contained and perfectly valid when taken at face value (that in the MLX setting, training GPs or simple CNNs, robustness-based methods are better than regularization-based methods), one cannot help but wonder whether the entire setup is relevant or interesting, considering current state of the art architectures and how they attend to their input. Attention-based architectures like ViTs, due to intermediate-layer attention maps, lend themselves to very natural investigations commensurable to the kind of pixel-wise explanations used in this work. One can imagine that, as these transformer models also easily incorporate masking, the whole MLX problem could be reframed to be about either manipulating attention maps, or dynamically learning attention masks. And example is [Yang et al. (2023)](https://openaccess.thecvf.com/content/CVPR2023/html/Yang_Improving_Visual_Grounding_by_Encouraging_Consistent_Gradient-Based_Explanations_CVPR_2023_paper.html). Addressing these concerns either in the introduction or related work could help contextualize the paper’s contributions.

Questions

It would be interesting, to place the present work in perspective, to at least spend some time in related work to investigate how “explanations” are currently treated in the literature on transformer-based image models like ViTs. Is there any existing literature showing techniques for MLX (maybe not labeled as such) that are dependent on a particular architecture choice? If so, what makes the present work still interesting? Edit: Increased the score after author rebuttal addressing the points above - see comment below.

Rating

7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed ethical considerations.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

4 excellent

Presentation

3 good

Contribution

3 good

Limitations

The authors briefly mention limitations related to the possibility, in future work, to learn from incomplete explanation data. It would be interesting to add a segment related to the points raised in Weaknesses and Questions.

Reviewer Hnkb5/10 · confidence 4/52023-06-23

Summary

This paper reinterprets Machine learning from explanations (MLX) as a robustness problem, where human explanations define a lower-dimensional manifold for perturbations. The paper points out that the previous regularization-based MLX approaches require strong model smoothing in order to be globally effective at reducing shortcut learning. The authors propose a novel approach that combines robust training methods with an earlier MLX technique, achieving state-of-the-art results on both synthetic and real-world benchmarks. The theoretical and empirical analyses explaining how the combination of robustness and regularization can reduce the need for strong model smoothing are provided.

Strengths

1. The paper is well-structured and clearly organized, making it easy to follow; 2. The authors offer theoretical analyses to explain how the combination of robustness and regularization can minimize the need for strong model smoothing, which adds to the rigor and solidity of the paper.

Weaknesses

1. The contribution of the proposed method is restricted to the combination of two established robust training techniques with an existing MLX approach; 2. Although the authors thoroughly review various regularization-based MLX approaches in the introduction, the paper only showcases the effectiveness of combining robust training methods with a single MLX approach, Grad-Reg. It remains unclear whether the proposed approach can be applied to other MLX methods, and further investigation is necessary to determine its generalizability. In addition, Table 1 does not include the results of the more recent MLX approaches that are well discussed in the introduction section.

Questions

1. Is it possible to apply the proposed methods to other MLX approaches? To better understand the generalizability of the approach, it would be helpful to see the performance of robust training methods combined with various MLX methods. 2. The authors mention in lines 277-279 that they evaluate in-domain test images with background pixels replaced by a constant pixel value. Have you tested the methods' performance under other out-of-distribution (OOD) scenarios, such as replacing background pixels with the background pixels from randomly selected images? 3. A sensitivity analysis on the hyper-parameters should be provided.

Rating

5: Borderline accept: Technically solid paper where reasons to accept outweigh reasons to reject, e.g., limited evaluation. Please use sparingly.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

2 fair

Presentation

3 good

Contribution

2 fair

Limitations

See weaknesses. At this moment, the main limitations of the paper revolve around the limited novelty and generalizability of the proposed method. I tend to reject the paper primarily for this reason. However, I may reconsider my evaluation if the authors can provide solid evidence demonstrating the generalizability of their approach.

Reviewer k7a77/10 · confidence 3/52023-06-27

Summary

This paper proposes a new approach to machine learning from explanations (MLX). This new approach is still based on human-provided explanations of (ir)relevant features for each input in training, but recasts the MLX problem itself essentially into a robustness problem. The authors achieve SOTA performance when combining their method with previous ones on several benchmarks.

Strengths

The authors show that the need for strong parameter smoothing of earlier approaches can be overcome, and they achieve SOTA performance on several benchmarks. Their method is intuitive and easy to understand.

Weaknesses

Obtaining human-specified masks is at best a lot of effort and in many cases simply not available, which limits the scope of problems for which their method can be applied.

Questions

Very minor: What is the bolding criteria for Table 1? Usually, the best model is in bold, but here there are 1, 2, or 3 models bolded depending on the dataset, and it's not clear what determined the number of bolded models for each.

Rating

7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

3 good

Contribution

3 good

Limitations

It would be good to expand the "Limitations" section and provide more detail on, e.g., when the scaling breaks to large NNs, i.e. provide some guidance here about when one should expect the robustness methods to no longer be feasible to use.

Reviewer haST5/10 · confidence 1/52023-07-27

Summary

The paper is in the domain of MLX (machine learning from explanations). In this approach, human annotated data for each input example is available denoting features that are _relevant_ and which are _irrelevant_. It is desired that the model doesn't learn from irrelevant features. In this paper, the authors utilize robustness for this domain. To elaborate, they expect the model to be robust to perturbations along the features which are considered irrelevant. According to the authors, this is the first use of this technique in the domain of MLX. They also combine with existing regularization-based approaches. A theoretical framework is provided and approach evaluated on three datasets -- Decoy-MNIST, Plant, ISIC -- which are designed to capture the extent to which the models are learning from the irrelevant features. Combination of the robustness-based approaches with regularization-based approaches is shown to outperform prior approaches.

Strengths

The use of robustness for MLX is well-motivated, and as per the paper, novel. The empirical results appear to back the utility of combining robustness with existing techniques. The paper is well-written.

Weaknesses

The prior works (such as Sagawa et al., 2019; Piratla et al., 2021) have several more evaluation datasets, which the approach is not evaluated on. The generality and robustness (pardon the pun) of the approach is not completely clear.

Questions

Questions - Please address the choice of limiting the evaluation to the 3 datasets used. Minor suggestion (no response needed) - L63: State the domain of m^(n) - Consider placing figure closer to their first reference. For example, Figure 2 is referenced on Pg 2 but appears on Pg 6. - L70: "while not exploiting" -- please provide a the definition for this at this stage (addendum: if there is one at all)

Rating

5: Borderline accept: Technically solid paper where reasons to accept outweigh reasons to reject, e.g., limited evaluation. Please use sparingly.

Confidence

1: Your assessment is an educated guess. The submission is not in your area or the submission was difficult to understand. Math/other details were not carefully checked.

Soundness

2 fair

Presentation

3 good

Contribution

2 fair

Limitations

Yes

Area Chair hC6k2023-08-18

Dear Reviewer haST, thanks a lot for your valuable time and comments. Since the discussion period is soon coming to an end, I wanted to ask if your concerns regarding limited evaluation have been adequately addressed by the authors or if there are any remaining weaknesses? All the best, Your AC

Reviewer WA6d2023-08-10

Reply to the Authors

We thank the authors very much for their very detailed and on-point reply. Specifically, I found the authors to have gone above and beyond in addressing the specific point I raised on architecture-dependent MLX technique. Their new experiment compares one such technique (SPAN) with theirs, and furthermore shows that combining the two improves performance, as predicted by their previous results. I would thus like to raise my score to a 7 (I do not however seem to find a way to edit my own review at the moment). Edit: I was now able to edit the review.

Reviewer k7a72023-08-11

Thanks. Please consider adding most of this discussion to the paper.

Reviewer Hnkb2023-08-13

Thanks for the authors' response. I now well understand the two claims of the paper: (a) using perturbations (i.e. robustness-based methods) for supervising explanations is better than using regularization-based methods, (b) combining robustness with regularization-based methods is at least as good or better than using robustness-based methods alone. I still get some concerns and questions: The robustness-based methods themselves are not the contribution of this work. They are proposed in previous work, and the contribution of the paper is only to use and evaluate them in the MLX setting. Therefore, the novelty and contribution of this point appear limited in my perspective. Secondly, the empirical evidence presented does not consistently support the superiority of robustness-based methods. For instance, in Table 1, Grad-Reg outperforms all robustness-based methods on the Decoy-MNIST dataset. Similarly, the performance difference between robustness-based methods and Grad-Reg on the ISIC dataset is not substantial. Furthermore, I have reservations about the authors' implementation of CDEP. The original CDEP paper demonstrated a significant advantage of CDEP over Grad-Reg (RRR) on ISIC dataset, which is not mirrored in Table 1 of this paper. Also, according to the CDEP paper, the gap between CDEP and Grad-Reg (RRR) on the Decoy-MNIST dataset is not as large as reported in Table 1. Could the authors elucidate on these points? I will reassess my overall rating of the paper when more information is provided.

Authorsrebuttal2023-08-13

We thank the reviewer for their response. We are glad that our earlier response helped clear some of the concerns. > The robustness-based methods themselves are not the contribution of this work. They are proposed in this work and the contribution of the paper is only to use and evaluate them in the MLX setting. Therefore, the novelty and contribution of this point appear limited in my perspective. Yes, IBP and PGD are established, popular methods for robust-training. (One-of-)Our contribution lies in seeing their relevance in learning from explanations. Moreover, we highlight further key contributions including an analysis of regularization-based XML methods as well as proposing the novel combination of regularization-based and robustness-based methods which show consistently state-of-the-art performance. > Secondly, the empirical evidence ... not consistently support the superiority of robustness-based methods. For instance, in Table 1, Grad-Reg outperforms all robustness-based methods on the Decoy-MNIST dataset. Similarly, the performance difference between robustness-based methods and Grad-Reg on the ISIC dataset is not substantial. We agree that improvements of robustness over regularization methods are somewhat muddled by high standard deviation for Decoy-MNIST and ISIC datasets, but they were well pronounced on the plant dataset. Newly added results for Decoy-MNIST and Salient-Imagenet also substantiate the relative strength of robustness-methods over regularization-based. We also would like to again highlight consistent and considerble improvement offered by the novel combination of robustness-based and regularization-based methods. Thanks for raising this point, we will carefully rephrase the claim of robustness being better than regularization to "robustness-based methods are at least as good or better than regularization-based methods when learning from explanations". > Furthermore, I have reservations about the authors' implementation of CDEP. The original CDEP paper demonstrated a significant advantage of CDEP over Grad-Reg (RRR) on ISIC dataset, which is not mirrored in Table 1 of this paper. Also, according to the CDEP paper, the gap between CDEP and Grad-Reg (RRR) on the Decoy-MNIST dataset is not as large as reported in Table 1. *Regarding ISIC dataset discrepancy:* We thank the author for this careful observation. We readily understand the concern. We had spent significant time debugging the cause of poor performance of CDEP, our efforts and observations are documented in Appendix G: "Discussion on poor CDEP performance" of supplementary material. To summarise, we stated that the discrepancy in relative performance between Grad-Reg and CDEP (as reported by us and [1]) on the ISIC datasey may have been because they (a) use a different metric: F1, and (b) use a different architecture: VGG model pretrained on Imagenet. Furthermore, Table 4 of supplementary material shows per-group accuracy for different methods on ISIC dataset. We observe that CDEP performs well (only) on majority groups (examples without patches), which may have influenced their metrics reported in Rieger et.al. [1] *Regarding DecoyMNIST dataset discrepancy:* Decoy-MNIST setting presented in our paper is inspired from decoymnist of [1], but not the same. Sorry for any confusion. All the methods were found to be equally good on the original decoy-mnist dataset [1], which is why we had to alter the dataset to be more challenging. A key difference is that the volume of spurious/simple features in our version of decoy-mnist dataset is much higher, making it harder to remove dependence of a model on decoy/spurious features. Therefore, the performance gap reported in our paper on this dataset is not related to the one reported in CDEP paper [1], although both the datasets share the same name. *Further clarification on our implementation.* Our implementation of CDEP is borrowed from their official code repository [2]. We also made extensive search for optimal hyperparameters for CDEP, picked the best checkpoint and hyperparams using a validation set, reported avarege over three runs, and visualized its results (in Appendix G). The results reported for CDEP in the paper are our best efforts to reproduce. Thanks again. [1] Rieger, Laura, et al. "Interpretations are useful: penalizing explanations to align neural networks with prior knowledge." International conference on machine learning. PMLR, 2020. [2] deep-explanation-penalization, (2020), GitHub repository, https://github.com/laura-rieger/deep-explanation-penalization/tree/master

Reviewer Hnkb2023-08-14

I appreciate the authors' comprehensive response to my comments. While I maintain some reservations about the novelty of the paper, I acknowledge that most of my other concerns have been appropriately addressed. Consequently, I have revised my score upward to 5.

Authorsrebuttal2023-08-16

We are delighted to hear that the reviewer's concerns are all resolved. We thank the reviewer for their time, passion and patience. _Regarding novelty_. We wish to highlight that robustness methods have been around since 2014 [1] and regularization of gradient explanations to learn from explanation masks was first proposed in 2017 [2]. And yet, relevance and utility of robustness methods for the learning from explanations problem has not been studied so far. Our work studied this novel combination, which filled a crucial gap and established a strong baseline for future research. We thank the reviewer once again for careful consideration of our paper. References: [1] Goodfellow, Ian J., Jonathon Shlens, and Christian Szegedy. "Explaining and harnessing adversarial examples." arXiv preprint arXiv:1412.6572 (2014). [2] Ross, Andrew Slavin, Michael C. Hughes, and Finale Doshi-Velez. "Right for the right reasons: Training differentiable models by constraining their explanations." arXiv preprint arXiv:1703.03717 (2017).

Reviewer haST2023-08-18

Thanks a lot for your response, and the additional evaluation and insight. > Standard datasets with input masks highlighting irrelevant regions are somewhat hard to find If you have some thoughts on why this might be the case, please do share. Might it be the case that collecting such data is not easy / costly?

Authorsrebuttal2023-08-18

Thanks for your response. > If you have some thoughts on why this _(standard datasets are hard to find)_ might be the case, please do share. Might it be the case that collecting such data is not easy / costly? Yes, standard datasets are hard to find partly because their curation is difficult when using a conventional annotation pipeline. However, with increasing interest in learning from explanations as a method for training reliable models [3, 4, 6, 7, 8], we are witnessing growing number of relevant datasets and techniques for efficient data curation. We answered more elaborately on advances in curation of relevant datasets in our response to Reviewer k7a7. Their question and our response to their question are relevant here, which we are pasting here for easy reference. ---- Reviewer k7a7: > Obtaining human-specified masks is at best a lot of effort … Our response: We agree that manually specifying explanation masks can be impractical. However, the procedure can be automated if the nuisance/irrelevant feature occurs systematically or if it is easy to recognize, which may then be obtained automatically using a procedure similar to [1,2]. A recent effort called Salient-Imagenet used neuron activation maps to scale curation of such human-specified masks to Imagenet-scale [3, 4]. These efforts may be seen as a proof-of-concept for obtaining richer annotations beyond content labels, and towards better defined tasks. ----- We hope this answers your question. We will make sure to include these details in the main paper. We wish to also highlight that we evaluated a new dataset (Salient-Imagenet that was shared in the general response), which was inspired by your concern on standard datasets. Thanks again for your time and comment. References. [1] Liu, Evan Z., et al. "Just train twice: Improving group robustness without training group information." International Conference on Machine Learning. PMLR, 2021. [2] Rieger, Laura, et al. "Interpretations are useful: penalizing explanations to align neural networks with prior knowledge." International conference on machine learning. PMLR, 2020. [3] Singla, Sahil, and Soheil Feizi. "Salient ImageNet: How to discover spurious features in Deep Learning?." arXiv preprint arXiv:2110.04301 (2021). [4] Singla, Sahil, Mazda Moayeri, and Soheil Feizi. "Core risk minimization using salient imagenet." arXiv preprint arXiv:2203.15566 (2022). [5] Ross, Andrew Slavin, Michael C. Hughes, and Finale Doshi-Velez. "Right for the right reasons: Training differentiable models by constraining their explanations." arXiv preprint arXiv:1703.03717 (2017). [6] Pukdee, Rattana, et al. "Learning with Explanation Constraints." arXiv preprint arXiv:2303.14496 (2023). [7] Miao, Kevin, et al. "Prior Knowledge-Guided Attention in Self-Supervised Vision Transformers." arXiv preprint arXiv:2209.03745 (2022). [8] Yang, Ziyan, et al. "Improving Visual Grounding by Encouraging Consistent Gradient-based Explanations." Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 2023.

Program Chairsdecision2023-09-21

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC