LGAIMLAug 19, 2019

Intrinsically Motivated Discovery of Diverse Patterns in Self-Organizing Systems

arXiv:1908.06663v330 citations
AI Analysis

This work addresses the challenge of automating pattern discovery in self-organizing systems for researchers in complex systems and AI, though it is incremental as it adapts existing algorithms to a new application area.

The paper tackles the problem of automated discovery of diverse self-organized patterns in complex dynamical systems like cellular automata, which previously relied on manual tuning and human identification. It shows that intrinsically-motivated machine learning algorithms, adapted and extended with deep auto-encoders and CPPN primitives, can achieve efficiency comparable to systems pre-trained on human-expert databases.

In many complex dynamical systems, artificial or natural, one can observe self-organization of patterns emerging from local rules. Cellular automata, like the Game of Life (GOL), have been widely used as abstract models enabling the study of various aspects of self-organization and morphogenesis, such as the emergence of spatially localized patterns. However, findings of self-organized patterns in such models have so far relied on manual tuning of parameters and initial states, and on the human eye to identify interesting patterns. In this paper, we formulate the problem of automated discovery of diverse self-organized patterns in such high-dimensional complex dynamical systems, as well as a framework for experimentation and evaluation. Using a continuous GOL as a testbed, we show that recent intrinsically-motivated machine learning algorithms (POP-IMGEPs), initially developed for learning of inverse models in robotics, can be transposed and used in this novel application area. These algorithms combine intrinsically-motivated goal exploration and unsupervised learning of goal space representations. Goal space representations describe the interesting features of patterns for which diverse variations should be discovered. In particular, we compare various approaches to define and learn goal space representations from the perspective of discovering diverse spatially localized patterns. Moreover, we introduce an extension of a state-of-the-art POP-IMGEP algorithm which incrementally learns a goal representation using a deep auto-encoder, and the use of CPPN primitives for generating initialization parameters. We show that it is more efficient than several baselines and equally efficient as a system pre-trained on a hand-made database of patterns identified by human experts.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes