- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper studies compressed history representations in finite POMDPs. Drawing on established linear compression methods, it formulates policy-tree values for a designated set of "trusted actions" as a Hankel matrix and provides a corresponding rank characterization. Under various additional assumptions, the paper also presents bounds for choosing an encoder from a finite class and characterizes the minimum codebook size needed for optimal decisions across tasks. Experiments on small synthetic models are provided.
Critical strengths
None
Critical weaknesses
- The writing and organization of the paper require substantial improvement. There is no clear statement of the central problem; instead, the text relies on informal examples and terminology. A lot of notation/terminology is also used without explicit definitions in the main body (e.g., "nuisance", "core", in Theorem 4, etc.). The transitions between sections are difficult to follow, as the paper shifts from preserving the values of all considered policy trees to preserving optimal-action selection. These are distinct requirements, yet they are somehow presented as parts of a single characterization. The main contribution and the relationship between the results are therefore unclear.
- The paper should discuss how it differs from prior work. For example, linear compression construction is closely related to Poupart and Boutilier (2002), and it is unclear what is this paper's contribution here. The assumptions also need discussion, and, currently, most of them are relegated to the appendix.
Questions for authors
- Could you provide a precise, self-contained statement of the central problem, specifying what the representation must preserve, the admissible encoder and decoder classes, the information available to the learner, and the objective being optimized?
- What additional conclusions does your Theorem 1 provide beyond the invariant-subspace characterization of lossless linear compression in Poupart and Boutilier (2002)?
5 comments
The revised manuscript is significantly different from the original submission. I maintain my original score.
Thank you for following up. The central research question remains the same, and the revisions address your requests for clearer definitions, a better explanation of the relationship between the results, and a comparison with prior work. Could you please identify which specific changes you consider significantly different from the original submission, and which of your original concerns remain unresolved after our response? This would help us understand the basis for your assessment.
We thank Reviewer s6pp for the direct, insightful feedback on organization, problem specification, assumption scope, and positioning relative to Poupart & Boutilier (2002). Our revision addresses each point directly.
Q1. Self-contained central problem & definitions
Section 2 (pp. 2–3) establishes all primitives ahead of main results:
Q2. Unifying tree values (Sec. 3) and optimal-action selection (Sec. 4)
Sections 1, 2.2, and 4 connect Secs. 3–4 as one relaxation along the decision-sufficiency spectrum:
Q3. Exact mathematical advances of Theorem 1 beyond Poupart & Boutilier (2002) [VDC]
Remark 1 (p. 5) and Table 2 (p. 10) isolate our advances over VDC:
We hope these clarifications address your concerns and look forward to further discussion.