- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper seems to be all written by AI. It is not human readable. After much effort, I am not able to understand what is the main problem of interest and what are new contributions. The writing mixes lot of topics, without a clear message even for the abstract and introduction parts. The paper was done by using about 11 modern AI tools/agents.
Critical strengths
A comprehensive collection with 78 pages containing both maths and empirical results.
Critical weaknesses
This paper seems to be all written by AI. It is not human readable. No new contribution seems to be introduced.
Questions for authors
NA
3 comments
Response (2/2): what we prove, what is new, and how the paper was written
What we prove, more precisely. Let the matrix T map the controller's state estimate to the expected future observations, and the matrix D give how the cost depends on the state.
- A weight V with VT = D exists exactly when every direction that leaves the expected observations unchanged is also ignored by the cost (in symbols, ker T ⊆ ker D); V = DT⁺ is one such weight (§3).
- With it, at the exact optimum and under Theorem 2's conditions on k and on a gap between the last kept and the first discarded eigenvalue, the best code of k numbers keeps only directions the cost depends on.
- Without the weight, the best code can keep a direction the cost ignores (Figure 1(a) sketches such a case).
- With a linear decoder, allowing nonlinear encoders does not change the optimum, and at that optimum the decoded output depends on the state estimate only through D (Theorem 3, which assumes the estimate takes finitely many values). A nonlinear decoder, at the same capacity, can reach a lower loss than any linear one while depending on a direction the cost ignores (Appendix A.3).
What is new. The tools are classical, as the paper says: Ky Fan's maximum principle and the Eckart-Young-Mirsky theorem for which directions a code keeps, and Douglas's range-inclusion theorem for when the weight exists. What we add is their use for capacity-limited predictive models: the existence condition joined to the statement of what the code keeps, a counterexample, the extension to nonlinear encoders, and a check of the condition before training.
How the paper was written. This paper is the work of several authors, and AI assisted different parts of our process to different degrees. Everything produced with AI assistance went into the paper after careful and meticulous human oversight: the authors read, checked and revised every part, several times and in detail. We also built the process so that the results do not rest on the text: every theorem is machine-checked in Lean and the paper reproduces its statements from the Lean sources, every reported number was checked against the recorded experiment results (the revision corrects the printing errors later checks found), and the Lean development and the code behind every number are in the supplementary material, so the results can be confirmed independently of the written text.
If the review's "about 11 modern AI tools/agents" refers to our AI Use Statement (pp. 10 to 11 of the submitted PDF, 11 to 12 of the revised one), that list names every model we used at any point, counting successive versions of one model separately (Claude Opus 4.6, 4.8, 5 and 5.5 are four of the eleven), to be complete and precise. It is not a measure of how much of the work AI did. Claude models, above all Claude Opus in its successive versions, did most of the AI-assisted work; the models of the other two providers had smaller, specific roles, which the statement names.
I thank the authors for providing further explanations and revised the paper heavily.
My concerns remain. I've just seen the revised paper. It seems that the authors did extensively revise the PDF, from 78 pages to 113 pages. However, it is unclear about what have been changed and why they need significant changes?
The writing is very weird. For example, Lines 173--239 contain only one paragraph to present both Theorem 2 and possibly discussions. I even cannot see the signal that terminates Theorem 2 statement.
Therefore, I keep the current rating.
Response (1/2): the paper in brief
Thank you very much for your review and for the effort you put into reading our paper. We are very sorry that you found it hard to read, and we would like to make it clearer.
The paper in brief. A model that learns to predict what an agent will observe often has to compress what it knows into a few numbers. In the linear setting we study, the best such model keeps the directions with the most predictable variation. These need not be the directions the control cost depends on. We prove that multiplying the prediction target by one fixed matrix fixes this: at the exact optimum, and under the conditions in our second comment, the model then keeps only directions the control cost depends on. The matrix is computed from the system, the controller and its cost, and we state exactly when such a matrix exists. Most experiments illustrate this on linear systems. A second family (§4) checks what the weight presumes: that a model predicting from a window of past observations recovers the controller's state estimate at all.
The idea, in Figure 1. Figure 1 shows one pipeline trained two ways: an encoder compresses past observations into a code of k numbers, and a decoder predicts the next observations from that code. Trained the standard way (a), the code keeps the directions with the most predictable variation, whether or not the controller needs them; trained on the prediction target multiplied by our matrix (b), its optimum, under those conditions, keeps only what the controller needs. Our pixel experiment shows this on camera images of the DeepMind Control Suite's cartpole next to a second pendulum the task does not depend on, whose noise we set so that, in the linearisation, the standard optimum lies on that pendulum (Appendix I.14, p. 106). The standard code is mostly about the second pendulum (a median 0.83 of the part of its variance that the two pendulums' states explain); the code trained on a truncated form of the matrix (training on the exact one failed there) almost not at all (0.004), and its error on what the controller needs is lower on 20 of 20 seeds.
Where were the difficulties? If you could tell us which passages, terms or steps were hard to follow, we will rewrite them. If you have a concern about the soundness of a particular result, we would be grateful to hear which one, so that we can address it.