2022
DOI: 10.1016/j.artint.2022.103770
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical clustering optimizes the tradeoff between compositionality and expressivity of task structures for flexible reinforcement learning

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 46 publications
0
4
0
Order By: Relevance
“…Human behavior in the real world is characterized by long-range dependencies between action plans and outcomes [5,6]. Much of this information is high-dimensional and complex, but can be compressed to yield more efficient, generalizable representations [9,10,[45][46][47][48]. Although how humans learn new behaviors according to such principles has remained elusive, previous work has shown that the computational burden involved in naturalistic behavior can be alleviated by setting "subgoals" that constrain planning over low-level actions [11,[13][14][15]37,49].…”
Section: Discussionmentioning
confidence: 99%
“…Human behavior in the real world is characterized by long-range dependencies between action plans and outcomes [5,6]. Much of this information is high-dimensional and complex, but can be compressed to yield more efficient, generalizable representations [9,10,[45][46][47][48]. Although how humans learn new behaviors according to such principles has remained elusive, previous work has shown that the computational burden involved in naturalistic behavior can be alleviated by setting "subgoals" that constrain planning over low-level actions [11,[13][14][15]37,49].…”
Section: Discussionmentioning
confidence: 99%
“…Human behavior in the real world is characterized by long-range dependencies between action plans and outcomes (5,6). Much of this information is high-dimensional and complex, but can be compressed to yield more efficient, generalizable representations (9,10,(45)(46)(47)(48). Although how humans learn new behaviors according to such principles has remained elusive, previous work has shown that the computational burden involved in naturalistic behavior can be alleviated by setting "subgoals" that constrain planning over low-level actions (11,(13)(14)(15)37,49).…”
Section: Discussionmentioning
confidence: 99%
“…Thus, in this study, the authors included kCC in their experimental investigation. On the other hand, some researchers focused on document clustering (Steinbach et al, 2000;Liu & Frank, 2022) and represented features in the term frequency-inverse document frequency (TF-IDF) matrix. Steinbach et al (2000) published a technical study on the behavior of clustering algorithms in the clustering of IR datasets.…”
Section: Related Workmentioning
confidence: 99%
“…On the other side, without knowing the exact number of clusters (k), hierarchical algorithms are used to draw the hierarchy of the clusters (Kuwil et al, 2020;Liu & Frank, 2022;Zhang et al, 2015;Zhang P. et al, 2019;Zhang W. et al, 2019). The majority of these algorithms, including minimumspanning tree-based clustering algorithms (MSTs), are suitable for massive, contemporary datasets with high dimensions (Wang et al, 2013).…”
Section: Introductionmentioning
confidence: 99%