TensorX
返回文献探索

Paper · arXiv 2401.14953

Learning Universal Predictors

Jordi Grau-Moya, Tim Genewein, Marcus Hutter, Laurent Orseau, Grégoire Delétang, Elliot Catt, Anian Ruoss, Li Kevin Wenliang, Christopher Mattern, Matthew Aitchison, Joel Veness

22 upvotesJanuary 26, 2024arXiv 预印本
AI 摘要

Meta-learning can leverage Universal Turing Machine-generated data to train neural networks for universal prediction strategies.

Meta-learningSolomonoff InductionUniversal Turing MachinesLSTMsTransformersUniversal prediction strategies

Abstract

Meta-learning has emerged as a powerful approach to train neural networks to learn new tasks quickly from limited data. Broad exposure to different tasks leads to versatile representations enabling general problem solving. But, what are the limits of meta-learning? In this work, we explore the potential of amortizing the most powerful universal predictor, namely Solomonoff Induction (SI), into neural networks via leveraging meta-learning to its limits. We use Universal Turing Machines (UTMs) to generate training data used to expose networks to a broad range of patterns. We provide theoretical analysis of the UTM data generation processes and meta-training protocols. We conduct comprehensive experiments with neural architectures (e.g. LSTMs, Transformers) and algorithmic data generators of varying complexity and universality. Our results suggest that UTM data is a valuable resource for meta-learning, and that it can be used to train neural networks capable of learning universal prediction strategies.

北京市昌平区探索星信息技术及软件开发工作室

京ICP备2026059466号
Learning Universal Predictors | TensorX