Training Data Attribution via Approximate Unrolled Differentiation
<|reference_start|>Training Data Attribution via Approximate Unrolled Differentiation: Many training data attribution (TDA) methods aim to estimate how a model's behavior would change if one or more data points were removed from the training set. Methods based on implicit differentiation, such as influence functions, can be made computationally efficient, but fail to account for underspecification, the implicit bias of the optimization algorithm, or multi-stage training pipelines. By contrast, methods based on unrolling address these issues but face scalability challenges. In this work, we connect the implicit-differentiation-based and unrolling-based approaches and combine their benefits by introducing Source, an approximate unrolling-based TDA method that is computed using an influence-function-like formula. While being computationally efficient compared to unrolling-based approaches, Source is suitable in cases where implicit-differentiation-based approaches struggle, such as in non-converged models and multi-stage training pipelines. Empirically, Source outperforms existing TDA techniques in counterfactual prediction, especially in settings where implicit-differentiation-based approaches fall short.<|reference_end|>
@article{bae2024training,
    title={Training Data Attribution via Approximate Unrolled Differentiation},
    author={Juhan Bae, Wu Lin, Jonathan Lorraine, Roger Grosse},
    journal={arXiv preprint arXiv:2405.12186},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.12186},
    primaryClass={cs.LG}
}