Reply to Reviewer Jeha
> My main concern is that the proposed method seems to be heuristic and empirical. there is not enough discussion on its intuition or theoretical foundation.
We genuinely value the reviewer's insights. Our FOMO approach stems from the hypothesis that simulating active forgetting, as observed in the human brain, can effectively address robust overfitting in Adversarial Training (AT). Our method integrates selective forgetting in later layers, consolidation for long-term memory, and interleaved training as mechanisms to improve generalization. Our rationale is supported by evidence from active forgetting studies in neuroscience, which is extensively elaborated in Section 2.3 and the methodology section. Furthermore, we have empirically validated our hypothesis by conducting comprehensive evaluations across multiple datasets. The noticeable improvements in robustness and generalization serve as empirical evidence reinforcing the effectiveness of our method.
While we acknowledge the importance of theoretical analysis, our primary focus was to showcase the practical efficacy of our proposed method. However, subsequent to our empirical findings, a theoretical exploration can further deepen our understandings of the learning mechanisms employed by FOMO. This aspect is explicitly discussed in our future work section, emphasizing the necessity of further theoretical analysis to complement our empirical findings.
> I don't think the running time and convergence analysis are well-studied in this paper, the authors may need to provide a table showing how many epochs are needed to converge and compare the running time with the existing methods.
We appreciate your suggestion and thus, we have conducted additional experiments and present the training time (per epoch) for several methods in our revised manuscript. To ensure a fair comparison, all methods were integrated into a universal training framework, and each test was performed on a single NVIDIA GeForce 3090 GPU. Table 9 (Appendix section A7) in the revised manuscript now includes the required information.
Notably, FOMO and our baselines were trained for the same number of epochs (i.e., 200 epochs for CIFAR-10/100). From the table, it is evident that FOMO imposes nearly no extra computational cost compared to vanilla PGD-AT, with specific values being 137.1s for FOMO and 132.6s for vanilla PGD-AT per epoch. This implies that FOMO is an efficient training method in practical terms. It is important to highlight that KD+SWA, a formidable method designed to counter robust overfitting, comes with an increased computational cost. This arises from its approach, which entails the pretraining of both a robust and a non-robust classifier, serving as the adversarial and standard teacher, respectively. Additionally, the method incorporates the process of distilling knowledge from these teachers. Moreover, KD+SWA employs stochastic weight averaging to smoothen the weights of the model, further contributing to its computational demands.We believe that this addition enhances the practical insights into the efficiency of FOMO and its comparison with existing methods. We would be happy to address any remaining concern or suggestion.
### Table: Training Time per Epoch on CIFAR-10 under ε∞ = 8/255 Perturbation (PreActResNet-18)
| Methods | Training Time per Epoch (s) |
| ------------- | ------------------------|
| PGD-AT | 132.6 |
| WA | 133.1 |
| KD+SWA | 132.6 (pretraining of AT) +16.5 +141.7 |
| AWP | 143.8 |
| FOMO | 137.1 |
> Minor: Please refrain from only using color to distinguish curves and bars as in Figures 3, 4, 5, and 6, as it is not friendly to readers with color blindness.
We value your feedback. In the final version, we'll modify these figures to ensure they're accessible to readers with color vision deficiencies. Thank you for highlighting this important consideration.
> Minor: Missing reference on robust generalization: Zhang, et al. "The limitations of adversarial training and the blind-spot attack." ICLR 2019.
Thank you for your suggestions. We have added this in the related work under robust generalization.