Adversarial attacks for mixtures of classifiers

However, it has been shown that existing attacks are perspective, where the sets are the vulnerability regions of each classifier not well suited for this kind of classifiers. In this paper, we discuss of the mixture. We then show that the problem of attacking a the problem of attacking a mixture in a principled way and introduce mixture can be seen as the problem of exploring a lattice. Using this two desirable properties of attacks based on a geometrical analysis of perspective, we identify a series of desirable properties, and devise a the problem (effectiveness and maximality). We then show that existing new attack that satisfies these properties and is efficient in practice.