Results 1 
4 of
4
Countering Poisonous Inputs with Memetic Neuroevolution
"... Applied to certain problems, neuroevolution frequently gets stuck in local optima with very low fitness; in particular, this is true for some reinforcement learning problems where the input to the controller is a highdimensional and/or illchosen state description. Evidently, some controller inputs ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Applied to certain problems, neuroevolution frequently gets stuck in local optima with very low fitness; in particular, this is true for some reinforcement learning problems where the input to the controller is a highdimensional and/or illchosen state description. Evidently, some controller inputs are “poisonous”, and their inclusion induce such local optima. Previously, we proposed the memetic climber, which evolves neural network topology and weights at different timescales, as a solution to this problem. In this paper, we further explore the memetic climber, and introduce its populationbased counterpart: the memetic ES. We also explore which types of inputs are poisonous for two different reinforcement learning problems.
Particle Swarm Optimization, Attack Scenario, Countermeasure, CostSensitive Attack Graph, Minimization Analysis
, 2009
"... To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider costsensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. Th ..."
Abstract
 Add to MetaCart
(Show Context)
To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider costsensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also, a single countermeasure may prevent multiple exploits. We present a binary particle swarm optimization algorithm with a timevarying velocity clamping, called SwarmCAGTVVC, for minimization analysis of costsensitive attack graphs. The aim is to find a critical set of countermeasures with minimum weight whose implementation causes the initial nodes and the goal nodes of the graph to be completely disconnected. This problem is in fact a constrained optimization problem. A repair method is used to convert the constrained optimization problem into an unconstrained one. A local search heuristic is used to improve the overall performance of the algorithm. We compare the performance of SwarmCAGTVVC with a greedy algorithm GreedyCAG and a genetic algorithm GenNAG for minimization analysis of several largescale costsensitive attack graphs. On average, the weight of a critical set of countermeasures found by SwarmCAGTVVC is 6.15 percent less than the weight of a critical set of countermeasures found by GreedyCAG. Also, SwarmCAGTVVC performs better than GenNAG in terms of convergence speed and accuracy. The results of the experiments show that SwarmCAGTVVC can be successfully used for minimization analysis of largescale costsensitive attack graphs. c ○ 2010 ISC. All rights reserved. 1
Template Method Hyperheuristics
"... The optimization literature is awash with metaphoricallyinspired metaheuristics and their subsequent variants and hybridizations. This results in a plethora of methods, with descriptions that are often polluted with the language of the metaphor which inspired them [8]. Within such a fragmented fie ..."
Abstract
 Add to MetaCart
(Show Context)
The optimization literature is awash with metaphoricallyinspired metaheuristics and their subsequent variants and hybridizations. This results in a plethora of methods, with descriptions that are often polluted with the language of the metaphor which inspired them [8]. Within such a fragmented field, the traditional approach of manual ‘operator tweaking ’ makes it difficult to establish the contribution of individual metaheuristic components to the overall success of a methodology. Irrespective of whether it happens to best the stateoftheart, such ‘tweaking ’ is so labourintensive that does relatively little to advance scientific understanding. In order to introduce further structure and rigour, it is therefore desirable to not only to be able to specify entire families of metaheuristics (rather than individual metaheuristics), but also
CostSensitive Attack Graph, Minimization Analysis
, 2009
"... To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider costsensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. Th ..."
Abstract
 Add to MetaCart
(Show Context)
To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider costsensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also, a single countermeasure may prevent multiple exploits. We present a binary particle swarm optimization algorithm with a timevarying velocity clamping, called SwarmCAGTVVC, for minimization analysis of costsensitive attack graphs. The aim is to find a critical set of countermeasures with minimum weight whose implementation causes the initial nodes and the goal nodes of the graph to be completely disconnected. This problem is in fact a constrained optimization problem. A repair method is used to convert the constrained optimization problem into an unconstrained one. A local search heuristic is used to improve the overall performance of the algorithm. We compare the performance of SwarmCAGTVVC with a greedy algorithm GreedyCAG and a genetic algorithm GenNAG for minimization analysis of several largescale costsensitive attack graphs. On average, the weight of a critical set of countermeasures found by SwarmCAGTVVC is 6.15 percent less than the weight of a critical set of countermeasures found by GreedyCAG. Also, SwarmCAGTVVC performs better than GenNAG in terms of convergence speed and accuracy. The results of the experiments show that SwarmCAGTVVC can be successfully used for minimization analysis of largescale costsensitive attack graphs. c © 2010 ISC. All rights reserved. 1