- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates a problem in cross-institutional personalized learning: when the receiver only has access to a model from a single transfer and a limited number of labels, can the internal state of the teacher model provide effective information beyond the predicted score? To address this, the authors propose the SHIFT method: the receiver runs a fixed teacher model locally, extracts a TreeSHAP vector for each sample, and uses this vector, along with the teacher's predicted score and the original features allowed, to train the student model. This process requires no data upload or further involvement from the source side. Under restricted feature access, SHIFT-Q improves mean AUC by 0.0058 over a matched score-only student, with positive gains on 18 of 22 datasets and a Holm-adjusted p-value of 0.033. On seven tasks with semantically defined feature-access restrictions, allowing state-based candidates during validation-based model selection reduces selected test NLL by 0.0128 compared with a scalar-only candidate set that also permits retaining a calibrated teacher.
Critical strengths
1)The paper studies a meaningful and clearly specified question: whether a frozen teacher’s internal state provides predictive value beyond its scores when the receiver’s trainable model has restricted access to raw features. This offers a useful perspective on model reuse under asymmetric feature-access constraints.
2)The experimental design carefully isolates the contribution of aligned state by holding the teacher, student learner, anchor, and blending rule fixed. Alignment-breaking controls, width-matched representations, and comparisons with alternative leaf encodings help distinguish the state contribution from several plausible confounding factors.
3)Extensive experiments demonstrated the effectiveness of the method. On 22 tabular tasks aligned state improves AUC over an otherwise matched score-only student.
Critical weaknesses
1)The method in this paper has limited contribution. There is already a lot of related work on using the leaf nodes or attribution results of the tree model as downstream features, and formula (1) is also a standard conditional entropy relationship. At the same time, the performance improvement of the methods in Tables 2 and 3 is limited. In addition, the average AUC of SHIFT-Q is 0.8443, which does not exceed the 0.8454 of the prior aligned teacher.
2)The reported CPU implementation incurs substantial inference overhead. Table 9 reports end-to-end costs, but SHIFT-Q's batch throughput on Jasmine and MiniBooNE is 1,117 and 312 rows/second, respectively, significantly lower than the score-only baseline of 121,243 and 87,751 rows/second. Combined with limited performance gains, the practicality of this approach requires further explanation.
3)The practical applicability of the assumed access contract remains insufficiently validated. The teacher must retain access to all features at inference, while the student is prohibited from using some raw fields but is permitted to consume derived state that may reveal those fields. Although the paper explicitly acknowledges this distinction, a concrete deployment case demonstrating why such permissions are acceptable and how they are enforced would strengthen the practical motivation.
Questions for authors
See Weaknesses.
2 comments
comment 2 out of 2
"a concrete deployment case demonstrating why such permissions are acceptable and how they are enforced would strengthen the practical motivation."
Section 3.1 now gives both the mechanism and the cases. The asymmetric-access pattern already exists in credit scoring. FICO Score XD uses telecom, utility, pay-TV and public-record information held by external providers and reaches lenders as a score with up to five reason codes. The lender's own underwriting can use that output without directly receiving all the fields behind it. Credit-disclosure rules such as FCRA and Regulation B require specific reasons in relevant circumstances, and cloud systems such as SageMaker Clarify already return per-record attributions. These are different kinds of outputs, but they establish that a score need not be the only information released by a model.
The receiver-executed case is illustrated by hospital early-warning systems. Models including the Epic Deterioration Index and Sepsis Model run inside a health system's production record on identified clinical data and return patient-level risk scores and contributing factors. Their scores have also been used in published clinical research (Singh et al. 2021). The institution's research extracts may have narrower permissions, including restrictions on sensitive records. The model can therefore operate on a broader record than is available to a separate research or prediction workflow. This is an operational analogue, not a claim that the hospitals already use SHIFT.
The question is what the downstream model is allowed to receive. Existing permission to use a score or explanation does not automatically extend to the teacher's SHAP vector or internal state. Appendix B therefore specifies the additional authorization needed for that channel. It describes the two execution topologies, at the sender or inside a cleared receiver-side component, and gives a four-clause deployer's contract with its permissions matrix (Table 5) and audit steps. It also describes an honest-broker arrangement in which a cleared intermediary computes permitted derived outputs from records the downstream researcher cannot access directly.
Where the restriction is based on provenance, because only the shipped component passed the review authorizing its use, a separately approved state output can be permitted. Where the restriction protects the information itself, the state channel must be separately authorized or refused. Enforcement depends on the permissions and audit controls of the actual deployment, not merely on the fact that the output is derived from an approved model.
For a deployer considering a narrower channel, the revision gives the relevant measurements. Width-4 SHIFT-Q keeps 69% of the full-width AUC gain on the 24 population-shifted contexts, at a held-out probe R² of .17 against .05 for the score alone, and still beats the recalibrated teacher on 6/7 tasks (Table 26). Tables 26 and 27 report the utility and measured exposure at different widths. A width cap is not itself a privacy guarantee, but it gives the deployer evidence to assess alongside the access contract.
comment 1 out of 2
Thank you for the review. We tested each concern. Per-tree margins, the cheapest state channel, answer the first two together: their batch throughput is 2.6 to 3.1 times lower than score-only, against 108 to 291 times for attribution in the submission's timing run, and they add 6 to 12% to single-record latency (Tables 10 and 24). They are also the best arm of all on two of the three population-shift suites, lowering NLL by .0222 and .0561 relative to the recalibrated teacher on 7/7 tasks and 23/23 forces (Tables 3 and 23).
At the fixed blend SHIFT-Raw is .8460, above the teacher's .8454, while SHIFT-Q, the declared primary, is .8443. SHIFT-Raw has the best mean AUC of any arm under the fixed rule and again under a tuned blend with calibration parity, +.0024 AUC over the teacher on 13/22 tasks (raw p .046, Table 21, cited from Section 5.1). At the complete-feature interface it has the highest mean AUC of all 27 arms, above the teacher and all 21 published federated and one-shot systems (.8473 against .8433 for the strongest, Table 2), and it separates from 19 of the 21 after correction.
The larger result is where receiver populations differ. There every state channel has lower mean NLL than the recalibrated teacher on all three suites the revision adds, SHIFT-Q as well: 7/7 tasks, 9 to 10 of 12 countries and 23/23 forces (Tables 3 and 23), with the two silo studies under protocols frozen before their runs.
On Equation 1, we agree that it is a standard identity. Its role in the paper is the condition it sets, which we test in two ways. The access-by-state interaction isolates the effect of the restriction within one protocol (+.0054 AUC at the fixed blend, 19/22, Holm below .001, Table 13), and across 110 units the state gain tracks the direct-access headroom (Spearman .56 and .53 on disjoint seeds, Figure 3 in Appendix M). Leaf and attribution encodings are prior work, and we use them as fixed inputs. What is new is the test that varies only the student's entitlement, and the population-shift results under that interface.
Section 6 now carries exactly that comparison. The per-tree margin channel, one leaf lookup per tree, removes most of the gap: 40,563 and 29,266 rows per second against 104,696 and 91,735 for score-only, measured in a separate timing run with its own score-only baseline (Table 24). On the 22 tasks it keeps the attribution channels' fixed-blend gain, and it has the lowest held-out probe R² of the state channels. Section 6 states the rule: per-tree margins for batch scoring and for the population-shift gain, SHIFT-Raw where the cost of attribution is acceptable, and width-4 SHIFT-Q or per-tree margins under an exposure cap. Table 24 has the per-tree costs end to end.