Foraging motivation favors the occurrence of Lévy walks

Hybrid foraging in patchy environments using spatial memory

Efficient random searches are essential to the survival of foragers searching for sparsely distributed targets. Lévy walks have been found to optimize the search over a wide range of constraints. When targets are distributed within patches, generating a spatial memory over the detected targets can be beneficial towards optimizing the search efficiency. Because foragers have limited memory, storing each target location separately is unrealistic. Instead, we propose incrementally learning a spatial distribution in favour of memorizing target locations. We demonstrate that an ensemble of Gaussian mixture models is a suitable candidate for such a spatial distribution. Using this, a hybrid foraging strategy is proposed, which interchanges random searches with informed movement. Informed movement results in displacements towards target locations, and is more likely to occur if the learned spatial distribution is correct. We show that, depending on the strength of the memory effects, foragers optimize search efficiencies by continuous revisitation of non-destructive targets. However, this negatively affects both the target and patch diversity, indicating that memory does not necessarily optimize multi-objective searches. Hence, the benefits of memory depend on the specific goals of the forager. Furthermore, through analysis of the distribution over walking distances of the forager, we show that memory changes the underlying walk characteristics. Specifically, the forager resorts to Brownian motion instead of Lévy walks, due to truncation of the long straight line displacements resulting from memory effects. This study provides a framework that opens up new avenues for investigating memory effects on foraging in sparse environments.

Modified Selfish Herd Optimizer for Function Optimization

Selfish herd optimizer (SHO) is a new optimization algorithm. However, its optimization performance is not satisfactory. The main reason for this phenomenon is the weak global search ability of SHO. In this paper, in order to increase the global search ability of SHO, we add Levy-flight distribution strategy. To verify the performance of the proposed algorithm, we use 10 benchmark functions as test cases. Experiment results show that our algorithm is more competitive.

An Information Theoretic Approach to Model Selection: A Tutorial with Monte Carlo Confirmation

A reliance on null hypothesis significance testing (NHST) and misinterpretations of its results are thought to contribute to the replication crisis while impeding the development of a cumulative science. One solution is a data-analytic approach called Information-Theoretic (I-T) Model Selection, which builds upon Maximum Likelihood estimates. In the I-T approach, the scientist examines a set of candidate models and determines for each one the probability that it is the closer to the truth than all others in the set. Although the theoretical development is subtle, the implementation of I-T analysis is straightforward. Models are sorted according to the probability that they are the best in light of the data collected. It encourages the examination of multiple models, something investigators desire and that NHST discourages. This article is structured to address two objectives. The first is to illustrate the application of I-T data analysis to data from a virtual experiment. A noisy delay-discounting data set is generated and seven quantitative models are examined. In the illustration, it is demonstrated that it is not necessary to know the "truth" is to identify the one that is closest to it and that the most likely models conform to the model that generated the data. Second, we examine claims made by advocates of the I-T approach using Monte Carlo simulations in which 10,000 different data sets are generated and analyzed. The simulations showed that 1) the probabilities associated with each model returned by the single virtual experiment approximated those that resulted from the simulations, 2) models that were deemed close to the truth produced the most precise parameter estimates, and 3) adding a single replicate sharpens the ability to identify the most probable model.