- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper studies a two-state hidden process with binary actions and observations, trained on N independent reset triples. It claims the minimax control loss on a fresh H-step episode is min{H, H^{3/2}N^{-1/4}, H^3N^{-1/2}} up to constants. The upper bound uses a thirteen-moment learner with a belief controller. Section 6 reports deterministic replays, a small Monte Carlo study at H = 8, and a pixel-based world-model experiment.
Critical strengths
None
Critical weaknesses
-
The paper is AI-generated with no meaningful human involvement. The text contains undefined internal pipeline labels, such as "EXPLORATORY_LOCAL_COMPLETED_NO_ADMISSION", "native D10 admission", "ARA and DAG views", "experiment-integrity gate", "receipts" and "v3 campaign". Most of the prose hedges about what is not claimed instead of stating a contribution. The paper is not written for a human reader.
-
The paper does not follow the ICLR template, and its formatting is messy. It uses a non-Times font and non-standard section headings. Table 1 rows are broken across lines, and in Fig. 2 the legend overlaps a panel title. This alone warrants desk rejection.
-
The experiments do not support the claims. No tested budget reaches the regime boundaries (N ≤ 256 ≪ H^6). The full method does not beat its ablations. In the neural experiments the latent planners do worse than the baseline and collapse to a constant action, and the authors themselves disown these results.
Questions for authors
None. The issues above are not addressable in a rebuttal.