mlsanityData to 14 Oct 2026

ResNets Ensemble via the Feynman-Kac Formalism to Improve Natural and Robust Accuracies

arXiv 1811.10745 ↗First posted 26 Nov 2018cs.LG cs.CR cs.NAcited by 18

Not on the map. Why?

Abstract (arXiv)

Empirical adversarial risk minimization (EARM) is a widely used mathematical framework to robustly train deep neural nets (DNNs) that are resistant to adversarial attacks. However, both natural and robust accuracies, in classifying clean and adversarial images, respectively, of the trained robust models are far from satisfactory. In this work, we unify the theory of optimal control of transport equations with the practice of training and testing of ResNets. Based on this unified viewpoint, we propose a simple yet effective ResNets ensemble algorithm to boost the accuracy of the robustly trained model on both clean and adversarial images. The proposed algorithm consists of two components: First, we modify the base ResNets by injecting a variance specified Gaussian noise to the output of each residual mapping. Second, we average over the production of multiple jointly trained modified ResNets to get the final prediction. These two steps give an approximation to the Feynman-Kac formula for representing the solution of a transport equation with viscosity, or a convection-diffusion equation. For the CIFAR10 benchmark, this simple algorithm leads to a robust model with a natural accuracy of bf 85.62% on clean images and a robust accuracy of bf 57.94 % under the 20 iterations of the IFGSM attack, which outperforms the current state-of-the-art in defending against IFGSM attack on the CIFAR10. Both natural and robust accuracies of the proposed ResNets ensemble can be improved dynamically as the building block ResNet advances. The code is available at: urlhttps://github.com/BaoWangMath/EnResNet.

Key facts. Cited by 18 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Nov 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 7; 2022: 2; 2023: 2; 2024: 3; 2025: 4.

18 papers.

Sort:

  1. 2021Mixed Nash Equilibria in the Adversarial Examples Gamecited by 22
  2. 2021Automated Discovery of Adaptive Attacks on Adversarial Defensescited by 22
  3. 2021Learning Diverse-Structured Networks for Adversarial Robustnesscited by 12
  4. 2021How Does Momentum Benefit Deep Neural Networks Architecture Design? A Few Case Studiescited by 10
  5. 2022Neural ODE Control for Trajectory Approximation of Continuity Equationcited by 9
  6. 2021Deep Residual Networks Learn the Geodesic Curve in the Wasserstein Spacecited by 8
  7. 2021Diffusion Mechanism in Residual Neural Network: Theory and Applicationscited by 5
  8. 2023On the Role of Randomization in Adversarially Robust Classificationcited by 4
  9. 2024A Survey of Neural Network Robustness Assessment in Image Recognitioncited by 3
  10. 2021Robust Certification for Laplace Learning on Geometric Graphscited by 1
  11. 2022Zero Stability Well Predicts Performance of Convolutional Neural Networkscited by 1
  12. 2025Control, Optimal Transport and Neural Differential Equations in Supervised Learningcited by 1
6 more
  1. 2025Adversarial Examples in Environment Perception for Automated Driving (Review)cited by 1
  2. 2023Towards Optimal Randomized Strategies in Adversarial Example Gamecited by 0
  3. 2024Deep Learning with Data Privacy via Residual Perturbationcited by 0
  4. 2024Improving Robustness of Spectrogram Classifiers with Neural Stochastic Differential Equationscited by 0
  5. 2025A Self-Ensemble Inspired Approach for Effective Training of Binary-Weight Spiking Neural Networkscited by 0
  6. 2025Balancing Utility and Privacy: Dynamically Private SGD with Random Projectioncited by 0