- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
ERPFU combines weight-orthogonality regularization during federated training with retained-data optimization of a fixed, magnitude-selected classifier residual after a deletion request. The encoder and base classifier remain frozen. A conditional analysis separates optimization error, excluded correction coordinates, and the discrepancy between frozen-feature adaptation and full retraining. The reported experiments compare retained and deletion-associated accuracies across several datasets and request types. The paper limits its claims to functional behavior and retained utility, and explicitly does not certify privacy erasure.
Critical strengths
-
The restricted optimization problem is specified clearly. The paper distinguishes active coordinates from actual dense storage, explains that 90% of the classifier remains trainable, and states the effect of copying base weights into the residual. This makes the computational restriction and its limitations easier to assess.
-
The analysis separates approximation errors that are often conflated. In particular, optimizing the classifier more accurately cannot eliminate a mismatch caused by the frozen encoder. The covariance and aggregation calculations also explain why orthogonal local weights alone do not imply globally decorrelated representations. These are useful qualifications to the proposed preparation strategy.
Critical weaknesses
-
The provenance of the central utility results needs clarification. Appendix F, p. 16, says that complete run configurations are unavailable and exact correspondence between the formal SCA specification and every historical run remains unverified. This does not establish that the runs used a different algorithm, but the paper does not identify which records were checked. In particular, can the four Table 1 ERPFU results be traced to runs with a frozen encoder, fixed classifier support, and the stated initialization and evaluation state? These records underpin the main claim of retained accuracy within 1.85 points of retraining. Reusing disclosed benchmark values and lacking matched seeds are not themselves errors; the unresolved issue is whether the central comparison evaluates the defined method under comparable conditions.
-
The empirical contribution beyond classifier-only adaptation remains modestly supported. Appendix E varies the active fraction from 0.80 to 0.95, but provides no dense-head, random-support, or no-WOR control. The paper correctly acknowledges that the sweep confounds support with copy initialization and does not establish a causal benefit from WOR or magnitude selection. This does not invalidate its narrower feasibility claim. It does leave unclear what the proposed preparation and support rule add to an ordinary retained-data head refit, which limits the strength of the method’s empirical contribution.
Questions for authors
-
Can the authors map the four main IID ERPFU records to their code versions and configurations, identify any differences from Section 3.3, and confirm comparable partitions and evaluation protocols with retraining? If those records cannot be recovered, a traceable run of the specified method in a representative setting would help establish which conclusions remain supported.
-
Is there existing evidence comparing the proposed design with dense classifier adaptation under a common preparation and initialization protocol? Such a comparison would help assess the contribution of fixing a magnitude-selected support. A claim that WOR or magnitude selection improves performance would require its corresponding control; the narrower utility-feasibility claim does not require a privacy guarantee or validation of the logit bound.