Why Generalization in RL is Difficult: Epistemic POMDPs and Implicit Partial Observability
NeurIPS'21, 2021. [All Versions]. A formal treatment on the generalization problem in reinforcement learning.
- from
- AGI & CoCoSci
- added
- 2026-10-10
- likes
- 0
similar
-
Neural Logic Reinforcement Learning arxiv.org
ICML'19, 2019. [All Versions].
-
On the Complexity of Bayesian Generalization proceedings.mlr.press
ICML'23, 2023. [All Versions]. [Project]. [Models]. This work examines concept generalization at a large scale in the natural visual spectrum. Established computational modes (i.e., rule-based or similarity-based) are primarily studied isolated, focusing on confined and…
-
Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variables proceedings.mlr.press
ICML'19, 2019. [All Versions].
-
Generalized Inverse Planning: Learning Lifted non-Markovian Utility for Generalizable Task Representation export.arxiv.org
2020. [All Versions].
-
Compositionality and Generalization in Emergent Languages arxiv.org
ACL'20, 2020. [All Versions].
-
Few-shot Bayesian imitation learning with logical program policies. arxiv.org
AAAI'20, 2020. [All Versions].
AGI & CoCoSci › Papers > Problem Solving > Reinforcement Learning: “NeurIPS'21, 2021. [All Versions]. A formal treatment on the generalization problem in reinforcement learning.”