mlsanityData to 14 Oct 2026

Global-Local Regularization Via Distributional Robustness

arXiv 2203.00553 ↗First posted 1 Mar 2022cs.LG cs.AIcited by 11

Not on the map. Why?

Abstract (arXiv)

Despite superior performance in many situations, deep neural networks are often vulnerable to adversarial examples and distribution shifts, limiting model generalization ability in real-world applications. To alleviate these problems, recent approaches leverage distributional robustness optimization (DRO) to find the most challenging distribution, and then minimize loss function over this most challenging distribution. Regardless of achieving some improvements, these DRO approaches have some obvious limitations. First, they purely focus on local regularization to strengthen model robustness, missing a global regularization effect which is useful in many real-world applications (e.g., domain adaptation, domain generalization, and adversarial machine learning). Second, the loss functions in the existing DRO approaches operate in only the most challenging distribution, hence decouple with the original distribution, leading to a restrictive modeling capability. In this paper, we propose a novel regularization technique, following the veins of Wasserstein-based DRO framework. Specifically, we define a particular joint distribution and Wasserstein-based uncertainty, allowing us to couple the original and most challenging distributions for enhancing modeling capability and applying both local and global regularizations. Empirical studies on different learning problems demonstrate that our proposed approach significantly outperforms the existing regularization approaches in various domains: semi-supervised learning, domain adaptation, domain generalization, and adversarial machine learning.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 58 of its 95 references that are in the map. First posted on arXiv 1 Mar 2022.

Builds on

58 of 95 references.

References · 58

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  4. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  5. 2016Densely Connected Convolutional Networkscited by 6,720
  6. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  7. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  8. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  9. 2016Wide Residual Networkscited by 3,070
  10. 2015Domain-Adversarial Training of Neural Networkscited by 3,044
  11. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
  12. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
38 more
  1. 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,546
  2. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
  3. 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,628
  4. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
  5. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
  6. 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,329
  7. 2016Temporal Ensembling for Semi-Supervised Learningcited by 1,057
  8. 2019Learning Robust Global Representations by Penalizing Local Predictive Powercited by 1,013
  9. 2014Striving for Simplicity: The All Convolutional Netcited by 990
  10. 2017Deeper, Broader and Artier Domain Generalizationcited by 986
  11. 2016Adversarial Machine Learning at Scalecited by 936
  12. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 920
  13. 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 763
  14. 2016Deep Transfer Learning with Joint Adaptation Networkscited by 612
  15. 2020On Adaptive Attacks to Adversarial Example Defensescited by 555
  16. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 507
  17. 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
  18. 2016Unsupervised Domain Adaptation with Residual Transfer Networkscited by 341
  19. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
  20. 2016Domain Separation Networkscited by 320
  21. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 291
  22. 2019Episodic Training for Domain Generalizationcited by 245
  23. 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 214
  24. 2020Bag of Tricks for Adversarial Trainingcited by 200
  25. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 189
  26. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 185
  27. 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 183
  28. 2017Generate To Adapt: Aligning Domains using Generative Adversarial Networkscited by 183
  29. 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 170
  30. 2015Distributionally Robust Logistic Regressioncited by 126
  31. 2019Learning Robust Representations by Projecting Superficial Statistics Outcited by 123
  32. 2020Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustnesscited by 121
  33. 2019Defense Against Adversarial Attacks Using Feature Scattering-based Adversarial Trainingcited by 95
  34. 2018Best sources forward: domain generalization through source-specific netscited by 82
  35. 2020Adversarial Distributional Training for Robust Deep Learningcited by 79
  36. 2019On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithmscited by 62
  37. 2015Distributional Smoothing with Virtual Adversarial Trainingcited by 61
  38. 2019Robustness to Adversarial Perturbations in Learning from Incomplete Datacited by 49

50 most cited of 58 All 58 (JSON)

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 3; 2024: 3; 2025: 4.

11 papers.