- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Latent Geometric Optimization (LGO), a generative optimization framework for 3D floorplanning. Instead of directly optimizing block coordinates, LGO employs a Transformer-based variational autoencoder (VAE) to learn a latent representation of complete floorplans. The decoder integrates graph-aware attention and spatial conditioning maps to capture circuit connectivity and geometric constraints, while an evolutionary algorithm searches the learned latent space to optimize half-perimeter wirelength (HPWL) and cross-die alignment. Experiments on eight MCNC and GSRC benchmarks show that LGO outperforms the published FlexPlanner results on seven out of eight instances, achieving an average improvement of 7.5% in the combined objective. The paper also presents zero-shot generalization experiments, ablation studies, and additional constrained packing experiments.
Critical strengths
S1. A framework for generative modeling and latent-space optimization. The paper presents a framework that combines generative modeling with latent-space optimization for 3D floorplanning. By learning a compact representation of complete layouts, the proposed method enables optimization of multiple geometric variables in the latent space. Furthermore, the integration of graph-aware attention, spatial conditioning, and autoregressive decoding allows the model to incorporate circuit connectivity and geometric constraints during layout generation. S2. Promising experimental results and useful supplementary analysis. The proposed method achieves competitive HPWL results across several 3D floorplanning benchmarks, with an average improvement of 4.4% over the previous best results. The authors also provide zero-shot transfer experiments and component ablations. In addition, the constrained packing experiments offer useful insights into how relational constraints affect the relative effectiveness of latent-space optimization.
Critical weaknesses
W1. The practical significance of the alignment improvements is not sufficiently demonstrated. One of the main objectives of this work is to improve cross-die alignment. However, the FlexPlanner baseline already achieves a high average alignment score of 0.940, while LGO improves it to 0.962, corresponding to an absolute improvement of only 0.022. Moreover, LGO performs worse than FlexPlanner on certain benchmarks, such as ami49 (0.886 vs. 0.955) and n300 (0.915 vs. 0.965). Given that the alignment metric is bounded by 1, the practical significance of these improvements remains unclear. More importantly, the paper reports average alignment scores without sufficiently analyzing whether the required cross-die alignment constraints are actually satisfied. A high average alignment score does not necessarily imply that all required block pairs meet their minimum overlap requirements. Reporting the proportion of fully satisfied alignment constraints and the distribution of alignment violations would provide stronger evidence of the practical value of the proposed method. W2. The experiments do not sufficiently isolate the benefits of the learned latent representation from those of extensive evolutionary search. The central contribution of this paper is the optimization of complete floorplans in a learned latent space. However, LGO combines a generative representation with a substantial test-time evolutionary search process. The reported improvements over FlexPlanner may therefore arise from the learned latent representation, the additional search budget, or both. In particular, the paper does not compare LGO against a FlexPlanner baseline equipped with repeated sampling and best-of-N selection under matched computational budgets. Such a comparison would help determine whether the additional VAE and latent-space optimization are necessary to achieve the reported improvements. Similarly, comparing evolutionary search with random latent sampling under the same number of evaluations would help quantify the contribution of the evolutionary optimization strategy. Although the paper includes a continuous optimization baseline in the additional packing experiments, these results do not directly establish the benefits of latent-space search for the primary 3D floorplanning task. Consequently, the central methodological advantage of the proposed framework remains insufficiently validated.
Questions for authors
Q1. Given that FlexPlanner already achieves near-saturated alignment scores, can the authors further explain the practical significance of the additional alignment improvements? In particular, can the authors report the percentage of cross-die alignment pairs that fully satisfy their required overlap constraints, rather than only reporting average alignment scores? Q2. Can the authors compare LGO against a FlexPlanner baseline using repeated sampling and best-of-N selection under matched wall-clock budgets? This would help clarify whether the reported improvements primarily result from the learned latent representation or from the additional test-time search effort. Q3. Can the authors provide an ablation comparing evolutionary latent-space search with random latent sampling under the same number of decoded candidates? Such an experiment would help isolate the contribution of the evolutionary search strategy.
We thank the reviewer for the detailed review and the questions. Numbers below refer to the revised version. Note: we will still change some of the formatting and might add some additional explanations to the revised version of the paper in the coming days.
W1 / Q1: Practical significance of the alignment improvements
Fully satisfied alignment pairs (Sec. 4.3, Table 5). We added the metric the reviewer asks for: the percentage of alignment pairs with aln(i, j) = 1, i.e. the smaller block is fully covered by its partner's projection. We compare LGO with our reproduced FlexPlanner agent, both optimizing the soft objective of Eq. 6. LGO fully satisfies more pairs on all eight circuits (mean 71.1% vs 37.7%), for example n200: 86.7% vs 23.9% and n300: 82.0% vs 39.3%. Because the objective only ranks candidates over a frozen decoder, we can also search directly for full alignment without retraining. This "strict" variant reaches 80–93% on every circuit (mean 82.0%) and lowers the soft objective by at most 0.063. The published FlexPlanner layouts are not available, so this metric can only be computed for our reproduced agent. We will also add a per-pair histogram of aln(i, j).
As the reviewer points out, an average alignment close to 1 does not mean that the constraints are met, and the two metrics above differ considerably. Since the average is bounded by 1, improvements should be read relative to the remaining room: going from 0.940 to 0.962 closes more than a third of it.
ami49 and n300 (App. E, Table 15). At the default weight (wA=0.5), LGO trades alignment for HPWL on these two circuits. With a higher alignment weight, chosen at search time without retraining, LGO exceeds FlexPlanner on both metrics:
Averaged over all circuits, wA=1 gives an alignment of 0.986 (vs 0.940), which closes about three quarters of the remaining gap, while mean HPWL is still 2.8% lower than FlexPlanner's (242,184 vs 249,054).
W2 / Q2 / Q3: Isolating the latent representation from the search budget
FlexPlanner with best-of-N at matched wall-clock (Q2; Sec. 4.1, Fig. 2). Figure 2 compares LGO with best-of-N stochastic sampling from FlexPlanner policies and with prior decoding, under the same wall-clock budget on n100, n200 and n300. LGO reaches a higher J on all three. On n100, FlexPlanner leads early before LGO overtakes it. The original FlexPlanner weights are not public, so these curves use our retrained agents (App. B).
Evolutionary search vs. random latent sampling (Q3; Sec. 4.4 "Without search", Table 7). With the same trained decoder, we sample latents independently from the prior and keep the best, under the wall-clock budget LGO uses for 200 rounds. The crossover/mutation step (Eq. 7) is negligible next to decoding, so random sampling gets at least as many decoded candidates as LGO. LGO wins on all eight circuits (mean J 0.5241 vs 0.4778).
Latent vs. direct search on the floorplanning task itself (Table 7, App. C.2). The reviewer notes that the continuous baseline only appeared in the packing experiments. We added a direct-search baseline for 3D floorplanning: the same genetic algorithm, operators, population and wall-clock budget, applied directly to block positions and footprints, with nearest-legal-position constraint handling. It is competitive up to 50 blocks but falls well behind from n100 upward (n300: 0.3121 vs 0.5310). The same search through a decoder with random weights reaches only 0.1661, so the decoder's masking alone does not explain the gains.
Finally, Table 14 shows that LGO improves on the best layout in its training data by 10.6% in HPWL and 9.0% in alignment on average.
Together, these results show that the improvements come from searching the learned latent space, not from the extra test-time budget alone.
We hope these additions address the reviewer's concerns. We are happy to clarify anything further.