mlsanityData to 14 Oct 2026

PEER pressure: Model-to-Model Regularization for Single Source Domain Generalization

arXiv 2505.12745 ↗First posted 19 May 2025cs.LG cs.AIcited by 7

Not on the map. Why?

Abstract (arXiv)

Data augmentation is a popular tool for single source domain generalization, which expands the source domain by generating simulated ones, improving generalization on unseen target domains. In this work, we show that the performance of such augmentation-based methods in the target domains universally fluctuates during training, posing challenges in model selection under realistic scenarios. We argue that the fluctuation stems from the inability of the model to accumulate the knowledge learned from diverse augmentations, exacerbating feature distortion during training. Based on this observation, we propose a novel generalization method, coined Parameter-Space Ensemble with Entropy Regularization (PEER), that uses a proxy model to learn the augmented data on behalf of the main model. The main model is updated by averaging its parameters with the proxy model, progressively accumulating knowledge over the training steps. Maximizing the mutual information between the output representations of the two models guides the learning process of the proxy model, mitigating feature distortion during training. Experimental results demonstrate the effectiveness of PEER in reducing the OOD performance fluctuation and enhancing generalization across various datasets, including PACS, Digits, Office-Home, and VLCS. Notably, our method with simple random augmentation achieves state-of-the-art performance, surpassing prior approaches on sDG that utilize complex data augmentation strategies.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 51 of its 64 references that are in the map. First posted on arXiv 19 May 2025.

Builds on

51 of 64 references.

References · 51

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  2. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  3. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
  4. 2015Domain-Adversarial Training of Neural Networkscited by 3,044
  5. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,269
  6. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
  7. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,838
  8. 2016Adversarial examples in the physical worldcited by 1,769
  9. 2019Similarity of Neural Network Representations Revisitedcited by 1,755
  10. 2020Knowledge Distillation: A Surveycited by 1,603
  11. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  12. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
38 more
  1. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  2. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
  3. 2017Deeper, Broader and Artier Domain Generalizationcited by 986
  4. 2020Designing Network Design Spacescited by 960
  5. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
  6. 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 766
  7. 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 739
  8. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
  9. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
  10. 2019On Variational Bounds of Mutual Informationcited by 559
  11. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
  12. 2023Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervisioncited by 467
  13. 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
  14. 2020What is being transferred in transfer learning?cited by 368
  15. 2021Self-Supervised Learning with Data Augmentations Provably Isolates Content from Stylecited by 312
  16. 2020Learning to Learn Single Domain Generalizationcited by 296
  17. 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 291
  18. 2021Learning to Diversify for Single Domain Generalizationcited by 170
  19. 2020Geometric Dataset Distances via Optimal Transportcited by 158
  20. 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
  21. 2021Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalizationcited by 144
  22. 2022Domain Generalization by Mutual-Information Regularization with Pre-trained Modelscited by 133
  23. 2020Towards Nonlinear Disentanglement in Natural Data with Temporal Sparse Codingcited by 122
  24. 2022Fusing finetuned models for better pretrainingcited by 110
  25. 2021Towards the Generalization of Contrastive Self-Supervised Learningcited by 99
  26. 2021Progressive Domain Expansion Network for Single Domain Generalizationcited by 97
  27. 2021Adversarially Adaptive Normalization for Single Domain Generalizationcited by 85
  28. 2022Mechanistic Mode Connectivitycited by 50
  29. 2021Exploring the Equivalence of Siamese Self-Supervised Learning via A Unified Gradient Frameworkcited by 49
  30. 2023Weighted Ensemble Models Are Strong Continual Learnerscited by 42
  31. 2022Understanding and Improving the Role of Projection Head in Self-Supervised Learningcited by 36
  32. 2023A Unified Approach to Domain Incremental Learning with Memory: Theory and Algorithmcited by 33
  33. 2021A Note on Connecting Barlow Twins with Negative-Sample-Free Contrastive Learningcited by 26
  34. 2023PopulAtion Parameter Averaging (PAPA)cited by 23
  35. 2023AdvST: Revisiting Data Augmentations for Single Domain Generalizationcited by 16
  36. 2021Rethinking Content and Style: Exploring Bias for Unsupervised Disentanglementcited by 7
  37. 2021Estimating and Maximizing Mutual Information for Knowledge Distillationcited by 6
  38. 2023Domain Generalization by Rejecting Extreme Augmentationscited by 5

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 4.

7 papers.