We introduce the target-response Jacobian , which measures how model predictions respond to changes in individual training targets. complements training-data attribution (TDA) methods, which characterize sensitivity to the weights placed on training observations in the loss rather than to their targets, and can be computed matrix-free at the same cost as influence-based TDA methods. We show that sample-weight influence and follow from the same implicit differentiation argument and differ only by a per-example multiplier: for pointwise losses, exactly at any stationary point with an invertible Hessian. For canonical-link losses (squared error, logistic, Poisson) the multiplier is the training residual, , and softmax cross-entropy obeys a multiclass version. The identity predicts three ways in which influence fails when used in place of : small residuals shrink its predicted shift towards zero (interpolation collapse), residuals of mixed sign wash out its direction (direction washout), and under softmax cross-entropy it collapses a training point’s per-class sensitivities towards its own true class (true-class collapse). We score both operators against refitting with a per-prediction across target perturbations, with no rescaling. On tanh networks trained with squared error (Friedman #1) and logistic loss (MAGIC, HIGGS), with from 2,000 to , reaches between 0.99 and 1.00, whereas influence’s is negative on every dataset. On an MNIST softmax classifier, influence’s is again negative, while reaches 0.92. On HIGGS, one row of , holding all sensitivities of one prediction, takes under 0.2 seconds on an RTX 3090 after a one-time setup of under five minutes, whereas refitting would take refits.

生成讲解博客的中文版本

生成AI智能校验的中文版本