2023
DOI: 10.1109/lra.2023.3268593
|View full text |Cite
|
Sign up to set email alerts
|

Natural Language Specification of Reinforcement Learning Policies Through Differentiable Decision Trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 38 publications
0
1
0
Order By: Relevance
“…Prior work has proposed differentiable decision trees (DDTs) (Suárez and Lutsko, 1999;Silva and Gombolay, 2021;Paleja et al, 2020;Tambwekar et al, 2023) -a neural network architecture that takes the topology of a decision tree (DT). Similar to a decision tree, DDTs contain decision nodes and leaf nodes; however, each decision node within the DDT utilizes a sigmoid activation function (i.e., a "soft" decision) instead of a Boolean decision (i.e., a "hard" decision).…”
Section: Differentiable Decision Trees (Ddts)mentioning
confidence: 99%
“…Prior work has proposed differentiable decision trees (DDTs) (Suárez and Lutsko, 1999;Silva and Gombolay, 2021;Paleja et al, 2020;Tambwekar et al, 2023) -a neural network architecture that takes the topology of a decision tree (DT). Similar to a decision tree, DDTs contain decision nodes and leaf nodes; however, each decision node within the DDT utilizes a sigmoid activation function (i.e., a "soft" decision) instead of a Boolean decision (i.e., a "hard" decision).…”
Section: Differentiable Decision Trees (Ddts)mentioning
confidence: 99%