- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper aims to define a new proxy metric called RGD for the F&Z memorization scores in classification settings. They base the RGD metric on representation level analysis at the penultimate layer (before classification head). They show that their new metric has a higher correlation with the F&Z memorization scores than prior proposed metrics for ImageNet while achieving comparable values for CIFAR100. They also utilize the new metric to detect mislabeled samples (symmetric and asymmetric label noise) and recovering their true labels.
Critical strengths
-
Understanding memorization in the representation space is novel and to my prior knowledge it has not been previously explored to estimate the highly expensive F&Z memorization scores. The paper is easy to follow as well with a clear theme, which I really appreciate, especially given how recent papers in LLM era are portrayed to be overly complicated.
-
The theory associated with the newly proposed RGD metric also is interesting and adds value to the proposed metric to relate with the F&Z memorization score. The assumptions made in the theory also seem reasonable and intuitive.
Critical weaknesses
I have thoroughly reviewed this paper and below are the major, critical weaknesses that I see in the current form:
- There are some key memorization literature papers (for classification settings - as this paper is about that in the current form) missing in Related Work and I believe they should be cited:
- Learning and Memorization, ICML 2018
- Deep Learning Through the Lens of Example Difficulty, NeurIPS 2021
- Can Neural Network Memorization Be Localized?, ICML 2023
- Impact of Layer Norm on Memorization and Generalization in Transformers, NeurIPS 2025
-
I understand that the F&Z scores were only made available for the classification tasks. However, in this era of LLMs it is not clear whether this new metric will even estimate the "counterfactual memorization" definition proposed in [1]. The counterfactual memorization definition is essentially the leave-one-out (LOO) variant for generative tasks. I believe it is important (critical) to show that the metric can estimate LOO for generative tasks as well. Authors could look into long-tail generative language tasks to simulate the long-tail settings. I will be okay if they could provide even a single dataset-model setting.
-
No timing analysis is provided to compare with existing available proxy metrics. I believe it is important that the authors provide a comparison between them.
-
I checked Appendix A and A.1 of the paper and the training hyper-parameters differ from the ones used in F&Z [2] original paper (see their Appendix B). So, how can the authors compare their metric values with the original F&Z scores if the hyper-parameters are different. Further clarification is required regarding this with a controlled same setup.
-
The authors said they only did experiments for ResNets, however their mislabeled sample detection setup can easily be shown for vision and language transformers easily since they do not need to estimate the F&Z scores for the same. Hence, it is important that they show how the proposed metric performs for transformers atleast for mislabeled samples detection and recovery experiments. Also, why are CIFAR-10 asymmetric label noise experiments not provided in the current version (only CIFAR100 is provided for both types of noise and CIFAR-10 with symmetric noise in Tables 2, 3, 4)?
-
The authors say that they use only the penultimate layers representation analysis for developing their metric. However, they do not consider doing the representation analysis at other intermediate layers. An experiment to check this is going to be very beneficial to understand which layers are the most important for efficiently approximating the F&Z scores, and further strengthen this paper.
Questions for authors
-
[3] did an adversarial distance analysis showing F&Z M-scores and CSL (their proposed metric) aligned with poor adversarial robustness, i.e., M-score/CSL-score is inversely proportional to Adversarial Distance. It will be informative to know if RGD also follows the same pattern or not, further confirming that memorization means failure to learn robust, generalizable patterns.
-
[3] also did a duplicate detection experiment showing CSL can identify duplicates quickly than other methods. Does RGD outperform CSL for duplicates detection as well? An analysis regarding this would be nice.
-
Please address my Weaknesses as well. All the points listed in Weaknesses and Questions are important from my opinion.
[1] Counterfactual memorization in neural language models, NeurIPS 2023
[2] What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimation, NeurIPS 2020
[3] Towards Memorization Estimation: Fast, Formal and Free, ICML 2025
I am willing to increase the score if the authors can successfully answer the weaknesses and questions raised by me. (PS: I have not used any AI tool to review your paper and am genuinely curious about your paper).
6 comments
We thank the reviewer for their time, suggestions, and patience. We have been conducting additional experiments and preparing detailed responses to address your concerns. We appreciate your feedback and welcome further discussion.
Weakness 1 - Related Work
Thank you for the suggestion. All four papers are now cited in the Related Work section (Section 2).
Weakness 2 - Counterfactual Memorization in Language Modeling
We have added a counterfactual memorization experiment for autoregressive language modeling in Section 4.4.1 and Appendix I of the revised manuscript.
Following Wu and Papyan (2024) [1], we extend RGD to language modeling by treating next-token identities as classes: prediction positions sharing the same target token belong to the same class, and the hidden representations of their preceding contexts are used to construct class centroids. Averaging the resulting representation–label disagreement over token positions and training epochs gives a document-level score, computed from a single training run.
We evaluate this extension on WikiBio [2] using a small decoder-only Transformer trained from scratch. Following the counterfactual memorization protocol of Zhang et al. [3], we train 128 models on different 4,000-document subsets drawn from a pool of 8,000 biographies. To investigate the long-tail setting suggested by the reviewer, we evaluate 128 biographies: 64 sampled from the highest decile of lexical rarity and 64 length-matched biographies from the lowest decile. Each biography is included in 64 training subsets and excluded from the other 64. Counterfactual memorization is estimated as the difference in mean teacher-forced next-token prediction accuracy between the two groups.
RGD achieves a Pearson correlation of 0.710 ± 0.012 with counterfactual memorization, compared with 0.597 ± 0.008 for trajectory loss and 0.542 ± 0.011 for final loss (mean ± std over three reference runs). The positive association also persists within each group separately: 0.529 ± 0.026 for rare and 0.673 ± 0.013 for common biographies. Cosine similarities are also reported in Table 6, but are uniformly high (0.96–0.97). We therefore emphasize Pearson correlation in this setting.
These results provide empirical evidence that representation-space disagreement captures counterfactual memorization signals in an autoregressive generative setting. Broader evaluation across language models remains future work.
References
[1] Wu and Papyan, "Linguistic Collapse: Neural Collapse in (Large) Language Models," NeurIPS 2024. https://arxiv.org/abs/2405.17767
[2] Lebret et al., "Neural Text Generation from Structured Data with Application to the Biography Domain," EMNLP 2016. https://doi.org/10.18653/v1/D16-1128
[3] Zhang et al., "Counterfactual Memorization in Neural Language Models," NeurIPS 2023. https://arxiv.org/abs/2112.12938
Weakness 3 - Computational Cost
We thank the reviewer for highlighting the importance of computational efficiency.
We have added a computational-cost comparison with existing memorization proxies in Appendix L, following the analytical, hardware-independent cost framework of Ravikumar et al. (2025, 2026). The comparison includes both full-training and early-stopping settings, with costs normalized to one standard full-length training run. These are operation-count estimates rather than measured wall-clock times, which depend on hardware.
RGD requires one additional forward-only pass per recorded epoch, without additional backward passes or retraining. This corresponds to approximately 1.33× the cost of standard training, compared with approximately 1× for loss-based proxies accumulated during training and 14× for curvature-based estimation under the specified assumptions.
Furthermore, our shorter-trajectory experiments show that RGD retains substantial agreement with FZ memorization using only the first 10% of training, achieving cosine similarities of 0.73 on ImageNet and 0.83 on CIFAR-100. If training is terminated at this point, the estimated total computational cost is approximately 0.13× that of one standard full-length training run, within the 0.1–0.3× analytical cost range reported for CSG and SGAL with early stopping.
Weakness 4 - Training Configuration and FZ Scores
We agree that FZ memorization is formally defined with respect to a learning algorithm and its training configuration. However, there are several reasons why comparing our scores with the published FZ estimates remains meaningful.
First, Feldman and Zhang [1] themselves investigated the consistency of memorization estimates across different architectures (Section 1.1 and Appendix C, Figure C.2 of the NeurIPS version). On CIFAR-100, they observed substantial consistency across ResNet-50, ResNet-18, Inception, and DenseNet-100, with ResNet-18 showing the closest agreement with ResNet-50 among the alternative architectures evaluated. Notably, their DenseNet experiments also used a different learning rate and batch size, both halved relative to ResNet-50 (Appendix B). These findings provide empirical evidence that memorization estimates can remain consistent across architectures and training configurations.
Second, using the publicly released FZ scores as a common reference under different training configurations is an established practice in memorization-proxy research. Curvature [2], CSL [3], and CSG [4] all evaluate their proxies against the published FZ scores despite using different training hyperparameters from the original FZ experiments. Our training configurations closely follow those adopted in these studies.
Importantly, we use the published FZ scores as a common reference for evaluating agreement across all methods, rather than claiming that they are the exact memorization scores of our specific training algorithm.
References
[1] Feldman, V., & Zhang, C. (2020). What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimation. NeurIPS.
[2] Garg, I., Ravikumar, D., & Roy, K. (2024). Memorization Through the Lens of Curvature of Loss Function Around Samples. ICML.
[3] Ravikumar, D., Soufleri, E., Hashemi, A., & Roy, K. (2025). Towards Memorization Estimation: Fast, Formal and Free. ICML.
[4] Ravikumar, D., Soufleri, E., Hashemi, A., & Roy, K. (2026). Memorization Through the Lens of Sample Gradients. ICLR.
The author-reviewer end of discussion deadline is close by. If the authors wish to respond to my concerns, then please do so at the earliest. It would be easier to do the discussion if the rebuttal is posted early.