- Rating
- 4
- Confidence
- 1(−1)
- Informativeness
- 2
- Presentation
- 2(−1)
- Soundness
- 3
Read review
Paper summary
This paper studies the information that a resource summary must retain when it is constructed before the downstream objective is revealed. Under exact budget safety and an irreversible first commitment, it establishes matching worst-case message bounds governed by MPH reward rank and normalized liability precision. It also realizes the lower bounds using at most three known parity-prediction heads, for which full-information planning requires at most eight candidate plans, and provides an exact encoder under supplied public cost structure.
Critical strengths
1. Matching theoretical bounds: The paper provides matching upper and lower bounds showing how reward interactions and cost precision determine the required resource-summary size. This gives a clear account of when short summaries are sufficient and when larger summaries are unavoidable.
2. Constructive compression methods: The paper gives an exact encoding method when public costs have a low-dimensional structure. It preserves every feasible plan with a short message, showing how useful cost structure can keep summaries compact even when numerical precision is high.
3. A clear conceptual insight: The information lower bounds hold even for simple prediction tasks that, given the exact resource state, can be solved by comparing at most eight plans. This shows that preparing a reusable summary for unknown future tasks can require substantial information even when each individual task is easy to solve.
Critical weaknesses
The connection to practical adaptive-computation systems could be made more concrete. A brief example of a realistic application matching the proposed handoff interface would help readers better appreciate the relevance of the theoretical results.
Questions for authors
The main results assume that the utility function is known. Could the authors briefly discuss how the guarantees would change if the utility were learned or only approximately evaluated, as in neural models?
Thank you for the response. Inspite of the fixes, I remain of the opinion that the paper is hard to comprehend. Therefore I will maintain my score.