No abstract

No abstract

No abstract

Deep neural networks can now perform many tasks that were once thought to be only feasible for humans. Unfortunately, while reaching impressive performance under standard settings, such networks are known to be susceptible to adversarial attacks -slight but carefully constructed perturbations of the inputs which drastically decrease the network performance and reduce their trustworthiness. Here we propose to improve network robustness to input perturbations via an adversarial training procedure which we call Adversarial Feature Desensitization (AFD). We augment the normal supervised training with an adversarial game between the embedding network and an additional adversarial decoder which is trained to discriminate between the clean and perturbed inputs from their high-level embeddings. Our theoretical and empirical evidence acknowledges the effectiveness of this approach in learning robust features on MNIST, CIFAR10, and CIFAR100 datasets -substantially improving the state-of-the-art in robust classification against previously observed adversarial attacks. More importantly, we demonstrate that AFD has better generalization ability than previous methods, as the learned features maintain their robustness against a large range of perturbations, including perturbations not seen during training. These results indicate that reducing feature sensitivity using adversarial training is a promising approach for ameliorating the problem of adversarial attacks in deep neural networks.Preprint. Under review.

Dynamic service composition techniques are beneficial for better design, implementation, and deployment of distributed applications. These techniques address the complexity that comes with the significant growth of the number of web services on the Internet and their constantly changing adaptation requirements. However, the previous approaches do not provide a mechanism for a flexible adaptation or re-composition when availability is not the only requirement. There are other business-level or servicelevel requirement specifications that can be introduced at any time by business or system administrators. These requirements could be business or quality rules, which may adversely affect web service composition (WSC) without changing the definitions of the Web Services' specification (i.e., WSDL, SAWSDL) nor their availability. In this paper we define a new context-oriented graph planning policy-based architecture for dynamic web service composition, and a prototype implementation.