Fetching the paper…
Reading the bibliography…
Although deep reinforcement learning has become a promising machine learning approach for sequential decision-making problems, it is still not mature enough for high-stake domains such as autonomous driving or medical applications.
N. Wiener,
1954
Earlier work this paper cites.
J. Barwise, “An introduction to first-order logic,” in
1977
Earlier work this paper cites.
D. Pomerleau, “Alvinn: An autonomous land vehicle in a neural network,” in
1989
Earlier work this paper cites.
T. Dean and K. Kanazawa, “A model for reasoning about persistence and causation,”
1990
Earlier work this paper cites.
S. Harnad, “The symbol grounding problem,”
1990
Earlier work this paper cites.
M. Puterman,
1994
Earlier work this paper cites.
R. Maclin and J. W. Shavlik, “Creating advice-taking reinforcement learners,”
1996
Earlier work this paper cites.
P. Maes, M. J. Mataric, J. A. Meyer, J. Pollack, and S. W. Wilson, “Learning to use selective attention and short-term memory in sequential tasks,” in
1996
Earlier work this paper cites.
S. Dzeroski, L. D. Raedt, and H. Blockeel, “Relational reinforcement learning,” in
1998
Earlier work this paper cites.
S. Russell, “Learning Agents for Uncertain Environments,” in
1998
Earlier work this paper cites.
J. Randlov and P. Alstrom, “Learning to drive a bicycle using reinforcement learning and shaping,” in
1998
Earlier work this paper cites.
D. Koller, “Probabilistic relational models,” in
1999
Earlier work this paper cites.
R. S. Sutton, D. Precup, and S. Singh, “Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning,”
1999
Earlier work this paper cites.
C. Boutilier, R. Dearden, and M. Goldszmidt, “Stochastic dynamic programming with factored representations,”
2000
Earlier work this paper cites.
A. Y. Ng and S. Russell, “Algorithms for Inverse Reinforcement Learning,” in
2000
Earlier work this paper cites.
J. Slaney and S. Thiébaux, “Blocks World Revisited,”
2001
Earlier work this paper cites.
S. Džeroski, L. De Raedt, and K. Driessens, “Relational Reinforcement Learning,”
2001
Earlier work this paper cites.
Driessens and H. Blockeel, “Learning Digger using Hierarchical Reinforcement Learning for Concurrent Goals.” in
2001
Earlier work this paper cites.
P. Viola and M. Jones, “Robust real-time object detection,” in
2001
Earlier work this paper cites.
A. G. Barto and S. Mahadevan, “Recent Advances in Hierarchical Reinforcement Learning,”
2003
Earlier work this paper cites.
C. Guestrin, D. Koller, C. Gearhart, and N. Kanodia, “Generalizing plans to new environments in relational MDPs,” in
2003
Earlier work this paper cites.
J. Cole, J. Lloyd, and K. S. Ng, “Symbolic Learning for Adaptive Agents,” in
2003
Earlier work this paper cites.
T. Walker, J. Shavlik, and R. Maclin, “Relational Reinforcement Learning via Sampling the Space of First-Order Conjunctive Features,” in
2004
Earlier work this paper cites.
Younes and Littman, “PPDDL1.0: The language for the probabilistic part of IPC-4,” 2004
2004
Earlier work this paper cites.
S. Sanner, “Simultaneous Learning of Structure and Value in Relational Reinforcement Learning,” in
2005
Earlier work this paper cites.
M. V. Otterlo, “A survey of reinforcement learning in relational domains,” CTIT Technical Report Series, Tech. Rep., 2005
2005
Earlier work this paper cites.
S. Bader and P. Hitzler, “Dimensions of neural-symbolic integration — a structured survey,” in
2005
Earlier work this paper cites.
D. Ernst, P. Geurts, and L. Wehenkel, “Tree-based batch mode reinforcement learning,”
2005
Earlier work this paper cites.
T. Degris, O. Sigaud, and P. H. Wuillemin, “Learning the structure of factored Markov decision processes in reinforcement learning problems,” in
2006
Earlier work this paper cites.
K. Driessens, J. Ramon, and T. Gartner, “Graph Kernels and Gaussian Processes for Relational Reinforcement Learning,”
2006
Earlier work this paper cites.
C. Buciluǎ, R. Caruana, and A. Niculescu-Mizil, “Model compression,” in
2006
Earlier work this paper cites.
H. M. Pasula, L. S. Zettlemoyer, and L. P. Kaelbling, “Learning symbolic models of stochastic domains,”
2007
Earlier work this paper cites.
C. Diuk, A. Cohen, and M. L. Littman, “An object-oriented representation for efficient reinforcement learning,” in
2008
Earlier work this paper cites.
M. Grzes and D. Kudenko, “Plan-based reward shaping for reinforcement learning,” in
2008
Earlier work this paper cites.
A. Cimatti, M. Pistore, and P. Traverso, “Automated planning,” in
2008
Earlier work this paper cites.
T. Walker, L. Torrey, J. Shavlik, and R. MacLin, “Building relational world models for reinforcement learning,” in
2008
Earlier work this paper cites.
L. van der Maaten and G. Hinton, “Visualizing Data using t-SNE,”
2008
Earlier work this paper cites.
M. Otterlo,
2009
Earlier work this paper cites.
R. Brunelli,
2009
Earlier work this paper cites.
F. Scarselli, M. Gori, Ah Chung Tsoi, M. Hagenbuchner, and G. Monfardini, “The Graph Neural Network Model,”
2009
Earlier work this paper cites.
E. Todorov, “Compositionality of optimal control laws,” in
2009
Earlier work this paper cites.
J. Walsh, “Efficient Learning of Relational Models for Sequential Decision Making,” Ph.D. dissertation, Rutgers, 2010
2010
Earlier work this paper cites.
N. Lao and W. W. Cohen, “Relational retrieval using a combination of path-constrained random walks,” in
2010
Earlier work this paper cites.
S. Sanner, “Relational Dynamic Influence Diagram Language (RDDL): Language Description,” in
2011
Earlier work this paper cites.
C. A. Rothkopf and C. Dimitrakakis, “Preference Elicitation and Inverse Reinforcement Learning,” in
2011
Earlier work this paper cites.
S. Ross, G. J. Gordon, and J. A. Bagnell, “A Reduction of Imitation Learning and Structured Prediction to No-regret Online Learning,” in
2011
Earlier work this paper cites.
S. Natarajan, S. Joshi, P. Tadepalli, K. Kersting, and J. Shavlik, “Imitation learning in relational domains: A functional-gradient boosting approach,” in
2011
Earlier work this paper cites.
C. Dwork, M. Hardt, T. Pitassi, O. Reingold, and R. Zemel, “Fairness through awareness,” in
2012
Earlier work this paper cites.
M. van Otterlo, “Solving relational and first order logical markov decision processes: A survey,” in
2012
Earlier work this paper cites.
F. Maes, R. Fonteneau, L. Wehenkel, and D. Ernst, “Policy Search in a Space of Simple Closed-form Formulas: Towards Interpretability of Reinforcement Learning,” in
2012
Earlier work this paper cites.
F. Maes, L. Wehenkel, and D. Ernst, “Automatic Discovery of Ranking Formulas for Playing with Multi-armed Bandits,” in
2012
Earlier work this paper cites.
M. Swain, “Knowledge Representation,” in
2013
Earlier work this paper cites.
J. Kulick, M. Toussaint, T. Lang, and M. Lopes, “Active Learning for Teaching a Robot Grounded Relational Symbols.” in
2013
Earlier work this paper cites.
J. H. Metzen, “Learning Graph-Based Representations for Continuous Reinforcement Learning Domains,” in
2013
Earlier work this paper cites.
G. Kunapuli, P. Odom, J. W. Shavlik, and S. Natarajan, “Guiding Autonomous Agents to Better Behaviors through Human Advice,” in
2013
Earlier work this paper cites.
P. Weng, R. Busa-Fekete, and E. Hüllermeier, “Interactive Q-Learning with Ordinal Rewards and Unreliable Tutor,” in
2013
Earlier work this paper cites.
L. Torrey and M. E. Taylor, “Teaching on a Budget: Agents Advising Agents in Reinforcement Learning,” in
2013
Earlier work this paper cites.
A. D. Dragan, K. C. Lee, and S. S. Srinivasa, “Legibility and predictability of robot motion,” in
2013
Earlier work this paper cites.
J. Scholz, M. Levihn, C. L. Isbell, D. Wingate, and D. Wingate, “A Physics-Based Model Prior for Object-Oriented MDPs,” in
2014
Earlier work this paper cites.
G. Konidaris, L. P. Kaelbling, and T. Lozano-Perez, “Constructing Symbolic Representations for High-Level Planning,” in
2014
Earlier work this paper cites.
P. Cichosz and L. Pawełczak, “Imitation learning of car driving skills with decision trees and random forests,”
2014
Earlier work this paper cites.
M. Zimmer, P. Viappiani, and P. Weng, “Teacher-Student Framework: A Reinforcement Learning Approach,” in
2014
Earlier work this paper cites.
M. V. M. Franca, G. Zaverucha, and A. Garcez, “Fast relational learning using bottom clause propositionalization with artificial neural networks,”
2014
Earlier work this paper cites.
E. Horvitz and D. Mulligan, “Data, privacy, and the greater good,”
2015
Earlier work this paper cites.
V. Mnih, K. Kavukcuoglu, D. Silver, A. A. Rusu, J. Veness, M. G. Bellemare, A. Graves, M. Riedmiller, A. K. Fidjeland, and Others, “Human-level control through deep reinforcement learning,”
2015
Earlier work this paper cites.
——, “Symbol Acquisition for Probabilistic High-Level Planning,” in
2015
Earlier work this paper cites.
T. Munzer, B. Piot, M. Geist, O. Pietquin, and M. Lopes, “Inverse reinforcement learning in relational domains,” in
2015
Earlier work this paper cites.
U. D. Gupta, E. Talvitie, and M. Bowling, “Policy tree: Adaptive representation for policy gradient,” in
2015
Earlier work this paper cites.
T. Rocktäschel, S. Singh, and S. Riedel, “Injecting Logical Background Knowledge into Embeddings for Relation Extraction,” in
2015
Earlier work this paper cites.
T. Zahavy, N. Ben-Zrihem, and S. Mannor, “Graying the black box: Understanding DQNs,” in
2016
Earlier work this paper cites.
K. Crawford, R. Dobbe, T. Dryer, G. Fried, B. Green, E. Kaziunas, A. Kak, V. Mathur, E. McElroy, A. N. Sánchez, D. Raji, J. L. Rankin, R. Richardson, J. Schultz, S. M. West, and M. Whittaker, “AI Now Report,” AI Now Institute, Tech. Rep., 2016
2016
Earlier work this paper cites.
D. Amodei, C. Olah, J. Steinhardt, P. Christiano, J. Schulman, and D. Mané, “Concrete Problems in AI Safety,”
2016
Earlier work this paper cites.
M. T. Ribeiro, S. Singh, and C. Guestrin, “Model-Agnostic Interpretability of Machine Learning,” in
2016
Earlier work this paper cites.
M. Garnelo, K. Arulkumaran, and M. Shanahan, “Towards Deep Symbolic Reinforcement Learning,” in
2016
Earlier work this paper cites.
L. Serafini and A. d’Avila Garcez, “Logic Tensor Networks: Deep Learning and Logical Reasoning from Data and Knowledge,” in
2016
Earlier work this paper cites.
M. Leonetti, L. Iocchi, and P. Stone, “A synthesis of automated planning and reinforcement learning for efficient, robust decision-making,”
2016
Earlier work this paper cites.
D. Martínez, G. Alenyà, C. Torras, T. Ribeiro, and K. Inoue, “Learning relational dynamics of stochastic domains for planning,” in
2016
Earlier work this paper cites.
P. Battaglia, R. Pascanu, M. Lai, D. Rezende, and K. Kavukcuoglu, “Interaction networks for learning about objects, relations and physics,” in
2016
Earlier work this paper cites.
C. Finn, I. Goodfellow, and S. Levine, “Unsupervised learning for physical interaction through video prediction,” in
2016
Earlier work this paper cites.
D. Aksaray, A. Jones, Z. Kong, M. Schwager, and C. Belta, “Q-Learning for robust satisfaction of signal temporal logic specifications,” in
2016
Earlier work this paper cites.
A. A. Rusu, S. G. Colmenarejo, Ç. Gülçehre, G. Desjardins, J. Kirkpatrick, R. Pascanu, V. Mnih, K. Kavukcuoglu, and R. Hadsell, “Policy distillation,” in
2016
Earlier work this paper cites.
M. T. Ribeiro, S. Singh, and C. Guestrin, “”Why Should I Trust You?”: Explaining the Predictions of Any Classifier,” in
2016
Earlier work this paper cites.
Y. Zhang, J. D. Lee, and M. I. Jordan, “L1-regularized Neural Networks are Improperly Learnable in Polynomial Time,” in
2016
Earlier work this paper cites.
I. Goodfellow, Y. Bengio, and A. Courville,
2016
Earlier work this paper cites.
T. Demeester, T. Rocktäschel, and S. Riedel, “Lifted Rule Injection for Relation Embeddings,” in
2016
Earlier work this paper cites.
D. Silver, J. Schrittwieser, K. Simonyan, I. Antonoglou, A. Huang, A. Guez, T. Hubert, L. Baker, M. Lai, A. Bolton, Y. Chen, T. Lillicrap, F. Hui, L. Sifre, G. van den Driessche, T. Graepel, and D. Hassabis, “Mastering the game of Go without human knowledge,”
2017
Earlier work this paper cites.
S. Huang, N. Papernot, I. Goodfellow, Y. Duan, and P. Abbeel, “Adversarial Attacks on Neural Network Policies,” in
2017
Earlier work this paper cites.
J. Schulman, F. Wolski, P. Dhariwal, A. Radford, and O. Klimov, “Proximal Policy Optimization Algorithms,”
2017
Cited alongside, same era.
Z. C. Lipton, “The Mythos of Model Interpretability,”
2017
Cited alongside, same era.
2017
Cited alongside, same era.
D. Martínez, G. Alenyà, and C. Torras, “Relational reinforcement learning with guided demonstrations,”
2017
Cited alongside, same era.
G. Andersen and G. Konidaris, “Active Exploration for Learning Symbolic Representations,” in
2017
Cited alongside, same era.
D. Lyu, F. Yang, B. Liu, and S. Gustafson, “SDRL: Interpretable and Data-Efficient Deep Reinforcement Learning Leveraging Symbolic Planning,” in
2019
Later among the works it cites.
X. Li, Z. Serlin, G. Yang, and C. Belta, “A formal methods approach to interpretable reinforcement learning for robotic planning,”
2019
Later among the works it cites.
H. Zhang, Z. Gao, Y. Zhou, H. Zhang, K. Wu, and F. Lin, “Faster and Safer Training by Embedding High-Level Knowledge into Deep Reinforcement Learning,”
2019
Later among the works it cites.
A. Camacho, R. Toro Icarte, T. Q. Klassen, R. Valenzano, and S. A. McIlraith, “LTL and Beyond: Formal Languages for Reward Function Specification in Reinforcement Learning,” in
2019
Later among the works it cites.
M. Kaiser, C. Otte, T. Runkler, and C. H. Ek, “Interpretable dynamics models for data-efficient reinforcement learning,” in
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Li, K. Sycara, and R. Iyer, “Object-sensitive Deep Reinforcement Learning,” in
2017
Cited alongside, same era.
A. R. Dutra and A. S. d’Avila Garcez, “A Comparison between deep Q-networks and deep symbolic reinforcement learning,” in
2017
Cited alongside, same era.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in
2017
Cited alongside, same era.
Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel, “Gated Graph Sequence Neural Networks,” in
2017
Cited alongside, same era.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” in
2017
Cited alongside, same era.
A. Santoro, D. Raposo, D. G. T. Barrett, M. Malinowski, R. Pascanu, P. Battaglia, and T. Lillicrap, “A simple neural network module for relational reasoning,” in
2017
Cited alongside, same era.
M. B. Chang, T. Ullman, A. Torralba, and J. B. Tenenbaum, “A Compositional Object-Based Approach to Learning Physical Dynamics,” in
2017
Cited alongside, same era.
2019
Later among the works it cites.
B. Eysenbach, R. R. Salakhutdinov, and S. Levine, “Search on the replay buffer: Bridging planning and reinforcement learning,” in
2019
Later among the works it cites.
R. Toro Icarte, E. Waldie, T. Klassen, R. Valenzano, M. Castro, and S. McIlraith, “Learning Reward Machines for Partially Observable Reinforcement Learning,” in
2019
Later among the works it cites.
——, “Generating interpretable reinforcement learning policies using genetic programming,” in
2019
Later among the works it cites.
R. Akrour, D. Tateo, and J. Peters, “Towards reinforcement learning of human readable policies,” in
2019
Later among the works it cites.
Z. Jiang and S. Luo, “Neural Logic Reinforcement Learning,” in
2019
Later among the works it cites.
A. Payani and F. Fekri, “Inductive Logic Programming via Differentiable Deep Neural Logic Networks,”
2019
Later among the works it cites.
——, “Learning Algorithms via Neural Logic Networks,”
2019
Later among the works it cites.
Y. Yang and L. Song, “Learn to Explain Efficiently via Neural Logic Inductive Learning,” in
2019
Later among the works it cites.
A. Verma, H. M. Le, Y. Yue, and S. Chaudhuri, “Imitation-Projected Programmatic Reinforcement Learning,” in
2019
Later among the works it cites.
H. Dong, J. Mao, T. Lin, C. Wang, L. Li, and D. Zhou, “Neural Logic Machines,” in
2019
Later among the works it cites.
A. M. Roth, N. Topin, P. Jamshidi, and M. Veloso, “Conservative Q-Improvement: Reinforcement Learning for an Interpretable Decision-Tree Policy,”
2019
Later among the works it cites.
M. Vasic, A. Petrovic, K. Wang, M. Nikolic, R. Singh, and S. Khurshid, “MoET: Interpretable and Verifiable Reinforcement Learning via Mixture of Expert Trees,”
2019
Later among the works it cites.
S. Nageshrao, B. Costa, and D. Filev, “Interpretable approximation of a deep reinforcement learning agent as a set of if-then rules,” in
2019
Later among the works it cites.
H. Zhu, S. Magill, Z. Xiong, and S. Jagannathan, “An inductive synthesis framework for verifiable reinforcement learning,” in
2019
Later among the works it cites.
M. Burke, S. Penkov, and S. Ramamoorthy, “From explanation to synthesis: Compositional program induction for learning from demonstration,” in
2019
Later among the works it cites.
A. Koul, S. Greydanus, and A. Fern, “Learning Finite State Representations of Recurrent Policy Networks,” in
2019
Later among the works it cites.
A. Mott, D. Zoran, M. Chrzanowski, D. Wierstra, and D. J. Rezende, “Towards Interpretable Reinforcement Learning Using Attention Augmented Agents,” in
2019
Later among the works it cites.
R. M. Annasamy and K. Sycara, “Towards Better Interpretability in Deep Q-Networks,” in
2019
Later among the works it cites.
S. Wiegreffe and Y. Pinter, “Attention is not not Explanation,” in
2019
Later among the works it cites.
S. Jain and B. C. Wallace, “Attention is not Explanation,” in
2019
Later among the works it cites.
R. Jia, M. Jin, K. Sun, T. Hong, and C. Spanos, “Advanced building control via deep reinforcement learning,” in
2019
Later among the works it cites.
M. Wu, S. Parbhoo, M. C. Hughes, V. Roth, and F. Doshi-Velez, “Optimizing for Interpretability in Deep Neural Networks with Tree Regularization,”
2019
Later among the works it cites.
W. Wang and S. J. Pan, “Integrating Deep Learning with Logic Fusion for Information Extraction,” in
2019
Later among the works it cites.
Y. Coppens, K. Efthymiadis, T. Lenaerts, A. Nowé, T. Miller, R. Weber, and D. Magazzeni, “Distilling deep reinforcement learning policies in soft decision trees,” in
2019
Later among the works it cites.
Z. Juozapaitis, A. Koul, A. Fern, M. Erwig, and F. Doshi-Velez, “Explainable reinforcement learning via reward decomposition,” in
2019
Later among the works it cites.
N. Topin and M. Veloso, “Generation of Policy-Level Explanations for Reinforcement Learning,” in
2019
Later among the works it cites.
F. Cruz, R. Dazeley, and P. Vamplew, “Memory-Based Explainable Reinforcement Learning,” in
2019
Later among the works it cites.
B. Y. Lim, Q. Yang, A. Abdul, and D. Wang, “Why these Explanations? Selecting Intelligibility Types for Explanation Goals,” in
2019
Later among the works it cites.
B. Mittelstadt, C. Russell, and S. Wachter, “Explaining Explanations in AI,” in
2019
Later among the works it cites.
C. Rudin and D. Carlson, “The Secrets of Machine Learning: Ten Things You Wish You Had Known Earlier to Be More Effective at Data Analysis,” in
2019
Later among the works it cites.
A. Daly, T. Hagendorff, H. Li, M. Mann, V. Marda, B. Wagner, W. W. Wang, and S. Witteborn, “Artificial Intelligence, Governance and Ethics: Global Perspectives,” SSRN Scholarly Paper, 2019
2019
Later among the works it cites.
D. Leslie, “Understanding artificial intelligence ethics and safety: A guide for the responsible design and implementation of AI systems in the public sector,”
2020
Later among the works it cites.
J. Morley, L. Floridi, L. Kinsey, and A. Elhalal, “From what to how: An initial review of publicly available AI ethics tools, methods and research to translate principles into practices,”
2020
Later among the works it cites.
S. Lo Piano, “Ethical principles in machine learning and artificial intelligence: Cases from the field and possible ways forward,”
2020
Later among the works it cites.
S. Mohseni, N. Zarei, and E. D. Ragan, “A Multidisciplinary Survey and Framework for Design and Evaluation of Explainable AI Systems,”
2020
Later among the works it cites.
E. Puiutta and E. M. Veith, “Explainable reinforcement learning: A survey,” in
2020
Later among the works it cites.
A. Alharin, T.-N. Doan, and M. Sartipi, “Reinforcement Learning Interpretation Methods: A Survey,”
2020
Later among the works it cites.
R. Veerapaneni, J. D. Co-Reyes, M. Chang, M. Janner, C. Finn, J. Wu, J. Tenenbaum, and S. Levine, “Entity abstraction in visual model-based reinforcement learning,” in
2020
Later among the works it cites.
A. Barredo Arrieta, N. Díaz-Rodríguez, J. D. Ser, A. Bennetot, S. Tabik, A. Barbado, S. Garcia, S. Gil-Lopez, D. Molina, R. Benjamins, R. Chatila, and F. Herrera, “Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AI,”
2020
Later among the works it cites.
S. Chari, D. M. Gruen, O. Seneviratne, and D. L. McGuinness, “Directions for Explainable Knowledge-Enabled Systems,”
2020
Later among the works it cites.
S. Garg, A. Bajpai, and Mausam, “Symbolic Network: Generalized Neural Policies for Relational MDPs,”
2020
Later among the works it cites.
S.-H. Sun, T.-L. Wu, and J. J. Lim, “Program Guided Agent,” in
2020
Later among the works it cites.
M. Cranmer, A. Sanchez Gonzalez, P. Battaglia, R. Xu, K. Cranmer, D. Spergel, and S. Ho, “Discovering symbolic models from deep learning with inductive biases,” in
2020
Later among the works it cites.
2020
Later among the works it cites.
D. Bear, C. Fan, D. Mrowca, Y. Li, S. Alter, A. Nayebi, J. Schwartz, L. F. Fei-Fei, J. Wu, J. Tenenbaum, and D. L. Yamins, “Learning physical graph representations from visual scenes,” in
2020
Later among the works it cites.
L. Illanes, X. Yan, R. T. Icarte, and S. A. McIlraith, “Symbolic Plans as High-Level Instructions for Reinforcement Learning,” in
2020
Later among the works it cites.
S. Zhang and M. Sridharan, “A Survey of Knowledge-based Sequential Decision Making under Uncertainty,”
2020
Later among the works it cites.
G. Zhu, J. Wang, Z. Ren, Z. Lin, and C. Zhang, “Object-Oriented Dynamics Learning through Multi-Level Abstraction,” in
2020
Later among the works it cites.
S. Srinivasan and F. Doshi-Velez, “Interpretable batch IRL to extract clinician goals in ICU hypotension management,” in
2020
Later among the works it cites.
M. Hasanbeig, D. Kroening, and A. Abate, “Deep Reinforcement Learning with Temporal Logics,” in
2020
Later among the works it cites.
Z. Xu, I. Gavran, Y. Ahmad, R. Majumdar, D. Neider, U. Topcu, and B. Wu, “Joint Inference of Reward Machines and Policies for Reinforcement Learning,” in
2020
Later among the works it cites.
M. Gaon and R. I. Brafman, “Reinforcement Learning with Non-Markovian Rewards,” in
2020
Later among the works it cites.
G. N. Tasse, S. James, and B. Rosman, “A Boolean Task Algebra for Reinforcement Learning,” in
2020
Later among the works it cites.
A. Likmeta, A. M. Metelli, A. Tirinzoni, R. Giol, M. Restelli, and D. Romano, “Combining reinforcement learning with rule-based controllers for transparent and general decision-making in autonomous driving,”
2020
Later among the works it cites.
A. Silva, M. Gombolay, T. Killian, I. Jimenez, and S.-H. Son, “Optimization Methods for Interpretable Differentiable Decision Trees Applied to Reinforcement Learning,” in
2020
Later among the works it cites.
A. Silva and M. Gombolay, “Neural-encoding Human Experts’ Domain Knowledge to Warm Start Reinforcement Learning,”
2020
Later among the works it cites.
J. Ault, J. P. Hanna, and G. Sharon, “Learning an Interpretable Traffic Signal Control Policy,” in
2020
Later among the works it cites.
——, “Incorporating Relational Background Knowledge into Reinforcement Learning via Differentiable Inductive Logic Programming,”
2020
Later among the works it cites.
Z. Ma, Y. Zhuang, P. Weng, D. Li, K. Shao, W. Liu, H. H. Zhuo, and J. Hao, “Interpretable Reinforcement Learning With Neural Symbolic Logic,”
2020
Later among the works it cites.
G. Anderson, A. Verma, I. Dillig, and S. Chaudhuri, “Neurosymbolic Reinforcement Learning with Formally Verified Exploration,” in
2020
Later among the works it cites.
J. Chen, S. E. Li, and M. Tomizuka, “Interpretable End-to-end Urban Autonomous Driving with Latent Deep Reinforcement Learning,” in
2020
Later among the works it cites.
Y. Tang, D. Nguyen, and D. Ha, “Neuroevolution of Self-Interpretable Agents,” in
2020
Later among the works it cites.
G. Brunner, Y. Liu, D. Pascual, O. Richter, M. Ciaramita, and R. Wattenhofer, “On Identifiability in Transformers,” in
2020
Later among the works it cites.
2020
Later among the works it cites.
P. Gupta, N. Puri, S. Verma, D. Kayastha, S. Deshmukh, B. Krishnamurthy, and S. Singh, “Explain Your Move: Understanding Agent Actions Using Focused Feature Saliency,” in
2020
Later among the works it cites.
Y. Wang, M. Mase, and M. Egi, “Attribution-based Salience Method towards Interpretable Reinforcement Learning,” in
2020
Later among the works it cites.
W. Shi, G. Huang, S. Song, Z. Wang, T. Lin, and C. Wu, “Self-Supervised Discovering of Interpretable Features for Reinforcement Learning,”
2020
Later among the works it cites.
J. Kim and M. Bansal, “Attentional Bottleneck: Towards an Interpretable Deep Driving Network,” in
2020
Later among the works it cites.
P. Sequeira and M. Gervasio, “Interestingness Elements for Explainable Reinforcement Learning: Understanding Agents’ Capabilities and Limitations,”
2020
Later among the works it cites.
P. Madumal, T. Miller, L. Sonenberg, and F. Vetere, “Explainable Reinforcement Learning Through a Causal Lens,” in
2020
Later among the works it cites.
——, “Distal Explanations for Model-free Explainable Reinforcement Learning,”
2020
Later among the works it cites.
A. Atrey, K. Clary, and D. Jensen, “Exploratory Not Explanatory: Counterfactual Analysis of Saliency Maps for Deep Reinforcement Learning,” in
2020
Later among the works it cites.
2020
Later among the works it cites.
S. A. Friedler, C. Scheidegger, and S. Venkatasubramanian, “The (Im)possibility of fairness: Different value systems require different mechanisms for fair decision making,”
2021
Closest in time.
J. Whittlestone, K. Arulkumaran, and M. Crosby, “The Societal Implications of Deep Reinforcement Learning,”
2021
Closest in time.
A. Heuillet, F. Couthouis, and N. Díaz-Rodríguez, “Explainability in deep reinforcement learning,”
2021
Closest in time.
2021
Closest in time.
D. Furelos-Blanco, M. Law, A. Jonsson, K. Broda, and A. Russo, “Induction and Exploitation of Subgoal Automata for Reinforcement Learning,”
2021
Closest in time.
N. Topin, S. Milani, F. Fang, and M. Veloso, “Iterative Bounding MDPs: Learning Interpretable Policies via Non-Interpretable Methods,” in
2021
Closest in time.
M. Zimmer, X. Feng, C. Glanois, Z. Jiang, J. Zhang, P. Weng, H. Jianye, L. Dong, and L. Wulong, “Differentiable logic machines,”
2021
Closest in time.
T. Bewley and J. Lawry, “TripleTree: A Versatile Interpretable Representation of Black Box Agents and their Environments,” in
2021
Closest in time.