- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
FlowPlan employs a single-stage joint continuous-discrete flow matching model to address the problem of generating floor plans based on building footprints. Instead of sampling room diagrams or edge structures before generating geometry, this method predicts corner coordinates, room connectivity, and room type solely based on the vectorized building footprint encoded through a cross-attention mechanism.
Critical strengths
1.This paper employs a clear and concise design: room and corner indices are generated within the same model, thus eliminating the need for a separate edge prediction stage to reconstruct connectivity. Furthermore, the shared backbone network allows for controlled comparisons of continuous, discrete, and order-variable formulas. I believe this is a valuable solution approach.
2.The paper is clearly structured, and experiments effectively demonstrate the effectiveness of the method.
Critical weaknesses
-
The main baseline is a GSDiff pipeline reconstructed based on a zero-thickness shared edge convention and converted back to the original format with the average wall thickness. This adjustment may help the baseline, so the size of the header gap cannot be entirely attributed to the joint generation, but rather to the choice of transformation and post-processing.
-
This comparison only includes one baseline model. Given that existing planar graph generation methods, including rule-based methods (e.g., Holodeck [1]), can also partition space based on common sense and user needs, could the authors provide more comparative models to better demonstrate the advantages of the proposed method?
-
As shown in Section 4.5.4 (Failure Cases), the proposed method seems to be limited by its training data and planar graph configurations. Could the authors further explore the generalization ability of this method to unseen planar graphs and more diverse spatial layouts?
[1] Holodeck: Language Guided Generation of 3D Embodied AI Environments
Questions for authors
-
This comparison only includes one baseline model. Given that existing planar graph generation methods, including rule-based methods (e.g., Holodeck [1]), can also partition space based on common sense and user needs, could the authors provide more comparative models to better demonstrate the advantages of the proposed method?
-
As shown in Section 4.5.4 (Failure Cases), the proposed method seems to be limited by its training data and planar graph configurations. Could the authors further explore the generalization ability of this method to unseen planar graphs and more diverse spatial layouts?
3.In the experiment, I want to investigate whether learning-based methods have a speed advantage, since the reasoning process shown in the teaser is step-by-step (200 steps in total), which means inference time could be a disadvantage. I'd like to see some concrete comparative results; could you explain and demonstrate that?
2 comments
Here, we are addressing the concerns of the reviewer.
Additional baseline and dataset
The reviewer asks for additional baseline models to further demonstrate the performance of our approach. We provide new results comparing our method against the recent state-of-the-art autoregressive approach FMLM on the MagicPlan dataset and also report further results for all the models on the RPLAN dataset. Notably, our reproduced results for GSDiff on RPLAN closely align with those reported in the FMLM paper. Furthermore, like Holodeck, FMLM is a language modeling-based approach. However, we select FMLM for our comparison because it is explicitly designed for floorplan generation and represents the current state-of-the-art performance in this domain.
MagicPlan Dataset
| Model | Type | #Params (in millions) | FID | FID-Geom | FID-Dino | IoU |
|---|---|---|---|---|---|---|
| GSDiff | Parallel | 137 | 12.49 | 27.82 | 138.20 | 0.88 |
| FMLM | AutoRegressive | 135 | 4.31 | 14.67 | 44.68 | 0.90 |
| Our | Parallel | 144 | 3.08 | 18.30 | 30.48 | 0.96 |
RPLAN Dataset
| Model | Type | #Params (in millions) | FID | FID-Geom | FID-Dino | IoU |
|---|---|---|---|---|---|---|
| GSDiff | Parallel | 137 | 12.05 | 10.60 | 92.25 | 0.95 |
| FMLM | AutoRegressive | 135 | 1.24 | 11.57 | 42.68 | 0.96 |
| Ours | Parallel | 144 | 1.37 | 5.71 | 16.52 | 0.99 |
Effect of preprocessing and postprocessing pipeline on GSDiff performance
The reviewer challenges the effect of the preprocessing and postprocessing pipeline on the performance of GSDiff. To address this we also report results on RPLAN. Because GSDiff requires no preprocessing or postprocessing on RPLAN, the results more accurately reflect its performance. Moreover, the performance ranking of the models remains identical across both datasets, suggesting that our processing pipeline is a valid proxy for datasets with wall gaps.
Generalization ability of our approach
The reviewer requests experiments on unseen footprints to evaluate the generalization ability of our approach. In Appendix D, we present cross-dataset generalization experiments between our two evaluated datasets, performing inference on footprints from the unseen dataset. It is important to note that RPLAN contains simpler, Manhattan-type building footprints with fewer vertices on average compared to MagicPlan (13 vs. 17). We observe that the model trained on RPLAN struggles to follow non-Manhattan building footprints, included on MagicPlan, and exhibits difficulties with complex boundaries. Conversely, the model trained on the more diverse MagicPlan dataset generates in most of the cases valid floorplans when conditioned on the simpler Manhattan-type footprints of RPLAN. This further validates our adoption of MagicPlan as our main benchmark.
Inference speed
The reviewer is concerned about the inference speed. Compared to other learning-based methods we achieve fast inference independently of the dataset. On MagicPlan we report inference times per floorplan in ms:
- GSDiff: 909.54
- FMLM: 760.23
- Ours: 249.68
On RPLAN we report:
- GSDiff: 729.20
- FMLM: 202.76
- Ours: 236.60
For FMLM, the difference in speed is caused in part from the fact that MagicPlan requires on average more tokens to describe a sample floorplan, requiring 162 tokens in contrast to 126 tokens required for an RPLAN sample.
We thank the reviewer for their constructive feedback. Before we proceed to address the questions we would like to report new improved results, achieved by performing stochastic inference using the same trained model, i.e. this is an inference time adjustment. We observe that injecting noise during the inference of continuous quantities (coordinates) substantially improves both quantitative and qualitative results. Our intuition is that this noise injection helps the model recover from sub-optimal trajectories in under-explored regions. Specifically, instead of performing a standard Euler step:
xtn+1=xtn+vθ∆t,
we adopt a two-step procedure, referring to this as Renoising:
Furthermore, regarding the discrete quantities, we found that applying corrector sampling[1], which increases the probability of re-masking a token at each step, also yields consistent improvements. Quantitative and qualitative ablation results on the MagicPlan dataset are reported in the table below and in Figure 12 in Appendix A.2
MagicPlan Dataset | Inference settings ablation
[1]Itai Gat, Tal Remez, Neta Shaul, Felix Kreuk, Ricky T. Q. Chen, Gabriel Synnaeve, Yossi Adi, and Yaron Lipman. Discrete flow matching. In Proceedings of the 38th International Conference on Neural Information Processing Systems, volume 37 of NIPS ’24, pp. 133345–133385, Red Hook, NY, USA, December 2024. Curran Associates Inc. ISBN 979-8-3313-1438-5.