Fetching the paper…
Reading the bibliography…
We propose to use boosted regression trees as a way to compute human-interpretable solutions to reinforcement learning problems.
“Boxes: An Experiment in Adaptive Control”
Donald Michie and R.A. Chambers · 1968
Earlier work this paper cites.
“Neuronlike adaptive elements that can solve difficult learning control problems”
A.. Barto, R.. Sutton and C.. Anderson · 1983
Earlier work this paper cites.
“Classification and Regression Trees”, 1984
Leo Breiman, Jerome Friedman, Richard Olshen and Charles Stone · 1984
Earlier work this paper cites.
“Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning”
Ronald. Williams · 1992
Earlier work this paper cites.
“Generalization in Reinforcement Learning: Safely Approximating the Value Function”
Justin. Boyan and Andrew. Moore · 1995
Earlier work this paper cites.
“Multi-agent Q-learning and regression trees for automated pricing decisions”
Manu Sridharan and Gerald Tesauro · 2000
Earlier work this paper cites.
“Greedy Function Approximation: A Gradient Boosting Machine”
Jerome. Friedman · 2001
Earlier work this paper cites.
“Reinforcement Learning as Classification: Leveraging Modern Classifiers”
Michail. Lagoudakis and Ronald Parr · 2003
Cited alongside, same era.
“Tree-Based Batch Mode Reinforcement Learning”
Damien Ernst, Pierre Geurts and Louis Wehenkel · 2005
Cited alongside, same era.
“The Elements of Statistical Learning”
Trevor Hastie, Robert Tibshirani and Jerome Friedman · 2009
Cited alongside, same era.
“Algorithms for Reinforcement Learning”
Csaba Szepesvari · 2009
Cited alongside, same era.
“Making machine learning models interpretable”
Alfredo Velido, Jose. Martin-Guerro and Paulo.G. Lisboa · 2012
Cited alongside, same era.
“Exploratory Gradient Boosting for Reinforcement Learning in Complex Domains”
David Abel et al · 2016
Cited alongside, same era.
“Building an Interpretable Recommender via Loss-Preserving Transformation”
Amit Dhurandhar, Sechan Oh and Marek Petrik · 2016
Later among the works it cites.
“Analysis of Classifcation-based Policy Iteration Algorithms”
Alessandro Lazaric, Mohammad Ghavamzadeh and Remi Munos · 2016
Later among the works it cites.
“Interpretable Policies for Dynamic Product Recommendations”
Marek Petrik and Ronny Luss · 2016
Later among the works it cites.
“Why Most Decisions Are Easy in Tetris—And Perhaps in Other Sequential Decision Problems, As Well”
Ozgur Simsek, Simon Algorta and Amit Kothiyal · 2016
Later among the works it cites.
“Reinforcement Learning: an Introduction”
Richard. Sutton and Andrew. Barto · 2016
Later among the works it cites.
“Mastering the game of Go without human knowledge”
David Silver et al · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Is Artificial Intelligence Permanently Inscrutable?”
Aaron Bornstein · 2016
Cited alongside, same era.