首页> 美国卫生研究院文献>Frontiers in Psychology >PowerPlay: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem
【2h】

PowerPlay: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem

机译:PowerPlay:通过不断搜索最简单但仍无法解决的问题来训练越来越多的一般问题解决方案

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful behavior of animals and humans, to train a more and more general problem solver from scratch in an unsupervised fashion. Consider the infinite set of all computable descriptions of tasks with possibly computable solutions. Given a general problem-solving architecture, at any given time, the novel algorithmic framework PowerPlay (Schmidhuber, ) searches the space of possible pairs of new tasks and modifications of the current problem solver, until it finds a more powerful problem solver that provably solves all previously learned tasks plus the new one, while the unmodified predecessor does not. Newly invented tasks may require to achieve a wow-effect by making previously learned skills more efficient such that they require less time and space. New skills may (partially) re-use previously learned skills. The greedy search of typical PowerPlay variants uses time-optimal program search to order candidate pairs of tasks and solver modifications by their conditional computational (time and space) complexity, given the stored experience so far. The new task and its corresponding task-solving skill are those first found and validated. This biases the search toward pairs that can be described compactly and validated quickly. The computational costs of validating new tasks need not grow with task repertoire size. Standard problem solver architectures of personal computers or neural networks tend to generalize by solving numerous tasks outside the self-invented training set; PowerPlay’s ongoing search for novelty keeps breaking the generalization abilities of its present solver. This is related to Gödel’s sequence of increasingly powerful formal theories based on adding formerly unprovable statements to the axioms without affecting previously provable theorems. The continually increasing repertoire of problem-solving procedures can be exploited by a parallel search for solutions to additional externally posed tasks. PowerPlay may be viewed as a greedy but practical implementation of basic principles of creativity (Schmidhuber, , ). A first experimental analysis can be found in separate papers (Srivastava et al., ,, ).
机译:大多数计算机科学专注于自动解决给定的计算问题。我专注于以受动物和人类嬉戏行为启发的方式自动发明或发现问题,以无人值守的方式从头开始训练越来越多的一般问题解决者。考虑任务的所有可计算描述的无限集合以及可能的可计算解决方案。给定一个通用的问题解决架构,在任何给定时间,新颖的算法框架PowerPlay(Schmidhuber,)都会搜索可能的成对新任务和对当前问题解决者的修改的空间,直到找到可以证明可解决的更强大的问题解决者所有先前学习的任务以及新任务,而未经修改的前任则没有。新发明的任务可能需要通过提高以前学习的技能的效率来达到惊人的效果,从而使他们需要更少的时间和空间。新技能可能(部分)重用以前学习的技能。鉴于到目前为止的存储经验,对典型PowerPlay变体的贪婪搜索使用时间最优程序搜索来按任务的候选对和求解器修改的条件计算(时间和空间)复杂性对它们进行排序。新任务及其相应的任务解决能力是最先发现和验证的。这会使搜索偏向可以紧凑描述并快速验证的对。验证新任务的计算成本不必随任务库大小的增长而增加。个人计算机或神经网络的标准问题解决方案体系结构倾向于通过解决自我发明的训练集之外的许多任务来推广。 PowerPlay不断寻求新颖性,这打破了其现有求解器的泛化能力。这与哥德尔的一系列日益强大的形式理论有关,这些形式理论的基础是在公理中添加以前无法证明的陈述,而不影响以前可以证明的定理。通过并行搜索其他外部任务的解决方案,可以利用不断增加的解决问题的方法。 PowerPlay可以看作是对创造力基本原则的贪婪但实际的实现(Schmidhuber,,)。可以在单独的论文中找到第一个实验分析(Srivastava等,,,)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号