Evolution of time preference by natural selection

We reexamine Rogers’ (1994) analysis of the biological basis of the rate of time preference. Although his basic insight concerning the derivation of the felicity function holds up, the functional form he uses does not generate the evolutionary equilibrium behavior. Moreover, Rogers relies upon an interior solution for a particular kind of intergenerational transfer. We show such interior solutions do not generally arise. Hence Rogers most striking prediction, namely that the real interest rate should be about 2% per annum, does not follow

Optimal Relay Selection with Non-negligible Probing Time

In this paper an optimal relay selection algorithm with non-negligible probing time is proposed and analyzed for cooperative wireless networks. Relay selection has been introduced to solve the degraded bandwidth efficiency problem in cooperative communication. Yet complete information of relay channels often remain unavailable for complex networks which renders the optimal selection strategies impossible for transmission source without probing the relay channels. Particularly when the number of relay candidate is large, even though probing all relay channels guarantees the finding of the best relays at any time instant, the degradation of bandwidth efficiency due to non-negligible probing times, which was often neglected in past literature, is also significant. In this work, a stopping rule based relay selection strategy is determined for the source node to decide when to stop the probing process and choose one of the probed relays to cooperate with under wireless channels' stochastic uncertainties. This relay selection strategy is further shown to have a simple threshold structure. At the meantime, full diversity order and high bandwidth efficiency can be achieved simultaneously. Both analytical and simulation results are provided to verify the claims.Comment: 8 pages. ICC 201

Time-based selection in complex displays : visual marking does not occur in multi-element asynchronous dynamic (MAD) search

In visual search, a preview benefit occurs when half of the distractor items (the preview set) are presented before the remaining distractor items and the target (the search set). Separating the display across time allows participants to prioritize the search set, leading to increased search efficiency. To date, such time-based selection has been examined using relatively simple types of search displays. However, recent research has shown that when displays better mimic real-world scenes by including a combination of stationary, moving and luminance-changing items (Multi-element Asynchronous Dynamic [MAD] displays), previous search principles reported in the literature no longer apply. In the current work, we examined time-base selection in MAD search conditions. Overall the findings illustrated an advantage for processing new items based on overall RTs but no advantage in terms of search rates. In the absence of a speed–accuracy trade-off no preview benefit emerged when using more complex MAD stimuli

Identifying Signatures of Selection in Genetic Time Series

Both genetic drift and natural selection cause the frequencies of alleles in a population to vary over time. Discriminating between these two evolutionary forces, based on a time series of samples from a population, remains an outstanding problem with increasing relevance to modern data sets. Even in the idealized situation when the sampled locus is independent of all other loci this problem is difficult to solve, especially when the size of the population from which the samples are drawn is unknown. A standard $\chi^2$-based likelihood ratio test was previously proposed to address this problem. Here we show that the $\chi^2$ test of selection substantially underestimates the probability of Type I error, leading to more false positives than indicated by its $P$-value, especially at stringent $P$-values. We introduce two methods to correct this bias. The empirical likelihood ratio test (ELRT) rejects neutrality when the likelihood ratio statistic falls in the tail of the empirical distribution obtained under the most likely neutral population size. The frequency increment test (FIT) rejects neutrality if the distribution of normalized allele frequency increments exhibits a mean that deviates significantly from zero. We characterize the statistical power of these two tests for selection, and we apply them to three experimental data sets. We demonstrate that both ELRT and FIT have power to detect selection in practical parameter regimes, such as those encountered in microbial evolution experiments. Our analysis applies to a single diallelic locus, assumed independent of all other loci, which is most relevant to full-genome selection scans in sexual organisms, and also to evolution experiments in asexual organisms as long as clonal interference is weak. Different techniques will be required to detect selection in time series of co-segregating linked loci.Comment: 24 pages, 6 figures, 4 tables, 7 supplementary figures and table

Linear Time Feature Selection for Regularized Least-Squares

We propose a novel algorithm for greedy forward feature selection for regularized least-squares (RLS) regression and classification, also known as the least-squares support vector machine or ridge regression. The algorithm, which we call greedy RLS, starts from the empty feature set, and on each iteration adds the feature whose addition provides the best leave-one-out cross-validation performance. Our method is considerably faster than the previously proposed ones, since its time complexity is linear in the number of training examples, the number of features in the original data set, and the desired size of the set of selected features. Therefore, as a side effect we obtain a new training algorithm for learning sparse linear RLS predictors which can be used for large scale learning. This speed is possible due to matrix calculus based short-cuts for leave-one-out and feature addition. We experimentally demonstrate the scalability of our algorithm and its ability to find good quality feature sets.Comment: 17 pages, 15 figure

Fake Run-Time Selection of Template Arguments in C++

C++ does not support run-time resolution of template type arguments. To circumvent this restriction, we can instantiate a template for all possible combinations of type arguments at compile time and then select the proper instance at run time by evaluation of some provided conditions. However, for templates with multiple type parameters such a solution may easily result in a branching code bloat. We present a template metaprogramming algorithm called for_id that allows the user to select the proper template instance at run time with theoretical minimum sustained complexity of the branching code.Comment: Objects, Models, Components, Patterns (50th International Conference, TOOLS 2012

Continuous-time Mean-Variance Portfolio Selection with Stochastic Parameters

This paper studies a continuous-time market {under stochastic environment} where an agent, having specified an investment horizon and a target terminal mean return, seeks to minimize the variance of the return with multiple stocks and a bond. In the considered model firstly proposed by [3], the mean returns of individual assets are explicitly affected by underlying Gaussian economic factors. Using past and present information of the asset prices, a partial-information stochastic optimal control problem with random coefficients is formulated. Here, the partial information is due to the fact that the economic factors can not be directly observed. Via dynamic programming theory, the optimal portfolio strategy can be constructed by solving a deterministic forward Riccati-type ordinary differential equation and two linear deterministic backward ordinary differential equations

On mathematical theory of selection: Continuous time population dynamics

Mathematical theory of selection is developed within the frameworks of general models of inhomogeneous populations with continuous time. Methods that allow us to study the distribution dynamics under natural selection and to construct explicit solutions of the models are developed. All statistical characteristics of interest, such as the mean values of the fitness or any trait can be computed effectively, and the results depend in a crucial way on the initial distribution. The developed theory provides an effective method for solving selection systems; it reduces the initial complex model to a special system of ordinary differential equations (the escort system). Applications of the method to the Price equations are given; the solutions of some particular inhomogeneous Malthusian, Ricker and logistic-like models used but not solved in the literature are derived in explicit form.Comment: 29 pages; published in J. of Mathematical Biolog