- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper presents Mímir, an LLM-based irrigation controller. The LLM proposes an irrigation action and revises it using feedback from a numerical simulator. A deterministic search and execution gate then chooses the action that is actually applied. Across seasons, the system updates contextual memory, while keeping the physical model and execution constraints fixed. The evaluation uses retrospective agricultural data from several sites and crops. The authors compare against historical irrigation, heuristic controllers, and an RL baseline, and report ablations for simulation, proposal repair, execution shielding, and memory. They also examine different LLM backbones and a nine-season sequence.
Critical strengths
- I like that the LLM does not directly control execution. Its output is checked, used to guide candidate search, and passed through fixed constraints. The same boundary applies to memory: experience can change future proposals but cannot rewrite the physical model or relax the action bounds. This design is sensible for the setting.
- The repair and memory ablations are also useful. In particular, retaining the downstream numerical machinery when removing proposal repair is a better comparison than simply showing that the full system beats a zero-shot LLM. It gives some evidence that the proposal stage matters.
Critical weaknesses
- My main concern is the missing numerical-control comparison. Appendix E.5 describes a deterministic physics-search/MPC baseline, but I could not find its results. Since the final action is already selected through numerical rollout and search, this is the comparison I most wanted to see. Does the LLM provide a better search anchor than a simple rule, previous action, or a reasonably dense numerical search? The current ablations do not answer that. Without this result, I cannot judge whether the language-and-memory layer adds enough to justify the paper’s central contribution.
- My second concern is that I cannot reconstruct the main evaluation from the submission. Appendix D leaves the objective weights, statistical unit, and sample count for later insertion. The irrigation aggregation is also unclear to me. More importantly, I need to understand what happens to soil state after a controller chooses an action different from historical irrigation. Does each controller evolve its own simulated trajectory, or are recorded soil observations subsequently used to reset or correct it? That distinction matters for whether the experiment measures the accumulated consequences of the controller’s decisions. These are missing explanations, not evidence that the results are wrong. But they prevent me from treating the headline comparison as sufficiently established.
Questions for authors
- Can you report the deterministic physics-search/MPC results described in Appendix E.5, including a comparison with the same simulator-call budget? This result is most likely to change my recommendation.
- Please provide the exact objective weights, stress threshold, sample counts, and meaning of the reported uncertainty. Are the irrigation values totals over an evaluated trajectory or averages over days/windows?
- After counterfactual irrigation actions, how is the next soil state obtained? Please clarify which historical measurements are reused and whether they can overwrite the effects of earlier controller actions.
- For the memory ablation, what principles were actually stored, when were they updated, and what were the update/reset rules? I would also like to know whether fixed guidance gives a similar benefit, though that would be an additional experiment rather than a clarification.