combi
A Model-Based Derivative-Free Approach to Black-Box Adversarial Examples: BOBYQA
Ughi, Giuseppe, Abrol, Vinayak, Tanner, Jared
We demonstrate that model-based derivative free optimisation algorithms can generate adversarial targeted misclassification of deep networks using fewer network queries than non-model-based methods. Specifically, we consider the black-box setting, and show that the number of networks queries is less impacted by making the task more challenging either through reducing the allowed $\ell^{\infty}$ perturbation energy or training the network with defences against adversarial misclassification. We illustrate this by contrasting the BOBYQA algorithm with the state-of-the-art model-free adversarial targeted misclassification approaches based on genetic, combinatorial, and direct-search algorithms. We observe that for high $\ell^{\infty}$ energy perturbations on networks, the aforementioned simpler model-free methods require the fewest queries. In contrast, the proposed BOBYQA based method achieves state-of-the-art results when the perturbation energy decreases, or if the network is trained against adversarial perturbations.
- North America > Canada > Ontario > Toronto (0.14)
- Europe > Austria > Vienna (0.14)
- Asia (0.04)
- (3 more...)
- Transportation > Air (0.64)
- Information Technology > Security & Privacy (0.46)
Conditional Simple Temporal Networks with Uncertainty and Resources
Combi, Carlo, Posenato, Roberto, Viganò, Luca, Zavatteri, Matteo
Conditional simple temporal networks with uncertainty (CSTNUs) allow for the representation of temporal plans subject to both conditional constraints and uncertain durations. Dynamic controllability (DC) of CSTNUs ensures the existence of an execution strategy able to execute the network in real time (i.e., scheduling the time points under control) depending on how these two uncontrollable parts behave. However, CSTNUs do not deal with resources. In this paper, we define conditional simple temporal networks with uncertainty and resources (CSTNURs) by injecting resources and runtime resource constraints (RRCs) into the specification. Resources are mandatory for executing the time points and their availability is represented through temporal expressions, whereas RRCs restrict resource availability by further temporal constraints among resources. We provide a fully-automated encoding to translate any CSTNUR into an equivalent timed game automaton in polynomial time for a sound and complete DC-checking.
- Europe > United Kingdom (0.27)
- Africa > Middle East > Egypt > Cairo Governorate > Cairo (0.04)
- Europe > Italy (0.04)
- (2 more...)
- Transportation > Air (0.92)
- Information Technology (0.68)
- Government (0.67)
- Law (0.67)