- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes LensRSI, which builds on LensDesigner and couples a task-level design loop (prescription retrieval, typed lens edits, simulator feedback) with a cross-task loop that distills simulator-measured trajectories into a candidate policy, consisting of a state-conditioned action-score table and allowed search controls. A separate verifier, LensHarness, re-runs the parent and candidate from identical initial prescriptions under matched simulator budgets and promotes the candidate only if it improves without degrading validation performance or physical validity. Experiments on the LensArena and LensArenaEx benchmarks demonstrate the effectiveness of the proposed method.
Critical strengths
-
This paper studies an interesting method for optical design via a self-improving agent
-
The paper introduces LensArenaEx, a benchmark source to support this domain.
-
Experiments demonstrate consistent gains across LLM backbones.
Critical weaknesses
-
The most confusing point for me is that the recursive self-improvement mechanism is not formally defined in the setting of this paper. Even Eq.3 writes , but is only a score table with control values. So the authors never seem to specify how the scores become actions or what the LLM does inside G.
-
The promotion rule can accept overfit candidates. is measured on the same development tasks used to build the candidate, the same LensArena tasks are reused every round without multiple-testing correction, and the tolerance lets small regressions accumulate across rounds. It would be better to provide clarification on that.
-
The policy class is too coarse for lens design. Edits cover only radius, spacing, and conic; surfaces are pooled into front/middle/rear, and the function Q ignores the specification x, so one score is shared across wide-angle and narrow-field tasks.
-
Some figures are too small to read. And Fig. 2 contains typos (e.g., 'Postive' should be 'Positive').
Questions for authors
Please see my Weaknesses section.
3 comments
Response to Reviewer MpHq - Part 2
W3: Coarse action categories and dependence on specification x.
The front/middle/rear categories are memory-sharing keys, not the resolution of physical edits. Every executed edit still targets a concrete surface and parameter. Relative regions allow experience to transfer between prescriptions with different surface counts, rather than requiring every surface index to have an independent history.
The full decision process also depends on the task specification. The memory resolver receives both the targets and current measurements. Its task-context preferences distinguish lens-element counts and FoV regimes, while the compact state includes the RMS-to-target ratio, MTF margin, search phase, and validity. The planner receives the specification as well. The execution therefore does not apply a single undifferentiated preference to every wide-angle and narrow-field task.
The local table is a compact component of this process, not a representation of every physical variable in . Task-context preferences and state-conditioned entries are combined with fallback rules, so we do not claim a separate full table for every specification. The representation’s utility is tested by the State-blind control: on LensArenaEx, Avg. RMS improves from 336.2 to 184.4 μm and Success from 38.0% to 58.7% with the full method. These results support useful state-dependent transfer despite the compact representation.
W4: Figure readability and spelling.
Thank you for pointing this out. We have replaced Fig. 2 in the rebuttal manuscript with the corrected framework PDF. We will also improve figure readability and correct the remaining typographical issues.
Questions for Authors: “Please see my Weaknesses section.”
The four responses above address the questions in the same order: policy execution, promotion and overfitting, policy granularity and specification dependence, and figure presentation.
Kind Request to Review Our Rebuttal and Updated Manuscript
Dear Reviewer MpHq,
Thank you for your time and thoughtful feedback. We have posted our point-by-point responses, including additional experiments and clarifications, and uploaded the revised manuscript and supplementary material. We would greatly appreciate it if you could review these updates when you have a chance. If any questions or concerns remain, we would be happy to provide further explanations or discuss them with you. Thank you again for your time and consideration.
Best regards, Author of Submission #10190
Response to Reviewer MpHq - Part 1
Thank you for your comments and for recognizing the value of optical policy improvement and the consistent results across foundation models. We respond point by point below.
W1: How scores become actions and what the LLM does inside G.
The notation πt=(Mt,Ct) identifies the inherited policy state. A fixed executor reads this state to generate concrete actions. Eq. 3 abbreviates this execution process, rather than treating a score table as a standalone action generator. An explicit way to write it is
ak=F(sk,x;Mt,Ct),
where F is the fixed task-level executor. It constructs candidate edits with specific surface indices, parameter values, directions, and step sizes. The memory resolves action preferences using the current optical state and available task context. Higher-scoring edits receive priority, while the execution schedule retains baseline search coverage. These are priorities over measured candidates, not predictions that replace the simulator.
The LLM has two distinct roles. During task execution, it proposes allowed optimizer settings from the specification and measured state, with inherited controls and routes affecting the executable program. During policy improvement, it proposes allow-listed program revisions from Development evidence. The memory update and proposed program controls form an isolated candidate πt+1. LensHarness decides whether that candidate becomes active.
The supplementary section on State-Conditioned Cross-Task Policy Update already explains action reordering and the use of scores as planner context. Its execution examples show a proposed program followed by an inherited state-route override. These details specify the execution path behind πt and G.
W2: Development overfitting, repeated promotion, and tolerance accumulation.
Development improvement is a learning-side requirement, not the claim of generalization. Candidate generation uses Development trajectories, and promotion also requires comparison on a fixed 60-task stratified subset of LensArena. These tasks do not overlap with Development. The final policy is then tested on LensArenaEx, whose results never influence learning or promotion. Full LensArena results include the promotion subset and are not presented as held-out test evidence.
Reusing promotion tasks can lead to adaptive selection effects. The gate uses fixed empirical thresholds rather than a sequence of statistical significance tests, so it should not be interpreted as a hypothesis-testing guarantee. The evidence for transfer comes from the separate LensArenaEx evaluation.
The tolerance is a local acceptance margin, not a guarantee of monotonic validation improvement from the initial policy. Small permitted regressions could accumulate in principle. The empirical effect of verification is tested in Table 2: on LensArenaEx, removing the gate changes Avg. RMS from 184.4 to 252.3 μm and Success from 58.7% to 46.0%. These results support independent verification before inheritance, without treating the gate as a universal guarantee against overfitting.