Overview

Training data attribution studies how particular examples or datasets affect a model’s behavior, helping researchers debug errors, audit provenance, select useful data, and assess safety. Common approaches include influence functions and gradient similarity, Shapley-style valuation, counterfactual retraining, and membership or provenance tests; newer methods use activations, training trajectories, and compressed gradient representations to scale attribution to large models. Evaluations span language-model knowledge and alignment, image and music generation, classification, and data selection, often comparing scores with retraining or known-inclusion benchmarks. A central challenge is that attribution depends on the counterfactual being asked about, while estimates can be costly, sensitive to interactions and evaluation choices, or confounded by similarity that does not establish causal influence.

Latest papers

92 papers10 papers in the last four weeks, down 52% on the four weeks before. 0.1% of all new papers.

Oct 9, 2024

quanda: An Interpretability Toolkit for Training Data Attribution Evaluation

Training data attribution (TDA) methods estimate the influence of individual training samples on a model's predictions, offering a principled lens for interpreting neural networks. Despite rapid methodological progress, TDA evaluation remains scattered across papers and rarely reproducible, making fair comparison between methods challenging. We introduce quanda, a Python toolkit that standardizes TDA evaluation. quanda features a comprehensive collection of evaluation metrics and ready-to-use benchmarks spanning image classification, text classification, and language modeling, alongside a uniform interface for integrating diverse TDA implementations. We showcase quanda through a comparative study of existing TDA methods and find that no approach excels uniformly across metrics, with clear trade-offs between ground-truth faithfulness and downstream task performance. By consolidating the tooling around TDA, quanda equips the community to evaluate attribution methods rigorously and reproducibly. The toolkit is thoroughly tested, documented, and available as an open-source library on PyPI and at https://github.com/dilyabareeva/quanda.
Apr 30, 2024

Neural Dynamic Data Valuation via Stochastic State-Adjoint Trajectories

Classical data valuation defines a data point's value through the finite marginal contribution U(C∪{i})−U(C)U(C\cup\{i\})-U(C), but estimating this quantity over coalitions requires repeated training and does not describe the contribution made along a stochastic training path. We ask whether marginal contributions of data points can be estimated from one coupled trajectory while retaining a verifiable relation to coalition-based values. To this end, we introduce Neural Dynamic Data Valuation (NDDV), which models each data point as a controlled stochastic state and computes a first-order marginal-contribution score via the adjoint equation of the Stochastic Maximum Principle (SMP). This raw sensitivity is then calibrated by a mass-preserving redistribution that increases one data point's participation while redistributing the same total weight over the remaining data points. We prove that the resulting backward adjoint recursion is the exact reverse-mode adjoint of the frozen-aggregate Euler system, bound its discrepancy from the mean-field sensitivity, and express each finite coalition marginal as an integral of local sample-weight sensitivities. These results yield pair-specific error bounds and sufficient conditions for ordering agreement with Shapley, Banzhaf, and leave-one-out values. Experiments on existing benchmarks evaluate marginal-contribution fidelity, score-release cost, corrupted-sample detection, ablations, and failure regimes. NDDV is a one-run, trajectory-conditioned estimator, not an unconditional replacement for cooperative-game values.