- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes TREAD, a transferable RTL optimizer that learns rewrite policies reusable across designs through imitation learning, offline reinforcement learning, same-state synthesis supervision, and residual search. TREAD constructs trajectories using e-graphs, encodes states with graph neural networks, selects rule-position pairs via a factorized policy, assigns long-term credit using trajectory returns, and generates counterfactual synthesis data for local preference signals.
Critical strengths
RTL optimization is a practical bottleneck in the hardware design flow. TREAD combines offline RL with synthesis feedback to reduce online synthesis calls, which is a sound idea with a well-equipped set of methodological components. It also includes thorough system design and ablation studies, demonstrating tangible efficiency improvements.
Critical weaknesses
- In my view, the main issue with this paper is that the core methodology consists entirely of a combination of known techniques, including imitation learning for policy initialization, offline TD learning, double Q-networks, reward predictors, and residual search. No new learning methods or theories are introduced specifically for RTL optimization, resulting in limited novelty.
- The experimental scale is relatively small. The number of valid designs mentioned in Section 4.2.3 is limited. For MIPS, only 10–13 designs are used. Furthermore, the experiments lack statistical significance testing, and the RL component lacks stability testing. Additionally, a direct comparison with ABC-RL is missing.
Questions for authors
- Please provide a detailed comparison with existing methods, including whether new ideas or observations are introduced, as well as comparisons with key baselines, including an adapted comparison with ABC-RL and variants of ROVER combined with synthesis feedback.
- Could the authors expand the experimental scale? For example, use more random seeds, include statistical significance tests, and report means and standard deviations.
- Please report the total number of DC invocations and the runtime for trajectory collection and counterfactual synthesis. Currently, I cannot determine whether this computational cost would be prohibitive.
- How were the hyperparameters in Equation (18) determined? There seem to be quite a few hyperparameters to tune, it might be worth investigating whether different settings could yield better results.