Country
SupplementaryMaterial: AttributionPreservationin NetworkCompressionforReliableNetwork Interpretation
Note that only the samples that the predictions of the network were correct are counted for a fair evaluation. Since segmentation labels are provided as 0's and 1's, it is possible to evaluate the quality of attribution maps as abinary classification task. This process can be repeated with different thresholds to produce a ROC curve. These examples also predict the correct label (person, horse, cow,train, bus, cat). Finally, a separate classifier is retrained on this perturbed dataset.
endfor
The first method, explained in Section A1.4.1, consists of directly calibrating a sequence of nested two-sided intervals, as outlined in Section 3.3. The second method, explained in Section A1.4.2, consists of separately calibrating two sequences of lower and upper one-sided confidence intervals, each adopting the significance level ฮฑ/2 instead of ฮฑ. Pu j=l หฯj(x)amongthefeasible ones with minimal |u l|, whenever the optimization problem does not have a unique solution. Therefore, we can assume without loss of generality that (1) has a unique solution; if that is not the case, we can break the ties at random by adding a little noise to หฯ. For any integer T 1, consider an increasing sequence tฯ [0,1], for ฯ {0,...,T}. A nested sequenceofT intervalsindexedbyฯ {0,...,T},whichmaybewrittenintheformof St = หLm,ฮฑ(Xm+1;tฯ), หUm,ฮฑ(Xm+1;tฯ), for appropriate lower and upper endpoints หLm,ฮฑ(Xm+1;tฯ) and หUm,ฮฑ(Xm+1;tฯ), respectively, is then constructed from (1) as follows.