A Variant of the Wang-Foster-Kakade Lower Bound for the Discounted Setting
Philip Amortila, Nan Jiang, Tengyang Xie
Extensions for general d𝑑d and the controlled setting
The extension to the controlled case is similar. Let denote the action of in Figure 1. We introduce a second action for that transitions to with reward, and is absorbing with reward . Let the 2-dimensional feature map be: , , , . It is easy to verify that is realizableIn fact, Q-functions in this MDP do not depend on the policy, since only has multiple actions., but and can independently take arbitrary values between (assuming rewards lie in $$), so the learner cannot choose a near-optimal action even with infinite data.
These observations combine to give us the following result:
For any , given realizable linear features, the value function learned by any batch RL algorithm must have worst-case error, even with an infinitely large dataset that has feature coverage.
Final Remark
While the discounted setting allows a very simple construction for the lower bound, this does not imply that the construction for the finite-horizon setting can be simplified in a similar manner. In fact, we believe that the careful construction of Wang et al. (2020) that cleverly exponentiates a negligibly small error is necessary for the finite-horizon setting. Such a difference between the finite-horizon setting and the discounted setting, however, does challenge the conventional wisdom that the results in the finite-horizon setting and the discounted setting are often similar and translate to each other with up to minor differences. Are these two lower bounds “essentially the same”, or does their difference imply some fundamental difference between the finite-horizon and the discounted settings? We leave this open question to the readers.
Acknowledgement
NJ thanks Ruosong Wang for helpful discussions.