Soft Fitted Q-Iteration without Bellman Completeness: Occupancy Reweighting and Temperature Annealing
On the map: Offline RL and imitation learning from data → Offline RL algorithms
Abstract (arXiv)
Fitted (Q)-iteration (FQI) is a standard regression-based method for optimal control in offline reinforcement learning, but its stability under function approximation often relies on Bellman completeness, which requires Bellman images of the fitted class to remain in the class. We study Kullback--Leibler (KL)-regularized, or soft, FQI relative to a fixed reference policy without this assumption. Our key insight is that soft control locally inherits the contraction of policy evaluation in a discounted-occupancy norm. At the soft-optimal fixed point, the linearization of the soft Bellman operator is exactly the Bellman operator for the soft-optimal policy, which contracts in its discounted-occupancy norm; projection in the same norm preserves this contraction. Standard soft FQI instead projects under the offline state-action distribution and need not preserve this property. Motivated by this observation, we propose occupancy-reweighted soft FQI, which retains standard Bellman targets and least-squares updates while reweighting regressions by discounted-occupancy ratios induced by the current soft policy. Under (Q)-function realizability and local regularity, we establish local contraction and finite-sample convergence with estimated ratios, without Bellman completeness. We then use temperature annealing to convert the local result into global convergence from arbitrary initialization: sufficiently high temperature provides a globally contractive starting regime, while gradual cooling connects successive local contraction regions to any prescribed positive target temperature. Under an action-gap margin condition, switching at a fixed positive temperature to hard FQI with refreshed occupancy weights also yields population and finite-sample convergence to the unregularized optimum.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Offline RL algorithms, one of 13 directions in Offline RL and imitation learning from data. First posted on arXiv 30 Dec 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2024Fitted Q-Iteration via Max-Plus-Linear Approximation
- 2026Fitted Occupancy-Ratio Evaluation without Bellman Completeness
- 2022Bellman Residual Orthogonalization for Offline Reinforcement Learning
- 2023Offline Minimax Soft-Q-learning Under Realizability and Partial Coverage
- 2026Optimal Value Inference for Reinforcement Learning
- 2024The Role of Inherent Bellman Error in Offline Reinforcement Learning with Linear Function Approximation
- 2026Residuals-based Offline Reinforcement Learning
- 2026Lifted Bellman Linear Programming for Offline Reinforcement Learning