- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper raised a very interesting Lithographic Mask Optimization; this method applies differentiable Manhattan Primitive Representation and combined with adaptive splitting and pruning mechanism. The experiment results show in different layout scales can get good performance of printing fidelity and mask complexity. Main contribution includes:
- Differentiable Rectangle Renderer: Support continuous optimization of rectangle parameters and preserve Manhattan geometry simultaneously.
- Lithography-Guided Adaptive Refinement: Split and prune primitives based on printing loss.
- Globally Shared Primitive Representation: Supports window-wise optimization for full-chip layouts while maintaining cross-window consistency. On ICCAD13 and CHIP-L benchmarks, the raised method performs well on L2 loss, edge placement error, process variation band, and mask complexity. In full-chip experiments, L2 and PVB decrease 34.2% and 9.1% correspond to best baseline respectively. Mask rule checking and ablation studies also shows this raised method works.
Critical strengths
- Differentiable Rectangle Renderer: The splitting criterion based on gradient discrepancy can identify local optimization needs that are obscured by gradient cancellation. This supports continuous optimization of rectangle parameters and preserves Manhattan geometry simultaneously.
- Strong empirical results across multiple scales. Mask rule checking and ablation studies also shows this raised method works.
Critical weaknesses
- Relatively high computational cost: According to experiment results, runtime of this Manhattan method (7427.01s) is obviously longer than some baselines, especially the learning-based methods (87.43s). I understand performance of printing fidelity and mask complexity performs very good, but I am concerned that the extra computation cost might restrict this method’s application. Author should clarify the trade-off here, help reader evaluate practical application value comprehensively.
- Geometric constraints are satisfied by how: I understand authors mentioned minimum width/spacing/notch size and so on constrain, but the details implementation is still limited. Especially primitive parameters continuous updates and splitting and pruning operations. More than that, I am also wondering how authors ensure the whole resulting geometry can satisfy corresponding mask design rules.
Questions for authors
- Constraint Guarantee: After continuous updates, splits, and pruning, does the design rule for rectangular unions still provide strict guarantees, or is it verified only through post‑hoc MRC checks?
- Splitting criterion: What is the fundamental difference between the gradient‑difference criterion and the existing gradient‑based adaptive refinement? Does Figure 7(b) constrain the final number of primitives and the computational cost to ensure a fair comparison?
- Experimental fairness: In CHIP-L, do the retrained learning-based baselines properly separate the training and test sets according to the original design, thereby preventing data leakage? Are the lithography settings and manufacturability requirements consistent across all methods?
2 comments
Rebuttal (2/2)
Q2/W1: Splitting, fairness and runtime
Q2 — What the splitting criterion measures. Existing gradient-based adaptive refinement, such as densification in 3DGS, ranks primitives by the magnitude of their own positional gradient; the parent-gradient (Grad.) baseline in Fig. 7(b) follows this rule. Parent-gradient ranking measures the sensitivity of the loss to a shared update of the primitive. Our criterion measures the sensitivity to a differential update that a split would enable. A temporary bisection leaves the mask unchanged, and the new internal interface contributes no boundary gradient under our backward convention (§3.2, L234–237). In the coordinates selected in Eq. (5), g₁+g₂ gives the gradient for updating the children together, while g₁−g₂ gives the gradient for updating them differentially. When two parts of an edge need to move in opposite directions, the shared gradient can be small even though the differential gradient is large, so a parent-gradient criterion can overlook primitives that need finer control. The ratio in Eq. (6) uses these signals to determine when to refine.
Q2 — Comparison controls in Fig. 7(b). Fig. 7(b) controls the refinement budget rather than the final primitive count or runtime. All variants start with 500 primitives, run for 500 iterations, and use the same split and prune schedule and per-round caps (24 split candidates and 12 accepted removals; Supplementary Table 1 and Algorithm 1). The comparison varies only how split candidates are prioritized (§4.4, L484–490). Each variant therefore has the same opportunity to split and prune, while the realized final primitive counts can differ as a result of the selected splits. Child-gradient scoring reuses the existing lithography gradient and requires no additional lithography simulation; on ICCAD13-S, splitting and scoring take about 61 ms per case out of the 9.73 s mean TAT (PLY3 W4). Under these controls, discrepancy-based ranking achieves 1.90 nm EPE and 257.9 shots, compared with 2.38 nm and 362.1 shots for parent-gradient ranking and 2.40 nm and 385.2 shots for random ranking. Thus, the gain comes from which primitives are split under the same budget, not from a larger refinement allowance.
W1 — Full-chip runtime. On CHIP-L3, Manhattan Assembly takes 7,427.01 s (2.06 h) per layout, compared with 86.43 s for LVM-MO. This is a substantial cost for the gains in printing fidelity and mask complexity. Our TAT includes per-layout optimization, refinement, and the in-loop geometric checks described in Q1. LVM-MO's TAT measures inference and excludes training. Both learned baselines were retrained for CHIP-L (§4.2), while Manhattan Assembly requires no training data. Our response to wYhP Q4/Q5 and Supplementary Fig. 4 report the quality–runtime trade-off on ICCAD13-S. The revised manuscript clarifies the timing scope in §4.1 (L362–366) and the refinement controls in §4.4 (L484–490), with schedules and caps in Supplementary Table 1 and Algorithm 1.
Q3: Train/test separation and evaluation fairness
Train/test separation. Yes. We split the data by original RTL design: training and test layouts were generated from disjoint sets of RTL designs. As described in §4.2 (L424–427), we retrained TokMan and LVM-MO using their original configurations and evaluated them on the held-out CHIP-L cases. The ten CHIP-L3 layouts and their CHIP-L1 and CHIP-L2 crops were held out together; neither the test layouts nor any windows extracted from them were used for training.
Common evaluation. We evaluate all final CHIP-L masks using the same lithography simulator and process parameters (§4.1) and the same implementations of L₂, PVB, EPE, and shot count (Supplementary B). Shot counts are computed by applying the same greedy rectangular decomposition to each final binary mask, independently of the number of primitives used during optimization. For the mask-rule comparison, we apply the same thresholds to all masks in that comparison: 20 nm minimum width, 20 nm minimum spacing, and 10 nm minimum notch size (Supplementary Table 1).
Rebuttal (1/2)
Q1/W2: Constraint guarantees across updates, splits and pruning
We enforce the specified geometric rules during optimization. The final mask-rule check (MRC) verifies compliance; it does not repair the mask.
Rules on primitives and the assembled mask. We impose a 20 nm minimum on each rectangle's width and height. On the assembled union, we check a minimum junction width of 20 nm, a minimum spacing of 20 nm between disconnected features, and a minimum notch size of 10 nm. We also check offsets between parallel exposed edges separately: the edges may align, but a nonzero step must be at least 20 nm. End faces with two convex corners follow the width rule, whereas trench bottoms with two concave corners are subject only to the 10 nm notch rule. These checks are expressed as differences between edge coordinates (§3.3, L251–260; Supplementary §D, L216–229).
Enforcement during optimization. After a continuous update, we project violating coordinate differences to their nearest feasible values, recompute the exposed contour and connected components, and repeat projection and checking until all rules are satisfied. This rechecking is necessary because changing one coordinate can affect several constraints. A split preserves the union and is accepted only if both children meet the primitive size bounds and the assembled mask satisfies the rules. Subsequent independent updates undergo the same contour checks. A pruning step is accepted only if the remaining union satisfies the geometric rules. Thus, the guarantee applies to the specified checks on accepted states, and the final mask requires no separate geometric repair.
Verification. Figure 6 reports zero width, spacing, and notch violations on ICCAD13-S and ICCAD13-L. On ICCAD13-S, we also observed no edges or jogs shorter than 20 nm, with a minimum measured edge length of 20.1 nm. The absence of trench bottoms in the 10–20 nm range is an empirical result, not an additional constraint. Without geometric constraints, the corresponding averages were 735.1 short edges and 582.4 short jogs per case (see our response to wYhP Q2/W2). The rules and update procedure are provided in Supplementary Section D and Algorithm 1.