- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper evaluates whether the rank order between quantization (or other approximation) error in a given step of a policy translates to rank order between downstream task performance, finding that this does not always hold. The paper also proposes a test for whether a given policy quantization is within a tolerance by testing numerical error of a igven policy against FP32.
Critical strengths
None
Critical weaknesses
- The manuscript is heavily (possibly entirely) AI-written and is not very legible.
- Many terms in the paper are undefined jargon
- Some plots (e.g., Figure 1) are missing legends.
- Both contributions reflect existing understanding and practice:
- The idea that approximation error can explode as a policy is rolled out is already well-understood in the RL literature (e.g., https://arxiv.org/abs/1011.0686)
- Testing policies against FP32 is standard practice (e.g., https://arxiv.org/abs/1911.02549)
Questions for authors
I would be willing to update my review with substantial clarification of the novelty of the paper