In Search of Optimal Linkage Trees

Linkage-learning Evolutionary Algorithms (EAs) use linkage learning to construct a linkage model, which is exploited to solve problems efficiently by taking into account important linkages, i.e. dependencies between problem variables, during variation. It has been shown that when this linkage model is aligned correctly with the structure of the problem, these EAs are capable of solving problems efficiently by performing variation based on this linkage model [2]. The Linkage Tree Genetic Algorithm (LTGA) uses a Linkage Tree (LT) as a linkage model to identify the problem's structure hierarchically, enabling it to solve various problems very efficiently. Understanding the reasons for LTGA's excellent performance is highly valuable as LTGA is also able to efficiently solve problems for which a tree-like linkage model seems inappropriate. This brings us to ask what in fact makes a linkage model ideal for LTGA to be used

Speciation: More Likely through a Genetic or through a Learned Habitat Preference?

A problem in understanding sympatric speciation is establishing how reproductive isolation can arise when there is disruptive selection on an ecological trait. One of the solutions that has been proposed is that a habitat preference evolves, and that mates are chosen within the preferred habitat. We present a model where the habitat preference can evolve either by means of a genetic mechanism or by means of learning. Employing an adaptive-dynamical analysis, we show that evolution proceeds either to a single population of specialists with a genetic preference for their optimal habitat, or to a population of generalists without a habitat preference. The generalist population subsequently experiences disruptive selection. Learning promotes speciation because it increases the intensity of disruptive selection. An individual-based version of the model shows that, when loci are completely unlinked and learning confers little cost, the presence of disruptive selection most likely leads to speciation via the simultaneous evolution of a learned habitat preference. However, the latter only happens when the effect of mutation is large, or when there is linkage between genes coding for the different traits

Interregional propagation of inflationary shocks

Inflation;Models;econometrics

Implementing Observation Protocols: Lessons for K-12 Education From the Field of Early Childhood

Examines issues for implementing standardized observation protocols for teacher evaluations. Makes recommendations based on lessons from preschool, such as the need to show empirical links between teacher performance and student learning and development

GAMBIT: A parameterless model-based evolutionary algorithm for mixed-integer problems

Learning and exploiting problem structure is one of the key challenges in optimization. This is especially important for black-box optimization (BBO) where prior structural knowledge of a problem is not available. Existing model-based Evolutionary Algorithms (EAs) are very efficient at learning structure in both the discrete, and in the continuous domain. In this article, discrete and continuous model-building mechanisms are integrated for the Mixed-Integer (MI) domain, comprising discrete and continuous variables. We revisit a recently introduced model-based evolutionary algorithm for the MI domain, the Genetic Algorithm for Model-Based mixed-Integer opTimization (GAMBIT). We extend GAMBIT with a parameterless scheme that allows for practical use of the algorithm without the need to explicitly specify any parameters. We furthermore contrast GAMBIT with other model-based alternatives. The ultimate goal of processing mixed dependences explicitly in GAMBIT is also addressed by introducing a new mechanism for the explicit exploitation of mixed dependences. We find that processing mixed dependences with this novel mechanism allows for more efficient optimization. We further contrast the parameterless GAMBIT with Mixed-Integer Evolution Strategies (MIES) and other state-of-the-art MI optimization algorithms from the General Algebraic Modeling System (GAMS) commercial algorithm suite on problems with and without constraints, and show that GAMBIT is capable of solving problems where variable dependences prevent many algorithms from successfully optimizing them

Hints

The systematic use of hints in the learning-from-examples paradigm is the subject of this review. Hints are the properties of the target function that are known to us independently of the training examples. The use of hints is tantamount to combining rules and data in learning, and is compatible with different learning models, optimization techniques, and regularization techniques. The hints are represented to the learning process by virtual examples, and the training examples of the target function are treated on equal footing with the rest of the hints. A balance is achieved between the information provided by the different hints through the choice of objective functions and learning schedules. The Adaptive Minimization algorithm achieves this balance by relating the performance on each hint to the overall performance. The application of hints in forecasting the very noisy foreign-exchange markets is illustrated. On the theoretical side, the information value of hints is contrasted to the complexity value and related to the VC dimension

Two-Country Models of Monetary and Fiscal Policy: What Have We Learned? What More Can We Learn?

This paper surveys the literature that uses two-country models to analyze monetary and fiscal policy issues faced in interdependent economies. We discuss sources of structural interdependence that researchers typically include in these models. We describe many of the types of policy interactions that researchers have considered and summarize the key results that they have obtained. Finally, we briefly explain the limitations of two-country models and outline directions that this literature might usefully be extended