Bryan Kian, Hsiang Low, Xiaoqiang Lin, Chuan-Sheng Foo, Rui Qiao, Jingtan Wang
We lifted 9 functions out of this paper's own repositories and ran 6 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| JTWang2000/FreeShap | canonical | 6 of 9 |
| Function | Status | Where it lives |
|---|---|---|
| powerset | Ran | JTWang2000/FreeShap/vinfo/dvutils/utils.py pointer only (licence: NONE) · get_code("fb9020626aee2101") |
| slice_data | Ran | JTWang2000/FreeShap/vinfo/entks/ntk.py pointer only (licence: NONE) · get_code("87695b224d461a5e") |
| softmax | Ran | JTWang2000/FreeShap/vinfo/dvutils/utils.py pointer only (licence: NONE) · get_code("7f45ae25efe8c0fa") |
| to_cuda | Ran | JTWang2000/FreeShap/vinfo/entks/ntk.py pointer only (licence: NONE) · get_code("69503969b65275a2") |
| tqdm_joblib | Ran | JTWang2000/FreeShap/vinfo/utils.py pointer only (licence: NONE) · get_code("687e768b80894e09") |
| worker | Ran | JTWang2000/FreeShap/vinfo/dvutils/Data_Shapley.py pointer only (licence: NONE) · get_code("b2e76acdef785c7b") |
| compute_ntk | Not yet run | JTWang2000/FreeShap/vinfo/entks/ntk.py pointer only (licence: NONE) · get_code("27cd0c00003f7ff6") |
| create_exp_dir | Not yet run | JTWang2000/FreeShap/vinfo/dvutils/utils.py pointer only (licence: NONE) · get_code("5dc3d84f2410ba41") |
| get_conversion_dict | Not yet run | JTWang2000/FreeShap/vinfo/utils.py pointer only (licence: NONE) · get_code("5faef15ca416cd0d") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The increasing complexity of foundational models underscores the necessity for explainability, particularly for fine-tuning, the most widely used training method for adapting models to downstream tasks. Instance attribution, one type of explanation, attributes the model prediction to each training example by an instance score. However, the robustness of instance scores, specifically towards dataset resampling, has been overlooked. To bridge this gap, we propose a notion of robustness on the sign of the instance score. We theoretically and empirically demonstrate that the popular leave-one-out-based methods lack robustness, while the Shapley value behaves significantly better, but at a higher computational cost. Accordingly, we introduce an efficient fine-tuning-free approximation of the Shapley value (FreeShap) for instance attribution based on the neural tangent kernel. We empirically demonstrate that FreeShap outperforms other methods for instance attribution and other data-centric applications such as data removal, data selection, and wrong label detection, and further generalize our scale to large language models (LLMs). Our code is available at https: //github.com/JTWang2000/FreeShap.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2406.04606")
get_code_for_paper("2406.04606")
have("2406.04606")
Connect an agent — have() is free.