Weakness 1: The success criterion does not verify correspondence with the target fixed points
Section 2.2 defines preservation through correspondence with the target fixed points, and Proposition 1 uses target reproduction as a premise. Section 3.3 and Appendix D.3, Eqs. (14)-(15) and (A38)-(A40), instead test five admissible fixed points in visited regions, five visited symbols, and a distributional threshold. Neither these tests nor Appendix E.4's chain-like symbolic organization quantify pointwise correspondence with the Chua targets in Appendix C.1. This leaves a premise for interpreting the models as faithful minimal realizations unverified. The introduction motivates fixed points through their local dynamical roles. If skeleton preservation is intended to include these roles, the local types of matched points also need validation.
Weakness 2: The fidelity metric does not explicitly account for out-of-range generated mass
Appendix D.2 constructs a histogram with 30 bins per dimension over the target trajectory's coordinate ranges. It excludes generated samples outside those ranges, adds 10−5 to each cell, and normalizes. The excluded fractions are not reported. Eqs. (15) and (A40) classify high fidelity using Estsp<2.0, so the criterion depends on the smoothed, normalized in-range histogram without explicitly penalizing out-of-range probability mass. Figure A2 provides representative trajectories but does not quantify this omission's effect on the overall success rate. Reporting excluded fractions and accounting for this mass would establish whether the classifications and method comparison are robust.
Weakness 3: The independent benefit of structural selection has not been isolated
Section 3.1 selects reduced structures by separating the parent's FP symbols; actual dynamics are established through retraining, as Section 3.2 and Appendix A.3 explain. Appendix E.2 and Figure A1 fix the selected structures and parent initialization while varying teacher information, guidance losses, and synchronization. They support guided retraining, but do not establish an advantage for the proposed selection over other masks retaining the same number of ReLUs. A comparison with random masks of the same capacity, matching parent parameters, teacher guidance, and training budget, would test the central structural addition.
Minor comments
- Section 4.2 reports 26 parents with a five-symbol candidate, including 25 with a three-ReLU, five-symbol candidate. Appendix E.2 attributes the additional four-ReLU candidates to two parents whose trees reach five symbols only at four ReLUs. These statements require at least 27 parents with five-symbol candidates. Please reconcile the counts using per-parent candidate records and state whether the parent-balanced rates need updating.
- Figure A3 reports approximately 73% success at threshold 2.0, whereas the main capacity-matched comparison reports approximately 71%. Appendix E.3 should specify the candidate pool used for this threshold scan, as Appendix E.2 does for the guidance ablation.
Response to Reviewer aCcw
Note:
rebuttal_aCcw.pdf).ICLR2027_AL_RNN_rebuttal_all_changes_highlighted.pdf).Response to Reviewer aCcw
Thank you for your comments. We have expanded the evaluation beyond 3-scroll Chua to include 4- and 5-scroll Chua, the Dadras 4-wing system, and 2- and 3-bit flip-flop memory. We also reorganized the presentation and added controlled comparisons to test which ReLU units should be linearized.
1. Presentation and readability
Reviewer comment
Response
To make the expanded experiments easier to follow, we present the attractor-reconstruction and memory results in a consistent format (Section 4). Figures 2 and 3 follow the same progression: illustrations of each task’s goal, the trade-off between direct-training performance and symbolic complexity that motivates our approach, and the results of reduction-guided retraining. This gives readers a consistent progression through the experiments and makes comparisons across task families easier to follow. Detailed training procedures and evaluation definitions are collected in Appendices C and D, keeping the main results focused on the findings.
To make the reduction process easier to follow, we added step-by-step visualizations showing how successive ReLU linearizations merge symbolic regions and simplify their transition graphs (Figures A6 and A8).
For the added computational-cost comparison, we use a flowchart to explain the search procedures and stacked bars to show their cost components (Figures A12 and A13; Appendix G).
2. Experimental breadth
Reviewer comment
Response
We expanded the evaluation from 3-scroll Chua to six tasks, adding 4- and 5-scroll Chua, Dadras 4-wing, and 2- and 3-bit flip-flop memory.
Reduction-guided retraining improves minimal-realization success across all six tasks. On the added autonomous systems, success increases from 3% to 49% for 4-scroll Chua, 3% to 8% for 5-scroll Chua, and 0% to 15% for Dadras (Section 4.1; Figure 2(c)). On memory tasks, success increases from 48% to 92% for 2-bit memory and from 29% to 78% for 3-bit memory (Section 4.2; Figure 3(c)). Within the Chua and memory families, direct training generally becomes less reliable at finding minimal models as the number of target fixed points increases. Reduction-guided retraining retains an advantage in these harder settings.
The expanded evaluation also reveals a computational benefit (Table A4; Figure A13). On 4- and 5-scroll Chua and both memory tasks, direct training first finds minimal models above the parent-estimated lower bound capacity. Our method avoids a separate capacity sweep and reduces the estimated average cost of finding the first minimal model by approximately 2.7–4.3-fold relative to parent-informed direct search, even after including parent training and reduction.
3. Control for fixed-point-guided selection
Reviewer comment
Response
We added matched random ReLU-linearization controls on 3- and 4-scroll Chua and both memory tasks (Appendices E.5 and F.3). We exclude randomly drawn sets that coincide with that parent's selected candidates, so these off-tree controls directly compare alternative choices of units while matching parent initialization, remaining capacity, and retraining settings.
With gradual linearization and no auxiliary guidance, replacing off-tree controls with tree-selected sets raises minimal-realization success from 21% to 80% on 3-scroll Chua and from 14% to 71% on 4-scroll Chua (Figure A5). Memory-state recovery similarly rises from 45% to 92% for 2-bit memory and from 23% to 97% for 3-bit memory (Figure A10). The advantage persists with parent-state guidance and abrupt linearization. Both protocols also show better fixed-point correspondence for tree-selected sets. These controls identify fixed-point-guided ReLU selection as a key contributor to the improvement.