- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
SREraser addresses interaction-level unlearning in sequential recommendation through two components: User-Centric Spherical Partitioning (UCSP), which reduces user-partitioning overhead, and Adaptive Dimension Aggregation (ADA), which combines sub-model representations using dimension-wise weights. Experiments demonstrate improved recommendation utility over the evaluated shard-based baselines, with comparable unlearning time.
Critical strengths
S1. Effective partitioning optimization. UCSP substantially reduces partitioning overhead while maintaining comparable recommendation quality. On Games, partitioning takes 1.71 seconds, compared with 8.06 seconds for spherical KMeans and 28.20 seconds for Euclidean KMeans.
Critical weaknesses
W1. The central exact-unlearning guarantee is not established. UCSP constructs shards using an encoder pretrained on the full training dataset, so shard assignments can retain influence from subsequently deleted interactions. Retraining only the affected sub-model and aggregator does not establish equivalence to rerunning the complete pipeline on retained data. The authors need to account for this data-dependent partitioning in their exactness argument.
W2. The efficiency evaluation does not match the utility workload. Utility is evaluated after deletions distributed across every shard, whereas timing covers a single interaction-deletion request. Moreover, cache-refresh costs are partly estimated using a theoretical scaling factor. These results therefore do not establish end-to-end efficiency for the batch-deletion workload used to evaluate utility.
W3. Novelty is incremental, and ADA’s distinctive mechanism is insufficiently isolated. SREraser retains SRU’s shard-based framework and primarily modifies partitioning and aggregation. Although ADA improves accuracy, the ablations lack a prototype-free dimension-wise gate and capacity-matched alternatives. Consequently, they do not establish whether prototype conditioning specifically contributes beyond finer-grained weighting or increased model capacity.
Questions for authors
Please refer to Weaknesses.
Thank you for your detailed response.
I still have concerns about the motivation and methodological novelty. Essentially, UCSP modifies the capacity-constrained K-means by introducing randomized user ordering, while ADA extends the aggregation gate to dimension-wise weighting. These still appear to be two relatively simple. For example, replacing UCSP with another efficient K-means variant, or ADA with another aggregation mechanism, might also lead to some improvements. I still do not see a sufficiently strong connection between these designs and the unique challenges of machine unlearning, or why their combination constitutes a substantial methodological contribution to this field.
I appreciate the clarification regarding the efficiency comparison, but my convergence concern remains. Running all methods for a fixed 50 iterations ensures the same iteration budget, but does not necessarily provide a fair comparison of their efficiency in reaching convergence. For example, what if conventional K-means converges within 20 iterations, while UCSP requires 50 due to its randomized assignment strategy? I would therefore like to see a comparison based on actual convergence behavior rather than only a fixed iteration budget.
For these reasons, I will maintain my original rating.