资源分类
》 资源 》论文》Learning Partially Observable Models Using Temporally Abstract Decision Trees

Learning Partially Observable Models Using Temporally Abstract Decision Trees

2020-01-13 | |  65 |   53 |   0

Abstract

This paper introduces timeline trees, which are partial models of partially observable environments. Timeline trees are given some specific predictions to make and learn a decision tree over history. The main idea of timeline trees is to use temporally abstract features to identify and split on features of key events, spread arbitrarily far apart in the past (whereas previous decision-tree-based methods have been limited to a finite suffix of history). Experiments demonstrate that timeline trees can learn to make high quality predictions in complex, partially observable environments with high-dimensional observations (e.g. an arcade game).

上一篇：Active Learning of Multi-Index Function Models Hemant Tyagi and Volkan Cevher

下一篇：Volume Regularization for Binary Classification

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Joint Pose and Ex...

    Facial expression recognition (FER) is a challe...