876 research outputs found

    Mean-Field Theory of Meta-Learning

    Full text link
    We discuss here the mean-field theory for a cellular automata model of meta-learning. The meta-learning is the process of combining outcomes of individual learning procedures in order to determine the final decision with higher accuracy than any single learning method. Our method is constructed from an ensemble of interacting, learning agents, that acquire and process incoming information using various types, or different versions of machine learning algorithms. The abstract learning space, where all agents are located, is constructed here using a fully connected model that couples all agents with random strength values. The cellular automata network simulates the higher level integration of information acquired from the independent learning trials. The final classification of incoming input data is therefore defined as the stationary state of the meta-learning system using simple majority rule, yet the minority clusters that share opposite classification outcome can be observed in the system. Therefore, the probability of selecting proper class for a given input data, can be estimated even without the prior knowledge of its affiliation. The fuzzy logic can be easily introduced into the system, even if learning agents are build from simple binary classification machine learning algorithms by calculating the percentage of agreeing agents.Comment: 23 page

    The Role Of The Interaction Network In The Emergence Of Diversity Of Behavior

    Get PDF
    Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)How can systems in which individuals' inner workings are very similar to each other, as neural networks or ant colonies, produce so many qualitatively different behaviors, giving rise to roles and specialization? In this work, we bring new perspectives to this question by focusing on the underlying network that defines how individuals in these systems interact. We applied a genetic algorithm to optimize rules and connections of cellular automata in order to solve the density classification task, a classical problem used to study emergent behaviors in decentralized computational systems. The networks used were all generated by the introduction of shortcuts in an originally regular topology, following the Small-world model. Even though all cells follow the exact same rules, we observed the existence of different classes of cells' behaviors in the best cellular automata found D most cells were responsible for memory and others for integration of information. Through the analysis of structural measures and patterns of connections (motifs) in successful cellular automata, we observed that the distribution of shortcuts between distant regions and the speed in which a cell can gather information from different parts of the system seem to be the main factors for the specialization we observed, demonstrating how heterogeneity in a network can create heterogeneity of behavior.122Conselho Nacional de Desenvolvimento Cientifico e Tecnologico [142118/2010-9]Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq

    Cellular Automata based Artificial Financial Market

    Get PDF

    A Two-Dimensional Simulation of Grain Structure Growth within Substrate and Fusion Zone during Direct Metal Deposition

    Get PDF
    In this chapter, a predictive multiscale model based on a cellular automaton (CA)-finite element (FE) method has been developed to simulate thermal history and microstructure evolution during metal solidification for direct metal deposition (DMD) process. The macroscopic FE calculation that is validated by the thermocouple experiment is developed to simulate the transient temperature field and cooling rate of single layer and multiple layers. In order to integrate the different scales, a CA-FE coupled model is developed to combine with thermal history and simulate grain growth. In the mesoscopic CA model, heterogeneous nucleation sites, grain growth orientation and rate, epitaxial growth, remelting of preexisting grains, metal addition, grain competitive growth and columnar to equiaxed phenomena are simulated. The CA model is able to show the entrapment of neighboring cells and the relationship between undercooling and the grain growth rate. The model predicts the grain size and morphological evolution during the solidification phase of the deposition process. The developed “decentered polygon” growth algorithm is appropriate for the nonuniform temperature field. Finally, the single- and multiple-layer DMD experiments are conducted to validate the characteristics of grain features in the simulation

    Optimal Self-Organization

    Full text link
    We present computational and analytical results indicating that systems of driven entities with repulsive interactions tend to reach an optimal state associated with minimal interaction and minimal dissipation. Using concepts from non-equilibrium thermodynamics and game theoretical ideas, we generalize this finding to an even wider class of self-organizing systems which have the ability to reach a state of maximal overall ``success''. This principle is expected to be relevant for driven systems in physics like sheared granular media, but it is also applicable to biological, social, and economic systems, for which only a limited number of quantitative principles are available yet.Comment: This is the detailled revised version of a preprint on ``Self-Organised Optimality'' (cond-mat/9903319). For related work see http://www.theo2.physik.uni-stuttgart.de/helbing.html and http://angel.elte.hu/~vicsek
    corecore