Designing interpretable approximations to deep reinforcement learning

N Dahlin, KC Kalagarla, N Naik, R Jain… - arXiv preprint arXiv …, 2020 - arxiv.org
In an ever expanding set of research and application areas, deep neural networks (DNNs)
set the bar for algorithm performance. However, depending upon additional constraints such
as processing power and execution time limits, or requirements such as verifiable safety
guarantees, it may not be feasible to actually use such high-performing DNNs in practice.
Many techniques have been developed in recent years to compress or distill complex DNNs
into smaller, faster or more understandable models and controllers. This work seeks to …

[引用][C] Designing interpretable approximations to deep reinforcement learning with soft decision trees

N Dahlin, KC Kalagarla, N Naik, R Jain, P Nuzzo - arXiv preprint arXiv:2010.14785, 2020
以上显示的是最相近的搜索结果。 查看全部搜索结果