text:   search",4,"['Excited to share our new black-box attack based on simple *random search*! Despite its simplicity it outperforms the recent SOTA by several times in terms of query efficiency.\nThere are some interesting ideas behind\nPaper: <LINK>\nCode: <LINK>\n1/n <LINK>', 'We use the simplest form of random search from 1960s. The only thing we modify is the sampling distribution. We select it in a way so that each iterate always stays at the boundary of the feasible set. This simple idea significantly improves query efficiency. \n2/n https://t.co/lVQWsJkQCx', 'As a result, the Square Attack outperforms all existing methods by a large margin with a simple random search scheme. The attack achieves both best query efficiency (*2x - 7x better*, depending on the model) and success rate (also in the low-query regime) on ImageNet.\n3/n https://t.co/7MVi0QULBb', 'Square Attack is also useful for robustness evaluation of new defenses. There are cases (post-averaging, CLP, LSQ models) where it can significantly outperform even white-box PGD attack *with random restarts*. Thus, we recommend to use it to prevent false robustness claims.\n4/n https://t.co/ZCMbLlQiWT']",19,12,1090