Quantifying the Impact of Parameter Tuning on Nature-Inspired Algorithms

The problem of parameterization is often central to the effective deployment of nature-inspired algorithms. However, finding the optimal set of parameter values for a combination of problem instance and solution method is highly challenging, and few concrete guidelines exist on how and when such tuning may be performed. Previous work tends to either focus on a specific algorithm or use benchmark problems, and both of these restrictions limit the applicability of any findings. Here, we examine a number of different algorithms, and study them in a "problem agnostic" fashion (i.e., one that is not tied to specific instances) by considering their performance on fitness landscapes with varying characteristics. Using this approach, we make a number of observations on which algorithms may (or may not) benefit from tuning, and in which specific circumstances.Comment: 8 pages, 7 figures. Accepted at the European Conference on Artificial Life (ECAL) 2013, Taormina, Ital

Structured populations with distributed recruitment: from PDE to delay formulation

In this work first we consider a physiologically structured population model with a distributed recruitment process. That is, our model allows newly recruited individuals to enter the population at all possible individual states, in principle. The model can be naturally formulated as a first order partial integro-differential equation, and it has been studied extensively. In particular, it is well-posed on the biologically relevant state space of Lebesgue integrable functions. We also formulate a delayed integral equation (renewal equation) for the distributed birth rate of the population. We aim to illustrate the connection between the partial integro-differential and the delayed integral equation formulation of the model utilising a recent spectral theoretic result. In particular, we consider the equivalence of the steady state problems in the two different formulations, which then leads us to characterise irreducibility of the semigroup governing the linear partial integro-differential equation. Furthermore, using the method of characteristics, we investigate the connection between the time dependent problems. In particular, we prove that any (non-negative) solution of the delayed integral equation determines a (non-negative) solution of the partial differential equation and vice versa. The results obtained for the particular distributed states at birth model then lead us to present some very general results, which establish the equivalence between a general class of partial differential and delay equation, modelling physiologically structured populations.Comment: 28 pages, to appear in Mathematical Methods in the Applied Science

Hybridizing Invasive Weed Optimization with Firefly Algorithm for Unconstrained and Constrained Optimization Problems

This study presents a hybrid invasive weed firefly optimization (HIWFO) algorithm for global optimization problems. Unconstrained and constrained optimization problems with continuous design variables are used to illustrate the effectiveness and robustness of the proposed algorithm. The firefly algorithm (FA is effective in local search, but can easily get trapped in local optima. The invasive weed optimization (IWO) algorithm, on the other hand, is effective in accurate global search, but not in local search. Therefore, the idea of hybridization between IWO and FA is to achieve a more robust optimization technique, especially to compensate for the deficiencies of the individual algorithms. In the proposed algorithm, the firefly method is embedded into IWO to enhance the local search capability of IWO algorithm that already has very good exploration capability. The performance of the proposed method is assessed with four well-known unconstrained problems and four practical constrained problems. Comparative assessments of performance of the proposed algorithm with the original FA and IWO are carried out on the unconstrained problems and with several other hybrid methods reported in the literature on the practical constrained problems, to illustrate its effectiveness. Simulation results show that the proposed HIWFO algorithm h as superior searching quality and robustness than the approaches considered

The state of MIIND

MIIND (Multiple Interacting Instantiations of Neural Dynamics) is a highly modular multi-level C++ framework, that aims to shorten the development time for models in Cognitive Neuroscience (CNS). It offers reusable code modules (libraries of classes and functions) aimed at solving problems that occur repeatedly in modelling, but tries not to impose a specific modelling philosophy or methodology. At the lowest level, it offers support for the implementation of sparse networks. For example, the library SparseImplementationLib supports sparse random networks and the library LayerMappingLib can be used for sparse regular networks of filter-like operators. The library DynamicLib, which builds on top of the library SparseImplementationLib, offers a generic framework for simulating network processes. Presently, several specific network process implementations are provided in MIIND: the Wilson–Cowan and Ornstein–Uhlenbeck type, and population density techniques for leaky-integrate-and-fire neurons driven by Poisson input. A design principle of MIIND is to support detailing: the refinement of an originally simple model into a form where more biological detail is included. Another design principle is extensibility: the reuse of an existing model in a larger, more extended one. One of the main uses of MIIND so far has been the instantiation of neural models of visual attention. Recently, we have added a library for implementing biologically-inspired models of artificial vision, such as HMAX and recent successors. In the long run we hope to be able to apply suitably adapted neuronal mechanisms of attention to these artificial models

Beyond LIF neurons on neuromorphic hardware

Neuromorphic systems aim to provide accelerated low-power simulation of Spiking Neural Networks (SNNs), typically featuring simple and efficient neuron models such as the Leaky Integrate-and-Fire (LIF) model. Biologically plausible neuron models developed by neuroscientists are largely ignored in neuromorphic computing due to their increased computational costs. This work bridges this gap through implementation and evaluation of a single compartment Hodgkin-Huxley (HH) neuron and a multi-compartment neuron incorporating dendritic computation on the SpiNNaker, and SpiNNaker2 prototype neuromorphic systems. Numerical accuracy of the model implementations is benchmarked against reference models in the NEURON simulation environment, with excellent agreement achieved by both the fixed- and floating-point SpiNNaker implementations. The computational cost is evaluated in terms of timing measurements profiling neural state updates. While the additional model complexity understandably increases computation times relative to LIF models, it was found a wallclock time increase of only 8× was observed for the HH neuron (11× for the mutlicompartment model), demonstrating the potential of hardware accelerators in the next-generation neuromorphic system to optimize implementation of complex neuron models. The benefits of models directly corresponding to biophysiological data are demonstrated: HH neurons are able to express a range of output behaviors not captured by LIF neurons; and the dendritic compartment provides the first implementation of a spiking multi-compartment neuron model with XOR-solving capabilities on neuromorphic hardware. The work paves the way for inclusion of more biologically representative neuron models in neuromorphic systems, and showcases the benefits of hardware accelerators included in the next-generation SpiNNaker2 architecture