Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Dynamic Stochastic Ensemble with Adversarial Robust Lottery Ticket Subnetworks (2210.02618v1)

Published 6 Oct 2022 in cs.CV

Abstract: Adversarial attacks are considered the intrinsic vulnerability of CNNs. Defense strategies designed for attacks have been stuck in the adversarial attack-defense arms race, reflecting the imbalance between attack and defense. Dynamic Defense Framework (DDF) recently changed the passive safety status quo based on the stochastic ensemble model. The diversity of subnetworks, an essential concern in the DDF, can be effectively evaluated by the adversarial transferability between different networks. Inspired by the poor adversarial transferability between subnetworks of scratch tickets with various remaining ratios, we propose a method to realize the dynamic stochastic ensemble defense strategy. We discover the adversarial transferable diversity between robust lottery ticket subnetworks drawn from different basic structures and sparsity. The experimental results suggest that our method achieves better robust and clean recognition accuracy by adversarial transferable diversity, which would decrease the reliability of attacks.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Qi Peng (7 papers)
  2. Wenlin Liu (2 papers)
  3. Ruoxi Qin (5 papers)
  4. Libin Hou (1 paper)
  5. Bin Yan (138 papers)
  6. Linyuan Wang (35 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.