- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper considers the problem of bridging case-based decision theory (CBDT) with the decisions of a neural network. More specifically, the problem setup is a DNN trained to predict returns for a set of actions, for example the return for each of the actions of "conservative, standard, and expanded approval" (I'm assuming of a loan?) using the Adult Income dataset.
The core of the method, to my understanding, is as follows:
- Train the neural network.
- Extract the feature representations from the DNN (penultimate layer?) for all training data.
- Fit a linear model per possible action with ordinary least squares (OLS) or ridge regression on these representations. (Equation 2)
- The prediction of the fitted linear model for a new example can then be decomposed as a weighted sum of the training examples' returns (for that action) (Equation 4). These weights can be negative.
- The contribution of each training sample to a decision can then be expressed as the contribution of the sample to the margin between two of the fitted linear models (Equation 5).
The authors then further establish that the found weights must be positive to "admit a Case-Based Decision Theory interpretation", which they can construct using non-negative least squares. This is followed by multiple experiments on four datasets evaluating the method and comparing it to other training sample decomposition methods.
Critical strengths
- The paper achieves its goal of bridging CBDT and DNN decisions.
- The overall method appears sound.
Critical weaknesses
I have three primary concerns:
- Presentation - The paper is difficult to follow, with very little explanation, intuition, or examples to guide the reader. For illustration, a small example of what is meant with "action-specific returns" would greatly improve the readability, as this a niche problem setting not often encountered in the ML literature. Similarly, several concepts are introduced without any preceding explanation as to why it is relevant to the problem. The effect of this is that there's significant work required on behalf of the reader to follow the logic.
- Limited experimental evaluation and explanation: the experimental section is hard to parse, with the actual setup in the appendix. Furthermore, the baseline comparison (Table 2) does not establish that this decomposition is a "better" method of assigning contributions to training samples, but simply that it's better correlated with a given reference (Gaussian similarity weighting).
- Contribution - The OLS expansion of equations 3 and 4 is a known method, and the practical benefit of the CBDT interpretation compared to other training point decomposition methods is unclear.
Questions for authors
- Why is a CBDT interpretation a desirable property? Essentially, it is unclear to me why interpreting the coefficients as CBDT relevance is any "better" than the standard method with potentially negative coefficients. How does the one make it more clear how the neural network has reached a given decision than the other? And what benefit does this interpretation have over other methods such as influence functions?
- How does the core method differ from that of prior work? Are there any novel methodological alterations not used before? This is not adequately explained in the current manuscript, and it is difficult to determine the novelty of the method.
- Are there no real-world datasets available for this task? All datasets use real-world inputs but synthetic labels.
- Can the authors demonstrate that the derived explanations are more true to the neural network's decisions than the baselines? I see no clear evidence of this.
9 comments
W2. Experimental setup and the reference comparison
W2. Experimental setup and the reference comparison
Thank you for pointing this out. We are sorry that the experimental setup and the purpose of the reference comparison were not explained clearly. The original Table 2 (now Table F1 in Appendix F.1) compares our case contributions with attribution-inspired scores under the same trained representation, fitted return models, and action pair. Its reference combines Gaussian input-based relevance with action-return differences. Higher correspondence therefore indicates that a scoring rule more closely reflects this specified case-based preference pattern. The result supports the connection between our representation-based contributions and the CBDT relevance-and-return form. The applicability of the explanation to the original network is examined separately through the decision-agreement condition.
We will clarify these roles and retain the reference comparison as Table F1 in Appendix F.1. To make the experiments easier to follow, we have placed the essential task, fitting, and evaluation settings at the beginning of Section 6, before presenting the results, as follows.
Section 6, experimental setup:
We use a controlled CBDT setting to evaluate score reconstruction and correspondence with specified generating references. PJM, Adult, and Default use real inputs with constructed action returns to compare case reconstructions under a common task setup. CSP-2010 supplies recorded runtimes for two solver configurations. We report agreement with the signed fitted model, agreement with the original network, and task outcomes separately. The reference comparison in Appendix F.1 and the removal experiments in Appendix F.2 address different properties of the case contributions.
To explain the purpose of the original Table 2, we will state what the reference comparison evaluates in Section 6.1 and specify how its scores are compared in Appendix F.1.
Section 6.1, explanation of the reference comparison:
The fitted case contributions align more closely with the specified Gaussian relevance-and-return reference than the adapted attribution scores (Appendix F.1). This comparison tests the ranking and support direction of individual cases under the controlled reference. Agreement with the original network is evaluated separately.
Appendix F.1, comparison setup:
We compare case contributions and attribution-inspired scores on the same trained representation, fitted return models, and action pair. The reference combines each training case's Gaussian input-based relevance with its return difference for that action pair. Closer correspondence indicates that a ranking better reflects this specified case-based preference pattern.
Appendix F.1, revised table caption:
Table F1: Case-contribution correspondence with the specified Gaussian input-based relevance-and-return reference over 500 sampled training cases. Ranking is evaluated by Top-30 Jaccard and nDCG, while sign agreement measures support direction.
W3. Contribution beyond the known expansion
W3. Contribution beyond the known expansion
Thank you for the comment. We agree that the OLS expansion in Eqs. (3) and (4), together with its equivalent kernel form, is standard. Our contribution is not the expansion itself. We use CBDT, a theory of human rational decision-making based on relevant past cases, to examine whether neural networks designed to model human decisions can be explained through their training cases.
This leads to three connected questions. First, can the learned representation provide a case-level explanation with the nonnegative relevance required by CBDT? Second, under what condition does this fitted explanation apply to the original network's decision? Third, when case sets are pooled, can common preferences be retained to maintain decision stability? Joint fitting addresses the first question, the sufficient condition addresses the second, and the pooling analysis addresses the third.
These contributions therefore concern the feasibility, applicability, and stability of CBDT-based explanations of neural network decisions, rather than a new least-squares expansion.
We have clarified this progression in the Introduction and explicitly distinguished the standard mathematical foundation from the questions addressed in Section 3.
Introduction, contributions:
CBDT explains human decisions through experience with relevant past cases. Neural networks also learn from past cases, which motivates us to use CBDT to examine how their learned representations can explain neural network decisions. Our contributions are threefold (Figure 1):
First, we connect trained representations to the CBDT view by decomposing fitted preferences into individual training-case contributions, revealing how past returns support or oppose each choice. Since CBDT relevance requires nonnegative weights, we show why feature-only reconstruction can change fitted choices and develop joint fitting to reduce these changes while improving task-optimal accuracy.
Second, at the network level, we establish a sufficient condition for the fitted case-based explanation to apply to the original network's decision. We use its margin-to-error ratio to rank test cases and identify a smaller subset with higher task-optimal accuracy.
Third, extending the CBDT case-based explanation to pooled data, we derive a requirement for neural network decision consistency: preferences supported by both case sets should be retained after pooling. On a real-world task, our method corrects preference reversals after pooling while retaining an explicit case decomposition, and retains all common choices, improving neural network decision stability.
Section 3, opening paragraph:
The ordinary least-squares fit and its equivalent kernel expansion are standard. We use them to express fitted action preferences through training-case returns, and examine their CBDT relevance interpretation and agreement with the original network decision.
W1. Presentation and action-specific returns
Thank you very much for your comments and for recognizing the connection between CBDT and neural network decisions. We appreciate your questions about the interpretation, practical benefit, and evidence. Below we address each point and provide the corresponding manuscript revisions and completed comparisons.
W1. Presentation and action-specific returns
Thank you for the comment. We are sorry that the action-specific returns and the purpose of the fitting stages were not explained clearly. We have added a numerical solver case to explain how different actions receive different returns and how these returns form a case contribution. We have also clarified the fitting sequence and the purpose of the subsequent decision conditions.
Section 2.1, illustration of action-specific returns:
To make the meaning of an individual case contribution more explicit, we will also clarify the explanation following Eq. (1).
Section 2.1, explanation following Eq. (1):
To connect the case description to the subsequent mathematical steps, the fitting sequence is stated explicitly in Section 3.1.
Section 3.1, fitting sequence:
The following passages introduce the decision questions before their formal conditions.
Section 4.2, motivation preceding Eq. (9):
Section 5, opening motivation: