Summary
- This paper proposes a novel future-dependent value function to study the problem of OPE in POMDPs with function approximations.
- A new Bellman-style conditional moment equation is derived for the future-dependent value function, based on which the value function can be learned via finite sample using minimax learning methods.
- Under certain completeness, realizability, and overlapping assumptions, a finite sample theoretical bound is derived for the proposed minimax learning algorithm. The paper also provides experimental evidence to empirically evaluate the performance of the algorithm.
Strengths
- The paper first proposes using "future-dependent value function" to solve the problem of OPE in POMDPs, which is a critical problem in offline RL literature. The resulting method potentially overcomes the curse of horizon in learning POMDPs.
- The presentation of the paper is clear, e.g., using memory-less policy to illustrate the idea in the main text. The connections with highly related works, e.g., OPE in MDPs, OPE in confounded POMDPs, system dynamics learning, spectral learning, are well-discussed.
- The statistical theory regarding minimax learning and OPE is sound, and empirical evaluations are also provided.
Weaknesses
- The idea of incorporating future information as parts of value functions for POMDPs is not new, e.g., [1], even though I still appreciate that this paper first attempts using such methods for OPE in POMDPs.
- The main part of the statistical theory regarding minimax estimation and OPE is standard given that various customized assumptions (completeness, realizability, and certain overlapping conditions) hold.
**References:**
[1] Uehara M, Sekhari A, Lee J D, et al. Provably efficient reinforcement learning in partially observable dynamical systems[J]. Advances in Neural Information Processing Systems, 2022, 35: 578-592.
Questions
- Regarding the completeness assumption (2b), how can it be justified in the examples provided in the paper, e.g., HSE-POMDPs? I would appreciate it if the authors could provide more detailed clarifications on that.
- A novelty of the paper is using both history and future proxies in POMDP OPE. Is it possible to give a more quantitative trade-off between the usage of the history part and the future part (probably problem-dependent) towards optimal identifying and evaluating the policy value?
- Another seemingly key assumption in the presentation of the paper is that the offline data from an infinite horizon POMDP has a stationary distribution. Even mentioned in the main texts, I still wondering if the algorithm and theory can be directly extended to the more general non-stationary settings.
Rating
7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed ethical considerations.
Confidence
3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.
Limitations
The above points in Questions are potential limitations.