Goto

Collaborating Authors

 Deep Learning






Amortized Projection Optimization for Sliced Wasserstein Generative Models

Neural Information Processing Systems

However, finding these directions usually requires an iterative optimization procedure over the space of projecting directions, which is computationally expensive. Moreover, the computational issue is even more severe in deep learning applications, where computing the distance between two mini-batch probability measures is repeated several times.





Supplementary material for "GAMA: Generative Adversarial Multi-Object Scene Attacks "

Neural Information Processing Systems

We also demonstrate GAMA's transfer attack strength in comparison to prior methods under difficult black-box transfer attacks including in different multi-label distribution, object detection, and robustness of This can be seen in above embedding visualizations where GAMA's Surrogate and victim models are given in parenthesis. As can be seen in Table 3 and Table 4 (ensemble denoted as All), we do not observe any significant advantage in results when using multiple surrogates. GAMA is better than prior methods even when the victim pre-processes the perturbed image. We evaluated CLIP (as a "zero-shot prediction" model) on the perturbed images from Pascal-VOC and computed the top two associated labels in Figure 2 using CLIP's image-text aligning property. Pascal-VOC and computed the top-2 associated labels both for clean and perturbed images.