Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Black-box Adversarial Attacks with Bayesian Optimization (1909.13857v1)

Published 30 Sep 2019 in cs.LG and stat.ML

Abstract: We focus on the problem of black-box adversarial attacks, where the aim is to generate adversarial examples using information limited to loss function evaluations of input-output pairs. We use Bayesian optimization~(BO) to specifically cater to scenarios involving low query budgets to develop query efficient adversarial attacks. We alleviate the issues surrounding BO in regards to optimizing high dimensional deep learning models by effective dimension upsampling techniques. Our proposed approach achieves performance comparable to the state of the art black-box adversarial attacks albeit with a much lower average query count. In particular, in low query budget regimes, our proposed method reduces the query count up to $80\%$ with respect to the state of the art methods.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Satya Narayan Shukla (17 papers)
  2. Anit Kumar Sahu (35 papers)
  3. Devin Willmott (11 papers)
  4. J. Zico Kolter (151 papers)
Citations (30)

Summary

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