首页> 外文会议>Machinee learning >Learning with Inscrutable Theories
【24h】

Learning with Inscrutable Theories

机译:难以理解的理论学习

获取原文
获取原文并翻译 | 示例

摘要

This paper addresses the problem of learning problem solving knowledge when the domain theory of the learning system is inscrutable, i.e., not represented declaratively. We draw the following conclusions: First, although most of the algorithms and methods investigated in Explanation-Based Learning (EBL) literature assume declarative theories, at least in some domains, similar speedups can be achieved by simpler techniques that do not make this assumption. Second, learning with inscrutable theories blurs the distinction between "empirical" and "explanation-based" methods, both of which can be viewed as implementing some form of bias in their algorithms. Third, the utility problem is best addressed by implementing a bias that exploits the structure of the domain. We support our conclusions with experiments in the Eight Puzzle domain.
机译:本文讨论了在学习系统的领域理论难以理解(即不以声明方式表示)时学习解决问题的知识的问题。我们得出以下结论:首先,尽管基于解释学习(EBL)文献中研究的大多数算法和方法都采用了声明性理论,至少在某些领域中,可以通过不采用此假设的简单技术来实现类似的加速。其次,难以理解的理论学习模糊了“经验”和“基于解释”方法之间的区别,这两种方法都可以视为在其算法中实现了某种形式的偏差。第三,通过实施利用领域结构的偏差可以最好地解决效用问题。我们通过在“八拼图”领域进行的实验来支持我们的结论。

著录项

  • 来源
    《Machinee learning》|1991年|544-548|共5页
  • 会议地点 Evanston IL(US);Evanston IL(US)
  • 作者

    Prasad Tadepalli;

  • 作者单位

    Department of Computer Science Oregon State University Corvallis, OR 97331-3202;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 计算机的应用;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号