- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes Re-Conditioned Decoding (ReCoDe), an inference-time search framework for generative logic synthesis. Unlike existing token-level search methods such as CT+MCTS, which explore decoder continuations from a fixed encoding, ReCoDe iteratively re-encodes intermediate circuits to explore alternative conditioning representations. The method integrates this strategy with a population-based genetic algorithm employing truncation selection and stochastic sampling, without modifying the underlying model. The authors evaluate ReCoDe on IWLS fanout-free windows with 8, 10, and 12 inputs, as well as using a second backbone (GTAC) and in approximate synthesis. The results demonstrate improvements over single-pass decoding and MCTS, with competitive performance against classical synthesis methods.
Critical strengths
- The paper identifies the limitations of fixed-conditioning token-level search and presents a well-motivated alternative. The comparison with MCTS-1000 under an equal decoding budget is particularly relevant.
- ReCoDe demonstrates improvements across different window sizes and two model backbones. At K=8, ReCoDe-100 also achieves comparable performance to MCTS-100 while running 5.6 times faster.
Critical weaknesses
- ReCoDe combines iterative re-encoding with population-based search, but their individual contributions remain unclear. A fixed-conditioning best-of-N baseline with matched sampling strategies is missing, and MCTS-1000 employs a different search procedure. The existing ablation also modifies the decoding strategy, making it difficult to distinguish the benefits of re-conditioning from those of sampling diversity and selection.
- Runtime comparisons between ReCoDe-1000 and &deepsyn are missing, leaving computational fairness unclear. Furthermore, the reported advantage over &deepsyn depends on excluding decoding failures. When all windows are included (Table 2), their performance is approximately equivalent, weakening the claim of superiority.
Questions for authors
- Could the authors provide a fixed-conditioning best-of-1000 sampling baseline and a controlled ablation that separates the effects of re-encoding and population-based selection?
- What are the runtimes of ReCoDe-1000 and &deepsyn? Could the authors compare their performance under matched wall-clock budgets, including all decoding failures?
- Could the authors extend the key ablations to a larger set of circuits with statistical analysis and investigate whether the improvements translate to a complete synthesis flow?
4 comments
Follow-up to Reviewer 3mgA
As the discussion period closes on November 18 (AoE), we wanted to check in. Thank you again for your thoughtful review. Our previous response reported the baseline, ablations and complete synthesis flow you asked about.
We extended the key ablations from five hard windows to 200 windows per width, with 3 seeds and paired per-window tests. The fixed-encoding best-of-1,000 baseline uses the same decodes, sampling strategies and batched decoding as ReCoDe, and removing re-encoding is the largest effect of any factor, significant at every width (Figure 1E). Counting every window, including decode failures, CT+ReCoDe-1000 is below &deepsyn at every width, significantly at K=10 and K=12 (Figure 1). It is also significantly smaller than CT+MCTS-1000 at every width, on 800 windows per width (Table 1). In a complete synthesis flow on EPFL designs, CT+ReCoDe-1000 gives the smallest or tied-smallest design on all four (Table 3).
On computational fairness, following a suggestion by Reviewer 9CdF, we also compared CT+ReCoDe against the best of N independent &deepsyn restarts at matched wall-clock time on one CPU core, and at matched hardware on 24 cores, one H100's share of its server (Section 4.2, Figure 5, Appendix D). We have since extended CT+ReCoDe to 10,000 decodes, and found it keeps improving at every width. From about 3,000 decodes onward, CT+ReCoDe is smaller at every width in both settings, and at 10,000 decodes it is significantly smaller than the best of all &deepsyn restarts at every width (sign test, p < 0.001). In the revised PDF, this round's changes are marked in green and the earlier ones in red.
We would appreciate knowing whether our response addressed your concerns. If it did, we would be grateful if you would consider updating your rating. We are happy to clarify anything further.
I appreciate the authors' detailed response and additional experimental results. The controlled ablations provide stronger evidence of the effectiveness of re-encoding, while the expanded evaluations and complete synthesis flow address most of my earlier concerns.
Nevertheless, I remain concerned about the significance of the overall contribution. Although the controlled ablations demonstrate the benefits of re-encoding, the improvements over the fixed-conditioning best-of-1000 baseline remain relatively modest, particularly for larger windows.
Furthermore, the complete synthesis flow raises additional questions regarding practical effectiveness. For example, on mem_ctrl, ReCoDe-1000 reduces the AND count from 46,656 to 46,641 compared with &deepsyn, while requiring 10.4 hours rather than 1.2 hours. Although the matched wall-clock experiments indicate that extending the runtime of &deepsyn does not substantially improve its results, it remains unclear whether such marginal gains justify the additional computational cost.
Moreover, prior work [1] reports substantially greater reductions in AIG size on the same EPFL benchmark designs. For example, a single application of ABC's compress2rs reduces mem_ctrl to approximately 43,923 AND nodes. Although these results are not directly comparable without verifying that identical initial netlists and optimization settings were used, they suggest that the complete-flow evaluation would benefit from comparisons against stronger classical synthesis flows.
Overall, while the additional results strengthen the empirical validation, they do not change my assessment of the paper's contribution.
References [1] S.-Y. Lee, Contemporary Logic Synthesis: With an Application to AQFP Circuit Optimization, Ph.D. dissertation, EPFL, 2024.
New complete-flow experiment with compress2rs, and clarifying the contribution
Thank you for reading the new results. We answer your remaining concerns in turn.
1. Size of the improvements. The margins of generative models over the heuristics are small in this line of work, where every circuit must stay exactly equivalent to its input. In the Circuit Transformer paper (Li et al., ICLR 2025), the leading method, CT+MCTS, is 0.5% below Resyn2. Our baseline &deepsyn is stronger, 3 to 8% below Resyn2 on our windows. Measured against &deepsyn, the Circuit Transformer with one decode is 8 to 14% larger, CT+MCTS-1000 is still 0.1 to 0.9% larger, and CT+ReCoDe-1000 is 0.6 to 2.5% smaller (Table 1). Re-encoding is what makes this difference, and its effect is significant at every width (paired 95% CI). With the same 1,000 decodes, a fixed encoding does not get below a single &deepsyn run at any width, and re-encoding does at every width (Figures 1E and 5).
2. Stronger classical flows. ABC's compress2rs restructures the whole design. On our starting netlist it gives 43,924 ANDs on mem_ctrl, in line with [1], and we will add it to Table 3. The methods in Table 3 rewrite only 8-input windows, which cover at most 12% of mem_ctrl. Since the two are complementary, we applied the same window flow after compress2rs.
mem_ctrl: #AND with compress2rs + window flows applied after
| Method | #AND | Reduction after compress2rs |
|---|---|---|
| Original | 46,836 | |
| &deepsyn on windows (Table 3) | 46,656 | |
| CT+MCTS-1000 on windows (Table 3) | 46,643 | |
| CT+ReCoDe-1000 on windows (Table 3) | 46,641 | |
| compress2rs | 43,924 | |
| compress2rs + resyn2 | 43,875 | 49 |
| compress2rs + CT single decode | 43,835 | 89 |
| compress2rs + &deepsyn | 43,795 | 129 |
| compress2rs + CT+ReCoDe-1000 | 43,785 | 139 |
After compress2rs, CT+ReCoDe-1000 removes a further 139 ANDs, more than every other window optimizer, and it is smaller than &deepsyn on 32 of the 503 windows and larger on none (sign test, p < 0.001).
3. Cost. On mem_ctrl, CT+ReCoDe-100 is level with &deepsyn in about the same time (1.4 GPU-hours against 1.2 CPU-hours), and CT+ReCoDe-1000 reaches the size of CT+MCTS-1000 with 55× less GPU time.
Overall contribution. We added the complete synthesis flow at your suggestion. The main purpose of the paper is not a tool that replaces classical flows. The paper belongs to an emerging line of work on generative models for logic synthesis (Li et al., ICLR 2025). Generative models are highly successful in language and vision, but under exact equivalence they are only starting to match hand-engineered heuristics. Our contribution is a more effective way to spend inference-time compute in these models: re-encoding the model's own outputs instead of searching over decoder tokens from one fixed encoding. Relative to a single decode, the baseline that inference-time compute is meant to improve, CT+ReCoDe-1000 reduces the size of the hardest windows by 18 to 22% (Figure 1).
We also ran one further experiment, on a second problem that requires exact equivalence: shortening expressions in the Halide compiler, with every output proven equivalent by Z3. Details will be in the paper's appendix.
Halide: mean expression length in characters, reduction relative to the input, and time per expression (1,855 expressions)
| Method | Decodes | Length | Reduction | Time |
|---|---|---|---|---|
| Input | 65.90 | |||
| Z3 simplifier | 62.65 | 4.9% | ||
| Caviar | 55.26 | 16.1% | ||
| Halide's own simplifier | 52.58 | 20.2% | ||
| Our model, one decode | 1 | 63.72 | 3.3% | |
| Fixed encoding, best of N | 100 | 52.43 | 20.4% | 75 ms |
| MCTS | 100 | 52.68 | 20.1% | 237 ms |
| ReCoDe | 100 | 51.75 | 21.5% | 74 ms |
| Fixed encoding, best of N | 1,000 | 50.05 | 24.0% | 198 ms |
| MCTS | 1,000 | 50.04 | 24.1% | 431 ms |
| ReCoDe | 1,000 | 48.78 | 26.0% | 195 ms |
| ReCoDe | 2,000 | 48.05 | 27.1% | 339 ms |
With one decode, the model is behind all three symbolic simplifiers in the table (Z3, Caviar and Halide's own, which are built on hand-written rules). With ReCoDe-1000 it is ahead of all three, by 7% against Halide's own and 12% against Caviar, and ahead of MCTS and the fixed encoding at the same number of decodes, in less than half the time of MCTS (all significant, paired 95% CI). This illustrates one of the main points of our paper. In domains that require equivalence, exact as here or relaxed as in approximate synthesis, where neural models have so far been behind, ReCoDe is a general way to spend inference-time compute, and it lets generative models close the gap to hand-engineered heuristics.
We appreciate your noting that the ablations give stronger evidence for re-encoding and that the complete flow addresses most of your concerns. We hope these results address the remaining ones, and we would be grateful if you would reconsider your rating.
Response to Reviewer 3mgA
We thank the reviewer for the thoughtful review, and are glad they found ReCoDe a well-motivated alternative to fixed-conditioning search. The reviewer's questions helped strengthen the paper. All changes are in the revised PDF and marked in red.
W1 / Q1. Fixed-conditioning baseline and controlled ablation. We added the requested best-of-1,000 baseline and a controlled ablation on 200 windows per width with 3 seeds (Figure 1E). Every variant uses the same 1,000 decodes, the same sampling strategies and the same batched decoding as ReCoDe, and changes one factor. Fixed encoding always decodes from the original encoding and keeps the best result, removing re-encoding. Population size 1 keeps a single parent per generation, and random selection picks the 20 parents at random instead of the 20 smallest.
Removing re-encoding (mean #AND, 200 windows, 3 seeds)
Changing population and selection (same windows and seeds)
This separates re-encoding from sampling and selection. Removing re-encoding raises the mean by 0.63, 0.18 and 0.12 AND per window at K=8, 10 and 12. This is significant at every width (paired 95% CI) and larger than the effect of the population or selection rule.
W2 / Q2. All windows, runtime and matched wall clock. Figure 1 (page 7) now counts every window, including decode failures. CT+ReCoDe-1000 is below &deepsyn at every width, significantly at K=10 and K=12 (paired 95% CI).
Mean #AND, all windows (2,600, 3,000, 3,000)
The tie in the submission came from windows where no decode completed. We added a decode-failure step to ReCoDe’s search process for these windows. When no initial decode completes, ReCoDe continues its re-encoding search from a circuit reassembled from separately decoded logic cones (Algorithm 1). With the same splitting applied to CT+MCTS, CT+ReCoDe still produces smaller circuits with both 100 and 1,000 decodes at every width.
&deepsyn runs with a 1 s time limit on one CPU core, and CT+ReCoDe-1000 takes 172–248 s per window on one H100 (Table 2). For matched wall clock, we ran &deepsyn with time limits up to CT+ReCoDe-3000's time per window (Figure 5). Its mean size changes by less than 1%, while CT+ReCoDe keeps improving and ends smaller at every width.
Q3. Larger sets and a complete synthesis flow. In the submission, the ablation used five hard windows, the CT+MCTS-1000 comparison five windows per bucket, and only CT+ReCoDe-1000 had 3 seeds. Now the ablations use 200 windows per width, the CT+MCTS-1000 comparison 800 (Table 1), and Figure 1 all 2,600 to 3,000 windows. Every stochastic method has 3 seeds (CT+MCTS-1000 on the 200 windows of Figure 5), and we use paired per-window tests. Table 1's standard deviation is at most 0.04. We are continuing to add windows for the final version.
We also added a complete synthesis flow on EPFL designs (Table 3). To compare every method on each design, including CT+MCTS-1000 at 25–30 minutes per window (570 GPU-hours for mem_ctrl), we evaluate on int2float, router, ctrl and mem_ctrl. All methods optimize the same K=8 windows, with ABC cec on the whole design after every substitution, and &deepsyn gets a 10 s limit per window. CT+ReCoDe-1000 gives the smallest or tied-smallest design on all four. On int2float, the neural methods beat both heuristics. On router and ctrl, mostly easy windows, all methods are within one AND.
mem_ctrl after the complete flow
Of the 26 mem_ctrl windows where it and &deepsyn differ, CT+ReCoDe-1000 is smaller on 25 (sign test, p < 0.001). It matches CT+MCTS-1000 on size with lower delay (p = 0.013) and the lowest area of every method, using 55× less GPU time. We obtain these area and delay gains without targeting them, since both CT's training targets and ReCoDe's selection consider only #AND.
We hope these additions address each of the reviewer's points, and we would be grateful if the reviewer would consider raising their score. We are happy to answer further questions.