On the potential for open-endedness in neural networks
arXiv:1812.04907
Abstract
Natural evolution gives the impression of leading to an open-ended process of increasing diversity and complexity. If our goal is to produce such open-endedness artificially, this suggests an approach driven by evolutionary metaphor. On the other hand, techniques from machine learning and artificial intelligence are often considered too narrow to provide the sort of exploratory dynamics associated with evolution. In this paper, we hope to bridge that gap by reviewing common barriers to open-endedness in the evolution-inspired approach and how they are dealt with in the evolutionary case - collapse of diversity, saturation of complexity, and failure to form new kinds of individuality. We then show how these problems map onto similar issues in the machine learning approach, and discuss how the same insights and solutions which alleviated those barriers in evolutionary approaches can be ported over. At the same time, the form these issues take in the machine learning formulation suggests new ways to analyze and resolve barriers to open-endedness. Ultimately, we hope to inspire researchers to be able to interchangeably use evolutionary and gradient-descent-based machine learning methods to approach the design and creation of open-ended systems.
arXiv comment17 pages, 6 figures; Final author version accepted for publication in Artificial Life
References in corpus (18)
- Neural Architecture Search with Reinforcement Learning
- Understanding deep learning requires rethinking generalization
- AutoAugment: Learning Augmentation Policies from Data
- Unrolled Generative Adversarial Networks
- Count-Based Exploration with Neural Density Models
- One-Shot Visual Imitation Learning via Meta-Learning
- Exploration by Random Network Distillation
- Mode Regularized Generative Adversarial Networks
- Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks
- Thinking Fast and Slow with Deep Learning and Tree Search
- Emergent Complexity via Multi-Agent Competition
- Implicit Regularization in Deep Learning
- Machine Theory of Mind
- Meta-Learning by the Baldwin Effect
- Time-Agnostic Prediction: Predicting Predictable Video Frames
- Cascade of Complexity in Evolving Predator-Prey Dynamics
- Boredom-driven curious learning by Homeo-Heterostatic Value Gradients
- Learning to Learn Neural Networks