| Name | quanda JSON |
| Version |
0.0.2
JSON |
| download |
| home_page | None |
| Summary | Toolkit for quantitative evaluation of data attribution methods in PyTorch. |
| upload_time | 2024-10-05 14:15:29 |
| maintainer | None |
| docs_url | None |
| author | None |
| requires_python | <3.12,>=3.8 |
| license | MIT License Copyright (c) 2024 Dilyara Bareeva, Galip Ümit Yolcu Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
| keywords |
deep learning
interpretability
machine learning
xai
|
| VCS |
 |
| bugtrack_url |
|
| requirements |
No requirements were recorded.
|
| Travis-CI |
No Travis.
|
| coveralls test coverage |
No coveralls.
|
<p align="center">
<picture>
<source media="(prefers-color-scheme: dark)" srcset="https://datacloud.hhi.fraunhofer.de/s/jxRzEkyzrmLT6t6/download/quanda_panda_day_n_night.png">
<source media="(prefers-color-scheme: light)" srcset="https://datacloud.hhi.fraunhofer.de/s/jxRzEkyzrmLT6t6/download/quanda_panda_day_n_night.png">
<img width="700" alt="quanda" src="https://datacloud.hhi.fraunhofer.de/s/jxRzEkyzrmLT6t6/download/quanda_panda_day_n_night.png">
</picture>
</p>
<p align="center">
Toolkit for <b>quan</b>titative evaluation of <b>d</b>ata <b>a</b>ttribution methods in <b>PyTorch</b>.
</p>
[](https://github.com/psf/black)
**quanda** _is currently under active development. Note the release version to ensure reproducibility of your work. Expect changes to API._
## 🐼 Library overview
**Training data attribution** (TDA) methods attribute model output on a specific test sample to the training dataset that it was trained on. They reveal the training datapoints responsible for the model's decisions. Existing methods achieve this by estimating the counterfactual effect of removing datapoints from the training set ([Koh and Liang, 2017](https://proceedings.mlr.press/v70/koh17a.html); [Park et al., 2023](https://proceedings.mlr.press/v202/park23c.html); [Bae et al., 2024](https://arxiv.org/abs/2405.12186)) tracking the contributions of training points to the loss reduction throughout training ([Pruthi et al., 2020](https://proceedings.neurips.cc/paper/2020/hash/e6385d39ec9394f2f3a354d9d2b88eec-Abstract.html)), using interpretable surrogate models ([Yeh et al., 2018](https://proceedings.neurips.cc/paper/2018/hash/8a7129b8f3edd95b7d969dfc2c8e9d9d-Abstract.html)) or finding training samples that are deemed similar to the test sample by the model ([Caruana et. al, 1999](https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2232607/); [Hanawa et. al, 2021](https://openreview.net/forum?id=9uvhpyQwzM_)). In addition to model understanding, TDA has been used in a variety of applications such as debugging model behavior ([Koh and Liang, 2017](https://proceedings.mlr.press/v70/koh17a.html); [Yeh et al., 2018](https://proceedings.neurips.cc/paper/2018/hash/8a7129b8f3edd95b7d969dfc2c8e9d9d-Abstract.html); [K and Søgaard, 2021](https://arxiv.org/abs/2111.04683); [Guo et al., 2021](https://aclanthology.org/2021.emnlp-main.808)), data summarization ([Khanna et al., 2019](https://proceedings.mlr.press/v89/khanna19a.html); [Marion et al., 2023](https://openreview.net/forum?id=XUIYn3jo5T); [Yang et al., 2023](https://openreview.net/forum?id=4wZiAXD29TQ)), dataset selection ([Engstrom et al., 2024](https://openreview.net/forum?id=GC8HkKeH8s); [Chhabra et al., 2024](https://openreview.net/forum?id=HE9eUQlAvo)), fact tracing ([Akyurek et al., 2022](https://aclanthology.org/2022.findings-emnlp.180)) and machine unlearning ([Warnecke
et al., 2023](https://arxiv.org/abs/2108.11577)).
Although there are various demonstrations of TDA’s potential for interpretability and practical applications, the critical question of how TDA methods should be effectively evaluated remains open. Several approaches have been proposed by the community, which can be categorized into three groups:
<details>
<summary><b><big>Ground Truth</big></b></summary>As some of the methods are designed to approximate LOO effects, ground truth can often be computed for TDA evaluation. However, this counterfactual ground truth approach requires retraining the model multiple times on different subsets of the training data, which quickly becomes computationally expensive. Additionally, this ground truth is shown to be dominated by noise in practical deep learning settings, due to the inherent stochasticity of a typical training process
(<a href="https://openreview.net/forum?id=xHKVVHGDOEk" target="_blank">Basu et al., 2021</a>;
<a href="https://proceedings.neurips.cc/paper_files/paper/2023/hash/ca774047bc3b46cc81e53ead34cd5d5a-Abstract-Conference.html" target="_blank">Nguyen et al., 2023</a>).
</details>
<details>
<summary><b><big>Downstream Task Evaluators</big></b></summary>To remedy the challenges associated with ground truth evaluation, the literature proposes to assess the utility of a TDA method within the context of an end-task, such as model debugging or data selection (<a href="https://proceedings.mlr.press/v70/koh17a.html" target="_blank">Koh and Liang, 2017</a>;
<a href="https://proceedings.mlr.press/v89/khanna19a.html" target="_blank">Khanna et al., 2019</a>;
<a href="https://arxiv.org/abs/2111.04683" target="_blank">Karthikeyan et al., 2021</a>).
</details>
<details>
<summary><b><big>Heuristics</big></b></summary>Finally, the community also used heuristics (desirable properties or sanity checks) to evaluate the quality of TDA techniques. These include comparing the attributions of a trained model and a randomized model (<a href="https://openreview.net/forum?id=9uvhpyQwzM_" target="_blank">Hanawa et al., 2021</a>) and measuring the amount of overlap between the attributions for different test samples
(<a href="http://proceedings.mlr.press/v108/barshan20a/barshan20a.pdf" target="_blank">Barshan et al., 2020</a>).
</details>
<br>
<b>quanda</b> is designed to meet the need of a comprehensive and systematic evaluation framework, allowing practitioners and researchers to obtain a detailed view of the performance of TDA methods in various contexts.
### Library Features
- **Unified TDA Interface**: **quanda** provides a unified interface for various TDA methods, allowing users to easily switch between different methods.
- **Metrics**: **quanda** provides a set of metrics to evaluate the effectiveness of TDA methods. These metrics are based on the latest research in the field.
- **Benchmarking**: **quanda** provides a benchmarking tool to evaluate the performance of TDA methods on a given model, dataset and problem. As many TDA evaluation methods require access to ground truth, our benchmarking tools allow to generate a controlled setting with ground truth, and then compare the performance of different TDA methods on this setting.
### Supported TDA Methods
| Method Name | Repository | Reference |
|----------------------------|------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------|
| Similarity Influence | [Captum](https://github.com/pytorch/captum/tree/master) | [Caruana et al., 1999](https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2232607/) |
| Arnoldi Influence Function | [Captum](https://github.com/pytorch/captum/tree/master) | [Schioppa et al., 2022](https://arxiv.org/abs/2112.03052); [Koh and Liang, 2017](https://proceedings.mlr.press/v70/koh17a.html) |
| TracIn | [Captum](https://github.com/pytorch/captum/tree/master) | [Pruthi et al., 2020](https://proceedings.neurips.cc/paper/2020/hash/e6385d39ec9394f2f3a354d9d2b88eec-Abstract.html) |
| TRAK | [TRAK](https://github.com/MadryLab/trak) | [Park et al., 2023](https://proceedings.mlr.press/v202/park23c.html) |
| Representer Point Selection | [Representer Point Selection](https://github.com/chihkuanyeh/Representer_Point_Selection) | [Yeh et al., 2018](https://proceedings.neurips.cc/paper/2018/hash/8a7129b8f3edd95b7d969dfc2c8e9d9d-Abstract.html) |
### Metrics
- **Linear Datamodeling Score** ([Park et al., 2023](https://proceedings.mlr.press/v202/park23c.html)): Measures the correlation between the (grouped) attribution scores and the actual output of models trained on different subsets of the training set. For each subset, the linear datamodeling score compares the actual model output to the sum of attribution scores from the subset using Spearman rank correlation.
- **Identical Class / Identical Subclass** ([Hanawa et al., 2021](https://openreview.net/forum?id=9uvhpyQwzM_)): Measures the proportion of identical classes or subclasses in the top-1 training samples over the test dataset. If the attributions are based on similarity, they are expected to be predictive of the class of the test datapoint, as well as different subclasses under a single label.
- **Model Randomization** ([Hanawa et al., 2021](https://openreview.net/forum?id=9uvhpyQwzM_)): Measures the correlation between the original TDA and the TDA of a model with randomized weights. Since the attributions are expected to depend on model parameters, the correlation between original and randomized attributions should be low.
- **Top-K Cardinality** ([Barshan et al., 2020](http://proceedings.mlr.press/v108/barshan20a/barshan20a.pdf)): Measures the cardinality of the union of the top-K training samples. Since the attributions are expected to be dependent on the test input, they are expected to vary heavily for different test points, resulting in a low overlap (high metric value).
- **Mislabeled Data Detection** ([Koh and Liang, 2017](https://proceedings.mlr.press/v70/koh17a.html)): Computes the proportion of noisy training labels detected as a function of the percentage of inspected training samples. The samples are inspected in order according to their global TDA ranking, which is computed using local attributions. This produces a cumulative mislabeling detection curve. We expect to see a curve that rapidly increases as we check more of the training data, thus we compute the area under this curve
- **Shortcut Detection** ([Koh and Liang, 2017](https://proceedings.mlr.press/v70/koh17a.html)): Assuming a known [shortcut](https://www.nature.com/articles/s42256-020-00257-z), or [Clever-Hans](https://www.nature.com/articles/s41467-019-08987-4) effect has been identified in the model, this metric evaluates how effectively a TDA method can identify shortcut samples as the most influential in predicting cases with the shortcut artifact. This process is referred to as _Domain Mismatch Debugging_ in the original paper.
- **Mixed Datasets** ([Hammoudeh and Lowd, 2022](https://dl.acm.org/doi/abs/10.1145/3548606.3559335)): In a setting where a model has been trained on two datasets: a clean dataset (e.g. CIFAR-10) and an adversarial (e.g. zeros from MNIST), this metric evaluates how well the model ranks the importance (attribution) of adversarial samples compared to clean samples when making predictions on an adversarial example.
### Benchmarks
**quanda** comes with a few pre-computed benchmarks that can be conveniently used for evaluation in a plug-and-play manner. We are planning to significantly expand the number of benchmarks in the future. The following benchmarks are currently available:
<table>
<thead>
<tr>
<th>Benchmark</th>
<th>Modality</th>
<th>Model</th>
<th>Metric</th>
<th>Type</th>
</tr>
</thead>
<tbody>
<tr>
<td>mnist_top_k_cardinality</td>
<td rowspan="7">Vision</td> <!-- Merged vertically for "Modality" -->
<td rowspan="7">MNIST</td> <!-- Merged vertically for "Model" -->
<td><a href="quanda/metrics/heuristics/top_k_cardinality.py">TopKCardinalityMetric</a></td>
<td>Heuristic</td>
</tr>
<tr>
<td>mnist_mixed_datasets</td>
<td><a href="quanda/metrics/heuristics/mixed_datasets.py">MixedDatasetsMetric</a></td>
<td>Heuristic</td>
</tr>
<tr>
<td>mnist_class_detection</td>
<td><a href="quanda/metrics/downstream_eval/class_detection.py">ClassDetectionMetric</a></td>
<td>Downstream-Task-Evaluator</td>
</tr>
<tr>
<td>mnist_subclass_detection</td>
<td><a href="quanda/metrics/downstream_eval/subclass_detection.py">SubclassDetectionMetric</a></td>
<td>Downstream-Task-Evaluator</td>
</tr>
<tr>
<td>mnist_mislabeling_detection</td>
<td><a href="quanda/metrics/downstream_eval/mislabeling_detection.py">MislabelingDetectionMetric</a></td>
<td>Downstream-Task-Evaluator</td>
</tr>
<tr>
<td>mnist_shortcut_detection</td>
<td><a href="quanda/metrics/downstream_eval/shortcut_detection.py">ShortcutDetectionMetric</a></td>
<td>Downstream-Task-Evaluator</td>
</tr>
<tr>
<td>mnist_linear_datamodeling_score</td>
<td><a href="quanda/metrics/ground_truth/linear_datamodeling.py">LinearDatamodelingMetric</a></td>
<td>Ground Truth</td>
</tr>
</tbody>
</table>
## 🔬 Getting Started
### Installation
To install the latest release of **quanda** use:
```setup
pip install git+https://github.com/dilyabareeva/quanda.git
```
**quanda** requires Python 3.7 or later. It is recommended to use a virtual environment to install the package.
### Usage
In the following, we provide a quick guide to **quanda** usage. To begin using **quanda**, ensure you have the following:
- **Trained PyTorch Model (`model`)**: A PyTorch model that has already been trained on a relevant dataset. As a placeholder, we used the layer name "avgpool" below. Please replace it with the name of one of the layers in your model.
- **PyTorch Dataset (`train_set`)**: The dataset used during the training of the model.
- **Test Batches (`test_tensor`) and Explanation Targets (`target`)**: A batch of test data (`test_tensor`) and the corresponding explanation targets (`target`). Generally, it is advisable to use the model's predicted labels as the targets. In the following, we assume the existence of a `torch.utils.data.DataLoader` to load the test data in batches, with variable name `test_loader`.
In the following usage examples, we will be using the `SimilarityInfluence` data attribution from `Captum`.
#### Metrics Usage
Next, we demonstrate how to evaluate explanations using the **Model Randomization** metric.
<details>
<summary><b><big>Step 1. Import dependencies and library components</big></b></summary>
```python
import torch
from torch.utils.data import DataLoader
from tqdm import tqdm
from quanda.explainers.wrappers import captum_similarity_explain, CaptumSimilarity
from quanda.metrics.heuristics import ModelRandomizationMetric
```
</details>
<details>
<summary><b><big>Step 2. Create the explainer object</big></b></summary>
We now create our explainer. The device to be used by the explainer and metrics is inherited from the model, thus we set the model device explicitly.
```python
model.to(DEVICE)
explainer_kwargs = {
"layers": "avgpool",
"model_id": "default_model_id",
"cache_dir": "./cache"
}
explainer = CaptumSimilarity(
model=model,
train_dataset=train_set,
**explainer_kwargs
)
```
</details>
<details>
<summary><b><big>Step 3. Initialize the metric</big></b></summary>
The `ModelRandomizationMetric` needs to instantiate a new explainer to generate explanations for a randomized model. These will be compared with the explanations of the original model. Therefore, `explainer_cls` is passed directly to the metric along with initialization parameters of the explainer.
```python
explainer_kwargs = {
"layers": "avgpool",
"model_id": "randomized_model_id",
"cache_dir": "./cache"
}
model_rand = ModelRandomizationMetric(
model=model,
train_dataset=train_set,
explainer_cls=CaptumSimilarity,
expl_kwargs=explainer_kwargs,
correlation_fn="spearman",
seed=42,
)
```
</details>
<details>
<summary><b><big>Step 4. Iterate over test set and feed tensor batches first to explain, then to metric</big></b></summary>
```python
for i, (test_tensor, target) in enumerate(tqdm(test_loader)):
test_tensor, target = test_tensor.to(DEVICE), target.to(DEVICE)
tda = explainer.explain(
test_tensor=test_tensor,
targets=target
)
model_rand.update(test_data=test_tensor, explanations=tda, explanation_targets=target)
print("Model heuristics metric output:", model_rand.compute())
```
</details>
#### Benchmarks Usage
The pre-assembled benchmarks allow us to streamline the evaluation process by downloading the necessary data and models, and running the evaluation in a single command. **Step 1** and **Step 2** from the previous section are still required to be executed before running the benchmark. The following code demonstrates how to use the `mnist_subclass_detection` benchmark:
<details>
<summary><b><big>Step 3. Load a pre-assembled benchmark and score an explainer</big></b></summary>
```python
subclass_detect = SubclassDetection.download(
name=`mnist_subclass_detection`,
cache_dir=cache_dir,
device="cpu",
)
score = dst_eval.evaluate(
explainer_cls=CaptumSimilarity,
expl_kwargs=explain_fn_kwargs,
batch_size=batch_size,
)["score"]
print(f"Subclass Detection Score: {score}")
```
</details>
More detailed examples can be found in the [tutorials](tutorials) folder.
### Custom Explainers
In addition to the built-in explainers, **quanda** supports the evaluatioon of custom explainer methods. This section provides a guide on how to create a wrapper for a custom explainer that matches our interface.
<details>
<summary><b><big>Step 1. Create an explainer class</big></b></summary>
Your custom explainer should inherit from the base [Explainer](quanda/explainers/base.py) class provided by **quanda**. The first step is to initialize your custom explainer within the `__init__` method.
```python
from quanda.explainers.base import Explainer
class CustomExplainer(Explainer):
def __init__(self, model, train_dataset, **kwargs):
super().__init__(model, train_dataset, **kwargs)
# Initialize your explainer here
```
</details>
<details>
<summary><b><big>Step 2. Implement the explain method</big></b></summary>
The core of your wrapper is the `explain` method. This function should take test samples and their corresponding target values as input and return a 2D tensor containing the influence scores.
- `test`: The test batch for which explanations are generated.
- `targets`: The target values for the explanations.
Ensure that the output tensor has the shape `(test_samples, train_samples)`, where the entries in the train samples dimension are ordered in the same order as in the `train_dataset` that is being attributed.
```python
def explain(
self,
test_tensor: torch.Tensor,
targets: Union[List[int], torch.Tensor]
) -> torch.Tensor:
# Compute your influence scores here
return influence_scores
```
</details>
<details>
<summary><b><big>Step 3. Implement the self_influence method (Optional) </big></b></summary>
By default, **quanda** includes a built-in method for calculating self-influence scores. This base implementation computes all attributions over the training dataset, and collects the diagonal values in the attribution matrix. However, you can override this method to provide a more efficient implementation. This method should calculate how much each training sample influences itself and return a tensor of the computed self-influence scores.
```python
def self_influence(self, batch_size: int = 1) -> torch.Tensor:
# Compute your self-influence scores here
return self_influence_scores
```
</details>
For detailed examples, we refer to the [existing](quanda/explainers/wrappers/captum_influence.py) [explainer](quanda/explainers/wrappers/representer_points.py) [wrappers](quanda/explainers/wrappers/trak_wrapper.py) in **quanda**.
## ⚠️ Usage Tips and Caveats
- **Controlled Setting Evaluation**: Many metrics require access to ground truth labels for datasets, such as the indices of the "shorcut samples" in the Shortcut Detection metric, or the mislabeling (noisy) label indices for the Mislabeling Detection Metric. However, users often may not have access to these labels. To address this, we recommend either using one of our pre-built benchmark suites (see [Benchmarks](#benchmarks) section) or generating (`generate` method) a custom benchmark for comparing explainers. Benchmarks provide a controlled environment for systematic evaluation.
- **Caching**: Many explainers in our library generate re-usable cache. The `cache_id` and `model_id` parameters passed to various class instances are used to store these intermediary results. Ensure each experiment is assigned a unique combination of these arguments. Failing to do so could lead to incorrect reuse of cached results. If you wish to avoid re-using cached results, you can set the `load_from_disk` parameter to `False`.
- **Explainers Are Expensive To Calculate**: Certain explainers, such as TracInCPRandomProj, may lead to OutOfMemory (OOM) issues when applied to large models or datasets. In such cases, we recommend adjusting memory usage by either reducing the dataset size or using smaller models to avoid these issues.
## 📓 Tutorials
We have included a few [tutorials](tutorials) to demonstrate the usage of **quanda**:
* [Explainers](tutorials/demo_explainers.ipynb): shows how different explainers can be used with **quanda**
* [Metrics](tutorials/demo_metrics.ipynb): shows how to use the metrics in **quanda** to evaluate the performance of a model
* [Benchmarks](tutorials/demo_benchmarks.ipynb): shows how to use the benchmarking tools in **quanda** to evaluate a data attribution method
To install the library with tutorial dependencies, run:
```bash
pip install -e '.[tutorials]'
```
## 👩💻Contributing
We welcome contributions to **quanda**! You could contribute by:
- Opening an issue to report a bug or request a feature.
- Submitting a pull request to fix a bug, add a new explainer wrapper, a new metric, or another feature.
A detailed guide on how to contribute to **quanda** can be found [here](CONTRIBUTING.md).
Raw data
{
"_id": null,
"home_page": null,
"name": "quanda",
"maintainer": null,
"docs_url": null,
"requires_python": "<3.12,>=3.8",
"maintainer_email": null,
"keywords": "deep learning, interpretability, machine learning, xai",
"author": null,
"author_email": "Dilyara Bareeva <dilyabareeva@gmail.com>, Galip \u00dcmit Yolcu <galip.uemit.yolcu@hhi.fraunhofer.de>",
"download_url": "https://files.pythonhosted.org/packages/8f/4c/5744954c43fad82bb48d7b917df08d0cf9f992e4b51e9f26a12822a16cbf/quanda-0.0.2.tar.gz",
"platform": null,
"description": "<p align=\"center\">\n<picture>\n <source media=\"(prefers-color-scheme: dark)\" srcset=\"https://datacloud.hhi.fraunhofer.de/s/jxRzEkyzrmLT6t6/download/quanda_panda_day_n_night.png\">\n <source media=\"(prefers-color-scheme: light)\" srcset=\"https://datacloud.hhi.fraunhofer.de/s/jxRzEkyzrmLT6t6/download/quanda_panda_day_n_night.png\">\n <img width=\"700\" alt=\"quanda\" src=\"https://datacloud.hhi.fraunhofer.de/s/jxRzEkyzrmLT6t6/download/quanda_panda_day_n_night.png\">\n</picture>\n</p>\n\n<p align=\"center\">\n Toolkit for <b>quan</b>titative evaluation of <b>d</b>ata <b>a</b>ttribution methods in <b>PyTorch</b>.\n</p>\n\n\n\n[](https://github.com/psf/black)\n\n\n\n**quanda** _is currently under active development. Note the release version to ensure reproducibility of your work. Expect changes to API._\n\n\n## \ud83d\udc3c Library overview\n**Training data attribution** (TDA) methods attribute model output on a specific test sample to the training dataset that it was trained on. They reveal the training datapoints responsible for the model's decisions. Existing methods achieve this by estimating the counterfactual effect of removing datapoints from the training set ([Koh and Liang, 2017](https://proceedings.mlr.press/v70/koh17a.html); [Park et al., 2023](https://proceedings.mlr.press/v202/park23c.html); [Bae et al., 2024](https://arxiv.org/abs/2405.12186)) tracking the contributions of training points to the loss reduction throughout training ([Pruthi et al., 2020](https://proceedings.neurips.cc/paper/2020/hash/e6385d39ec9394f2f3a354d9d2b88eec-Abstract.html)), using interpretable surrogate models ([Yeh et al., 2018](https://proceedings.neurips.cc/paper/2018/hash/8a7129b8f3edd95b7d969dfc2c8e9d9d-Abstract.html)) or finding training samples that are deemed similar to the test sample by the model ([Caruana et. al, 1999](https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2232607/); [Hanawa et. al, 2021](https://openreview.net/forum?id=9uvhpyQwzM_)). In addition to model understanding, TDA has been used in a variety of applications such as debugging model behavior ([Koh and Liang, 2017](https://proceedings.mlr.press/v70/koh17a.html); [Yeh et al., 2018](https://proceedings.neurips.cc/paper/2018/hash/8a7129b8f3edd95b7d969dfc2c8e9d9d-Abstract.html); [K and S\u00f8gaard, 2021](https://arxiv.org/abs/2111.04683); [Guo et al., 2021](https://aclanthology.org/2021.emnlp-main.808)), data summarization ([Khanna et al., 2019](https://proceedings.mlr.press/v89/khanna19a.html); [Marion et al., 2023](https://openreview.net/forum?id=XUIYn3jo5T); [Yang et al., 2023](https://openreview.net/forum?id=4wZiAXD29TQ)), dataset selection ([Engstrom et al., 2024](https://openreview.net/forum?id=GC8HkKeH8s); [Chhabra et al., 2024](https://openreview.net/forum?id=HE9eUQlAvo)), fact tracing ([Akyurek et al., 2022](https://aclanthology.org/2022.findings-emnlp.180)) and machine unlearning ([Warnecke\net al., 2023](https://arxiv.org/abs/2108.11577)).\n\nAlthough there are various demonstrations of TDA\u2019s potential for interpretability and practical applications, the critical question of how TDA methods should be effectively evaluated remains open. Several approaches have been proposed by the community, which can be categorized into three groups:\n\n<details>\n <summary><b><big>Ground Truth</big></b></summary>As some of the methods are designed to approximate LOO effects, ground truth can often be computed for TDA evaluation. However, this counterfactual ground truth approach requires retraining the model multiple times on different subsets of the training data, which quickly becomes computationally expensive. Additionally, this ground truth is shown to be dominated by noise in practical deep learning settings, due to the inherent stochasticity of a typical training process \n (<a href=\"https://openreview.net/forum?id=xHKVVHGDOEk\" target=\"_blank\">Basu et al., 2021</a>; \n <a href=\"https://proceedings.neurips.cc/paper_files/paper/2023/hash/ca774047bc3b46cc81e53ead34cd5d5a-Abstract-Conference.html\" target=\"_blank\">Nguyen et al., 2023</a>).\n</details>\n\n<details>\n<summary><b><big>Downstream Task Evaluators</big></b></summary>To remedy the challenges associated with ground truth evaluation, the literature proposes to assess the utility of a TDA method within the context of an end-task, such as model debugging or data selection (<a href=\"https://proceedings.mlr.press/v70/koh17a.html\" target=\"_blank\">Koh and Liang, 2017</a>; \n <a href=\"https://proceedings.mlr.press/v89/khanna19a.html\" target=\"_blank\">Khanna et al., 2019</a>; \n <a href=\"https://arxiv.org/abs/2111.04683\" target=\"_blank\">Karthikeyan et al., 2021</a>).\n</details>\n\n<details>\n <summary><b><big>Heuristics</big></b></summary>Finally, the community also used heuristics (desirable properties or sanity checks) to evaluate the quality of TDA techniques. These include comparing the attributions of a trained model and a randomized model (<a href=\"https://openreview.net/forum?id=9uvhpyQwzM_\" target=\"_blank\">Hanawa et al., 2021</a>) and measuring the amount of overlap between the attributions for different test samples \n (<a href=\"http://proceedings.mlr.press/v108/barshan20a/barshan20a.pdf\" target=\"_blank\">Barshan et al., 2020</a>).\n</details>\n<br>\n<b>quanda</b> is designed to meet the need of a comprehensive and systematic evaluation framework, allowing practitioners and researchers to obtain a detailed view of the performance of TDA methods in various contexts.\n\n### Library Features\n\n- **Unified TDA Interface**: **quanda** provides a unified interface for various TDA methods, allowing users to easily switch between different methods.\n- **Metrics**: **quanda** provides a set of metrics to evaluate the effectiveness of TDA methods. These metrics are based on the latest research in the field.\n- **Benchmarking**: **quanda** provides a benchmarking tool to evaluate the performance of TDA methods on a given model, dataset and problem. As many TDA evaluation methods require access to ground truth, our benchmarking tools allow to generate a controlled setting with ground truth, and then compare the performance of different TDA methods on this setting.\n\n### Supported TDA Methods\n\n| Method Name | Repository | Reference |\n|----------------------------|------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------|\n| Similarity Influence | [Captum](https://github.com/pytorch/captum/tree/master) | [Caruana et al., 1999](https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2232607/) |\n| Arnoldi Influence Function | [Captum](https://github.com/pytorch/captum/tree/master) | [Schioppa et al., 2022](https://arxiv.org/abs/2112.03052); [Koh and Liang, 2017](https://proceedings.mlr.press/v70/koh17a.html) |\n| TracIn | [Captum](https://github.com/pytorch/captum/tree/master) | [Pruthi et al., 2020](https://proceedings.neurips.cc/paper/2020/hash/e6385d39ec9394f2f3a354d9d2b88eec-Abstract.html) |\n| TRAK | [TRAK](https://github.com/MadryLab/trak) | [Park et al., 2023](https://proceedings.mlr.press/v202/park23c.html) |\n| Representer Point Selection | [Representer Point Selection](https://github.com/chihkuanyeh/Representer_Point_Selection) | [Yeh et al., 2018](https://proceedings.neurips.cc/paper/2018/hash/8a7129b8f3edd95b7d969dfc2c8e9d9d-Abstract.html) |\n\n\n### Metrics\n\n- **Linear Datamodeling Score** ([Park et al., 2023](https://proceedings.mlr.press/v202/park23c.html)): Measures the correlation between the (grouped) attribution scores and the actual output of models trained on different subsets of the training set. For each subset, the linear datamodeling score compares the actual model output to the sum of attribution scores from the subset using Spearman rank correlation.\n\n- **Identical Class / Identical Subclass** ([Hanawa et al., 2021](https://openreview.net/forum?id=9uvhpyQwzM_)): Measures the proportion of identical classes or subclasses in the top-1 training samples over the test dataset. If the attributions are based on similarity, they are expected to be predictive of the class of the test datapoint, as well as different subclasses under a single label.\n\n- **Model Randomization** ([Hanawa et al., 2021](https://openreview.net/forum?id=9uvhpyQwzM_)): Measures the correlation between the original TDA and the TDA of a model with randomized weights. Since the attributions are expected to depend on model parameters, the correlation between original and randomized attributions should be low.\n\n- **Top-K Cardinality** ([Barshan et al., 2020](http://proceedings.mlr.press/v108/barshan20a/barshan20a.pdf)): Measures the cardinality of the union of the top-K training samples. Since the attributions are expected to be dependent on the test input, they are expected to vary heavily for different test points, resulting in a low overlap (high metric value).\n\n- **Mislabeled Data Detection** ([Koh and Liang, 2017](https://proceedings.mlr.press/v70/koh17a.html)): Computes the proportion of noisy training labels detected as a function of the percentage of inspected training samples. The samples are inspected in order according to their global TDA ranking, which is computed using local attributions. This produces a cumulative mislabeling detection curve. We expect to see a curve that rapidly increases as we check more of the training data, thus we compute the area under this curve\n\n- **Shortcut Detection** ([Koh and Liang, 2017](https://proceedings.mlr.press/v70/koh17a.html)): Assuming a known [shortcut](https://www.nature.com/articles/s42256-020-00257-z), or [Clever-Hans](https://www.nature.com/articles/s41467-019-08987-4) effect has been identified in the model, this metric evaluates how effectively a TDA method can identify shortcut samples as the most influential in predicting cases with the shortcut artifact. This process is referred to as _Domain Mismatch Debugging_ in the original paper.\n\n- **Mixed Datasets** ([Hammoudeh and Lowd, 2022](https://dl.acm.org/doi/abs/10.1145/3548606.3559335)): In a setting where a model has been trained on two datasets: a clean dataset (e.g. CIFAR-10) and an adversarial (e.g. zeros from MNIST), this metric evaluates how well the model ranks the importance (attribution) of adversarial samples compared to clean samples when making predictions on an adversarial example.\n\n### Benchmarks\n\n**quanda** comes with a few pre-computed benchmarks that can be conveniently used for evaluation in a plug-and-play manner. We are planning to significantly expand the number of benchmarks in the future. The following benchmarks are currently available:\n<table>\n <thead>\n <tr>\n <th>Benchmark</th>\n <th>Modality</th>\n <th>Model</th>\n <th>Metric</th>\n <th>Type</th>\n </tr>\n </thead>\n <tbody>\n <tr>\n <td>mnist_top_k_cardinality</td>\n <td rowspan=\"7\">Vision</td> <!-- Merged vertically for \"Modality\" -->\n <td rowspan=\"7\">MNIST</td> <!-- Merged vertically for \"Model\" -->\n <td><a href=\"quanda/metrics/heuristics/top_k_cardinality.py\">TopKCardinalityMetric</a></td>\n <td>Heuristic</td>\n </tr>\n <tr>\n <td>mnist_mixed_datasets</td>\n <td><a href=\"quanda/metrics/heuristics/mixed_datasets.py\">MixedDatasetsMetric</a></td>\n <td>Heuristic</td>\n </tr>\n <tr>\n <td>mnist_class_detection</td>\n <td><a href=\"quanda/metrics/downstream_eval/class_detection.py\">ClassDetectionMetric</a></td>\n <td>Downstream-Task-Evaluator</td>\n </tr>\n <tr>\n <td>mnist_subclass_detection</td>\n <td><a href=\"quanda/metrics/downstream_eval/subclass_detection.py\">SubclassDetectionMetric</a></td>\n <td>Downstream-Task-Evaluator</td>\n </tr>\n <tr>\n <td>mnist_mislabeling_detection</td>\n <td><a href=\"quanda/metrics/downstream_eval/mislabeling_detection.py\">MislabelingDetectionMetric</a></td>\n <td>Downstream-Task-Evaluator</td>\n </tr>\n <tr>\n <td>mnist_shortcut_detection</td>\n <td><a href=\"quanda/metrics/downstream_eval/shortcut_detection.py\">ShortcutDetectionMetric</a></td>\n <td>Downstream-Task-Evaluator</td>\n </tr>\n <tr>\n <td>mnist_linear_datamodeling_score</td>\n <td><a href=\"quanda/metrics/ground_truth/linear_datamodeling.py\">LinearDatamodelingMetric</a></td>\n <td>Ground Truth</td>\n </tr>\n </tbody>\n</table>\n\n\n\n## \ud83d\udd2c Getting Started\n\n### Installation\n\nTo install the latest release of **quanda** use:\n\n```setup\npip install git+https://github.com/dilyabareeva/quanda.git\n```\n\n**quanda** requires Python 3.7 or later. It is recommended to use a virtual environment to install the package.\n\n### Usage\n\n\nIn the following, we provide a quick guide to **quanda** usage. To begin using **quanda**, ensure you have the following:\n\n- **Trained PyTorch Model (`model`)**: A PyTorch model that has already been trained on a relevant dataset. As a placeholder, we used the layer name \"avgpool\" below. Please replace it with the name of one of the layers in your model.\n- **PyTorch Dataset (`train_set`)**: The dataset used during the training of the model.\n- **Test Batches (`test_tensor`) and Explanation Targets (`target`)**: A batch of test data (`test_tensor`) and the corresponding explanation targets (`target`). Generally, it is advisable to use the model's predicted labels as the targets. In the following, we assume the existence of a `torch.utils.data.DataLoader` to load the test data in batches, with variable name `test_loader`.\n\n\nIn the following usage examples, we will be using the `SimilarityInfluence` data attribution from `Captum`.\n#### Metrics Usage\n\nNext, we demonstrate how to evaluate explanations using the **Model Randomization** metric.\n\n<details>\n<summary><b><big>Step 1. Import dependencies and library components</big></b></summary>\n\n```python\nimport torch\nfrom torch.utils.data import DataLoader\nfrom tqdm import tqdm\n\nfrom quanda.explainers.wrappers import captum_similarity_explain, CaptumSimilarity\nfrom quanda.metrics.heuristics import ModelRandomizationMetric\n```\n</details>\n\n<details>\n\n<summary><b><big>Step 2. Create the explainer object</big></b></summary>\n\nWe now create our explainer. The device to be used by the explainer and metrics is inherited from the model, thus we set the model device explicitly.\n\n```python\nmodel.to(DEVICE)\n\nexplainer_kwargs = {\n \"layers\": \"avgpool\",\n \"model_id\": \"default_model_id\",\n \"cache_dir\": \"./cache\"\n}\nexplainer = CaptumSimilarity(\n model=model,\n train_dataset=train_set,\n **explainer_kwargs\n)\n```\n</details>\n\n<details>\n\n<summary><b><big>Step 3. Initialize the metric</big></b></summary>\n\nThe `ModelRandomizationMetric` needs to instantiate a new explainer to generate explanations for a randomized model. These will be compared with the explanations of the original model. Therefore, `explainer_cls` is passed directly to the metric along with initialization parameters of the explainer.\n\n```python\nexplainer_kwargs = {\n \"layers\": \"avgpool\",\n \"model_id\": \"randomized_model_id\",\n \"cache_dir\": \"./cache\"\n}\nmodel_rand = ModelRandomizationMetric(\n model=model,\n train_dataset=train_set,\n explainer_cls=CaptumSimilarity,\n expl_kwargs=explainer_kwargs,\n correlation_fn=\"spearman\",\n seed=42,\n)\n```\n</details>\n\n<details>\n<summary><b><big>Step 4. Iterate over test set and feed tensor batches first to explain, then to metric</big></b></summary>\n\n```python\nfor i, (test_tensor, target) in enumerate(tqdm(test_loader)):\n test_tensor, target = test_tensor.to(DEVICE), target.to(DEVICE)\n tda = explainer.explain(\n test_tensor=test_tensor,\n targets=target\n )\n model_rand.update(test_data=test_tensor, explanations=tda, explanation_targets=target)\n\nprint(\"Model heuristics metric output:\", model_rand.compute())\n```\n</details>\n\n#### Benchmarks Usage\n\nThe pre-assembled benchmarks allow us to streamline the evaluation process by downloading the necessary data and models, and running the evaluation in a single command. **Step 1** and **Step 2** from the previous section are still required to be executed before running the benchmark. The following code demonstrates how to use the `mnist_subclass_detection` benchmark:\n\n<details>\n<summary><b><big>Step 3. Load a pre-assembled benchmark and score an explainer</big></b></summary>\n\n```python\nsubclass_detect = SubclassDetection.download(\n name=`mnist_subclass_detection`,\n cache_dir=cache_dir,\n device=\"cpu\",\n)\nscore = dst_eval.evaluate(\n explainer_cls=CaptumSimilarity,\n expl_kwargs=explain_fn_kwargs,\n batch_size=batch_size,\n)[\"score\"]\nprint(f\"Subclass Detection Score: {score}\")\n```\n</details>\n\n\nMore detailed examples can be found in the [tutorials](tutorials) folder.\n\n### Custom Explainers\n\nIn addition to the built-in explainers, **quanda** supports the evaluatioon of custom explainer methods. This section provides a guide on how to create a wrapper for a custom explainer that matches our interface.\n\n<details>\n<summary><b><big>Step 1. Create an explainer class</big></b></summary>\n\nYour custom explainer should inherit from the base [Explainer](quanda/explainers/base.py) class provided by **quanda**. The first step is to initialize your custom explainer within the `__init__` method.\n```python\nfrom quanda.explainers.base import Explainer\n\nclass CustomExplainer(Explainer):\n def __init__(self, model, train_dataset, **kwargs):\n super().__init__(model, train_dataset, **kwargs)\n # Initialize your explainer here\n```\n</details>\n\n<details>\n<summary><b><big>Step 2. Implement the explain method</big></b></summary>\n\nThe core of your wrapper is the `explain` method. This function should take test samples and their corresponding target values as input and return a 2D tensor containing the influence scores.\n\n- `test`: The test batch for which explanations are generated.\n- `targets`: The target values for the explanations.\n\nEnsure that the output tensor has the shape `(test_samples, train_samples)`, where the entries in the train samples dimension are ordered in the same order as in the `train_dataset` that is being attributed.\n\n```python\ndef explain(\n self,\n test_tensor: torch.Tensor,\n targets: Union[List[int], torch.Tensor]\n) -> torch.Tensor:\n # Compute your influence scores here\n return influence_scores\n ```\n</details>\n\n<details>\n<summary><b><big>Step 3. Implement the self_influence method (Optional) </big></b></summary>\n\nBy default, **quanda** includes a built-in method for calculating self-influence scores. This base implementation computes all attributions over the training dataset, and collects the diagonal values in the attribution matrix. However, you can override this method to provide a more efficient implementation. This method should calculate how much each training sample influences itself and return a tensor of the computed self-influence scores.\n\n```python\ndef self_influence(self, batch_size: int = 1) -> torch.Tensor:\n # Compute your self-influence scores here\n return self_influence_scores\n```\n</details>\n\nFor detailed examples, we refer to the [existing](quanda/explainers/wrappers/captum_influence.py) [explainer](quanda/explainers/wrappers/representer_points.py) [wrappers](quanda/explainers/wrappers/trak_wrapper.py) in **quanda**.\n\n\n## \u26a0\ufe0f Usage Tips and Caveats\n\n- **Controlled Setting Evaluation**: Many metrics require access to ground truth labels for datasets, such as the indices of the \"shorcut samples\" in the Shortcut Detection metric, or the mislabeling (noisy) label indices for the Mislabeling Detection Metric. However, users often may not have access to these labels. To address this, we recommend either using one of our pre-built benchmark suites (see [Benchmarks](#benchmarks) section) or generating (`generate` method) a custom benchmark for comparing explainers. Benchmarks provide a controlled environment for systematic evaluation.\n\n- **Caching**: Many explainers in our library generate re-usable cache. The `cache_id` and `model_id` parameters passed to various class instances are used to store these intermediary results. Ensure each experiment is assigned a unique combination of these arguments. Failing to do so could lead to incorrect reuse of cached results. If you wish to avoid re-using cached results, you can set the `load_from_disk` parameter to `False`.\n\n- **Explainers Are Expensive To Calculate**: Certain explainers, such as TracInCPRandomProj, may lead to OutOfMemory (OOM) issues when applied to large models or datasets. In such cases, we recommend adjusting memory usage by either reducing the dataset size or using smaller models to avoid these issues.\n\n## \ud83d\udcd3 Tutorials\n\nWe have included a few [tutorials](tutorials) to demonstrate the usage of **quanda**:\n\n* [Explainers](tutorials/demo_explainers.ipynb): shows how different explainers can be used with **quanda**\n* [Metrics](tutorials/demo_metrics.ipynb): shows how to use the metrics in **quanda** to evaluate the performance of a model\n* [Benchmarks](tutorials/demo_benchmarks.ipynb): shows how to use the benchmarking tools in **quanda** to evaluate a data attribution method\n\nTo install the library with tutorial dependencies, run:\n\n```bash\npip install -e '.[tutorials]'\n```\n\n## \ud83d\udc69\u200d\ud83d\udcbbContributing\nWe welcome contributions to **quanda**! You could contribute by:\n- Opening an issue to report a bug or request a feature.\n- Submitting a pull request to fix a bug, add a new explainer wrapper, a new metric, or another feature.\n\nA detailed guide on how to contribute to **quanda** can be found [here](CONTRIBUTING.md).\n",
"bugtrack_url": null,
"license": "MIT License Copyright (c) 2024 Dilyara Bareeva, Galip \u00dcmit Yolcu Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.",
"summary": "Toolkit for quantitative evaluation of data attribution methods in PyTorch.",
"version": "0.0.2",
"project_urls": {
"Homepage": "https://github.com/dilyabareeva/quanda",
"Issues": "https://github.com/dilyabareeva/quanda/issues"
},
"split_keywords": [
"deep learning",
" interpretability",
" machine learning",
" xai"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "3664ebd7f5bd1b43f6cb0995ae0e81aa874eaf5aa4e1469da83d9f93b822a58c",
"md5": "4c0701c5a627296b014c90a37e762c82",
"sha256": "c552dca08349b86f44a1366ee474c27e287f036e9b995de2a97a4ee2ea9e189b"
},
"downloads": -1,
"filename": "quanda-0.0.2-py3-none-any.whl",
"has_sig": false,
"md5_digest": "4c0701c5a627296b014c90a37e762c82",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": "<3.12,>=3.8",
"size": 102481,
"upload_time": "2024-10-05T14:14:36",
"upload_time_iso_8601": "2024-10-05T14:14:36.264030Z",
"url": "https://files.pythonhosted.org/packages/36/64/ebd7f5bd1b43f6cb0995ae0e81aa874eaf5aa4e1469da83d9f93b822a58c/quanda-0.0.2-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "8f4c5744954c43fad82bb48d7b917df08d0cf9f992e4b51e9f26a12822a16cbf",
"md5": "75ad3f04209c65501f2da987b80e121b",
"sha256": "0ff639e6c6352170972e11b7ac48524796b83602aade46d16c85e9a1eca5777f"
},
"downloads": -1,
"filename": "quanda-0.0.2.tar.gz",
"has_sig": false,
"md5_digest": "75ad3f04209c65501f2da987b80e121b",
"packagetype": "sdist",
"python_version": "source",
"requires_python": "<3.12,>=3.8",
"size": 21135992,
"upload_time": "2024-10-05T14:15:29",
"upload_time_iso_8601": "2024-10-05T14:15:29.313803Z",
"url": "https://files.pythonhosted.org/packages/8f/4c/5744954c43fad82bb48d7b917df08d0cf9f992e4b51e9f26a12822a16cbf/quanda-0.0.2.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2024-10-05 14:15:29",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "dilyabareeva",
"github_project": "quanda",
"github_not_found": true,
"lcname": "quanda"
}
