Notes on the Reward Representation of Posterior Updates
On the map: Deep reinforcement learning methods → Deep RL algorithms and representations
Abstract (arXiv)
Many ideas in modern control and reinforcement learning treat decision-making as inference: start from a baseline distribution and update it when a signal arrives. We ask when this can be made literal rather than metaphorical. We study the special case where a KL-regularized soft update is exactly a Bayesian posterior inside a single fixed probabilistic model, so the update variable is a genuine channel through which information is transmitted. In this regime, behavioral change is driven only by evidence carried by that channel: the update must be explainable as an evidence reweighing of the baseline. This yields a sharp identification result: posterior updates determine the relative, context-dependent incentive signal that shifts behavior, but they do not uniquely determine absolute rewards, which remain ambiguous up to context-specific baselines. Requiring one reusable continuation value across different update directions adds a further coherence constraint linking the reward descriptions associated with different conditioning orders.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Placed in Deep RL algorithms and representations, one of 15 directions in Deep reinforcement learning methods. Builds on 5 of its 23 references that are in the map. First posted on arXiv 2 Feb 2026.
Builds on
5 of 23 references.
References · 5
- 2019A Theory of Regularized Markov Decision Processescited by 281
- 2017A unified view of entropy-regularized Markov decision processescited by 177
- 2013A General Framework for Updating Belief Distributionscited by 173
- 2021Identifiability in inverse reinforcement learningcited by 55
- 2015Information-Theoretic Bounded Rationalitycited by 21
Built on by
Not cited yet.