Xuannan Liu, Weihong Deng, Lixiong Qin, Yuhang Zhang, Yaoyao Zhong
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Deep neural networks are vulnerable to universal adversarial perturbation (UAP), an instance-agnostic perturbation capable of fooling the target model for most samples. Compared to instance-specific adversarial examples, UAP is more challenging as it needs to generalize across various samples and models. In this paper, we examine the serious dilemma of UAP generation methods from a generalization perspective -the gradient vanishing problem using smallbatch stochastic gradient optimization and the local optima problem using large-batch optimization. To address these problems, we propose a simple and effective method called Stochastic Gradient Aggregation (SGA), which alleviates the gradient vanishing and escapes from poor local optima at the same time. Specifically, SGA employs the small-batch training to perform multiple iterations of inner pre-search. Then, all the inner gradients are aggregated as a one-step gradient estimation to enhance the gradient stability and reduce quantization errors. Extensive experiments on the standard ImageNet dataset demonstrate that our method significantly enhances the generalization ability of UAP and outperforms other state-of-the-art methods. The code is available at https://github.com/liuxuannan/ Stochastic-Gradient-Aggregation.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2308.06015")
get_code_for_paper("2308.06015")
have("2308.06015")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2308.06015.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2308.06015)
Connect an agent — have() is free.