A Contractive Feedback Semantics for Reinforcement Learning
On the map: Deep reinforcement learning methods → RL theory and sample complexity
Abstract (arXiv)
Discounted reinforcement learning is usually presented through Bellman equations on closed Markov decision processes. This paper develops a compositional view: a one-step decision process is treated as an open stochastic component, and infinite-horizon policy evaluation is obtained by closing a contractive feedback loop. The resulting semantics assigns typed Bellman transformers to open components, interprets series and parallel wiring as composition and tensoring of transformers, and interprets feedback as an admissible guarded Banach trace realized by a unique fixed point. This perspective yields three theoretical consequences. First, approximate component equivalence is a contextual congruence for admitted well-typed guarded one-hole contexts: local operator error remains controlled after plugging the component into a surrounding circuit that uses the hole once and whose feedback nodes have certified uniform guardedness. Second, exact and approximate state abstractions become commuting or near-commuting coalgebraic diagrams, giving value-preservation and explicit sup-norm distortion bounds. Third, under monotone ω-continuous contract-transformer semantics, safety, risk, and resource specifications can be represented as quantale-valued contracts, where local inductive bounds lift through wiring and feedback by least-fixed-point reasoning. Its central claim is not that all RL morphisms form a global traced monoidal category, but that discounted Bellman evaluation admits a contractive feedback semantics on the admissible class of guarded circuits.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 3 of its 30 references that are in the map. First posted on arXiv 23 May 2026.
Builds on
3 of 30 references.
References · 3
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Compositional Behavioral Semantics for State Abstraction in Reinforcement Learning
- 2025Bellman operator convergence enhancements in reinforcement learning algorithms
- 2024Learning safety critics via a non-contractive binary bellman operator
- 2026Generalised Bellman recurrence and three dualities in sequential decision-making
- 2025Theoretical Barriers in Bellman-Based Reinforcement Learning
- 2024Taming "data-hungry" reinforcement learning? Stability in continuous state-action spaces
- 2026Inverting the Bellman Equation: From Q-Values to World Models
- 2026Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning