Reinforcement Learning Trees

Summary

Two new reinforcement learning algorithms are presented that use a binary tree to store simple local models in the leaf nodes and coarser global models towards the root.

Keywords

Reinforcement learning, Reinforcement, Tree (set theory), Computer science, Artificial intelligence

References

Perceptron Trees: A Case Study In Hybrid Concept RepresentationsPaul E. Utgoff — 1988
A Binary Competition Tree for Reinforcement LearningMagnus Borga, Hans Knutsson — 1994
Behavior Representation by Growing a Learning TreeTomas Landelius — 1993
Problems in the Analysis of Survey Data, and a ProposalJames N. Morgan, John A. Sonquist — 1963
Representation and learning of invarianceKlas Nordberg, Goesta H. Granlund, Hans Knutsson — 1994
Simulation techniques for discrete event systemsBob O'Keefe, Isi Mitrani — 1983
Representing Local Structure Using TensorsH. Knutsson — 1989

Cited by

Forêts aléatoires et sélection de variables : analyse des données des enregistreurs de vol pour la sécurité aérienneBaptiste Gregorutti — 2015
Random Forests and Kernel MethodsErwan Scornet — 2015
Grouped variable importance with random forests and application to multiple functional data analysisBaptiste Gregorutti, Bertrand Michel, Philippe Pierre — 2014
Consistency of Random ForestsErwan Scornet, Gérard Biau, Jean‐Philippe Vert — 2014
Learning multidimensional signal processingHans Knutsson, Magnus Borga, Tomas Landelius — 1998
Correlation and variable importance in random forestsBaptiste Gregorutti, Bertrand Michel, Philippe Pierre — 2013
A computationally fast variable importance test for random forests for high-dimensional dataSilke Janitza, Ender Celik, Anne‐Laure Boulesteix — 2015
Quantifying Uncertainty in Random Forests via Confidence Intervals and Hypothesis TestsLucas Mentch, Giles Hooker — 2014
Estimation and Inference of Heterogeneous Treatment Effects using Random ForestsStefan Wager, Susan Athey — 2015
A random forest guided tourGérard Biau, Erwan Scornet — 2015
On the asymptotics of random forestsErwan Scornet — 2014
Learning with random forestsErwan Scornet — 2015
Tree-based methods for survival analysis and high-dimensional dataRuoqing Zhu — 2013
A Statistical Approach to Topological Data AnalysisBertrand Michel — 2015
Do little interactions get lost in dark random forests?Marvin N. Wright, Andreas Ziegler, Inke R. König — 2016
Fuzzy Forests: Extending Random Forests for Correlated, High-Dimensional DataDaniel Conn, Tuck Ngun, Gang Li — 2015
Genome-wide prediction using Bayesian additive regression treesPatrik Waldmann — 2016
A comprehensive comparison of two variable importance analysis techniques in high dimensions: Application to an environmental multi-indicators systemPengfei Wei, Zhenzhou Lü, Jingwen Song — 2015
Apprentissage et forêts aléatoiresErwan Scornet — 2015
Greedy Outcome Weighted Tree Learning of Optimal Personalized Treatment RulesRuoqing Zhu, Ying-Qi Zhao, Guanhua Chen — 2016

Related papers

Actor-based incremental tree data processing for large-scale machine learning applicationsKouhei Sakurai, Taiki Shimizu — 2019
An Approach to Adaptive Locality Based Maintenance of Correlated DataAnupam Biswas — 2012
Feature Reinforcement Learning using Looping Suffix TreesMayank Daswani, Peter Sunehag, Marcus Hütter — 2012
Scalable algorithms for learning large decision treesDung Trong Nguyen — 2001
O-trees: a constraint-based index structureInga Sitzmann, Peter J. Stuckey — 2000
Acquisition of Characteristic Tree Patterns with VLDC's by Genetic Programming and Edit DistanceShohei Nakai, Tetsuhiro Miyahara, Tetsuji Kuboyama — 2013
On Generating and Simplifying Decision Trees Using Tree Automata ModelsTaleb Zouggar Souad, Baghdad Atmani, Adla Abdelkader — 2013
Design of highly reliable tree architecturesKamala Srinivasan, Arun Sood — 1988
The Experiment and Implementation of Threaded Binary Tree AlgorithmsHong Wang — 2011