Generalized Reinforcement Learning: Experience Particles, Action Operator, Reinforcement Field, Memory Association, and Decision Concepts
Not on the map. Why?
Abstract (arXiv)
Learning a control policy capable of adapting to time-varying and potentially evolving system dynamics has been a great challenge to the mainstream reinforcement learning (RL). Mainly, the ever-changing system properties would continuously affect how the RL agent interacts with the state space through its actions, which effectively (re-)introduces concept drifts to the underlying policy learning process. We postulated that higher adaptability for the control policy can be achieved by characterizing and representing actions with extra "degrees of freedom" and thereby, with greater flexibility, adjusts to variations from the action's "behavioral" outcomes, including how these actions get carried out in real time and the shift in the action set itself. This paper proposes a Bayesian-flavored generalized RL framework by first establishing the notion of parametric action model to better cope with uncertainty and fluid action behaviors, followed by introducing the notion of reinforcement field as a physics-inspired construct established through "polarized experience particles" maintained in the RL agent's working memory. These particles effectively encode the agent's dynamic learning experience that evolves over time in a self-organizing way. Using the reinforcement field as a substrate, we will further generalize the policy search to incorporate high-level decision concepts by viewing the past memory as an implicit graph structure, in which the memory instances, or particles, are interconnected with their degrees of associability/similarity defined and quantified such that the "associative memory" principle can be consistently applied to establish and augment the learning agent's evolving world model.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 2 of its 43 references that are in the map. First posted on arXiv 9 Aug 2022.
Builds on
2 of 43 references.
References · 2
- 2021Convex optimizationcited by 2,479
- 2020Contextual-Bandit Based Personalized Recommendation with Time-Varying User Interestscited by 18
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2021Dream to Explore: Adaptive Simulations for Autonomous Systems
- 2021Behavioral Priors and Dynamics Models: Improving Performance and Domain Transfer in Offline RL
- 2026From Static Policies to Adaptive Priors in Offline Reinforcement Learning
- 2019MANGA: Method Agnostic Neural-policy Generalization and Adaptation ↗
- 2022Model-Based Offline Reinforcement Learning with Pessimism-Modulated Dynamics Belief
- 2022When to Trust Your Simulator: Dynamics-Aware Hybrid Offline-and-Online Reinforcement Learning
- 2025Re:Frame -- Retrieving Experience From Associative Memory
- 2020Task-Agnostic Online Reinforcement Learning with an Infinite Mixture of Gaussian Processes