REVIEW 4 major objections 5 minor 15 references
HouseTune: Two-Stage Floorplan Generation with LLM Assistance
T0 review · 4 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash
Pith's one-line read A two-stage pipeline — an LLM drafts a rough layout, then a dual-conditioned diffusion model refines it — beats prior floorplan generators on realism, diversity, and compatibility.
desk verdict A novel two-stage LLM-plus-diffusion idea undermined by an invalid forward-process derivation and contradictory ablation results. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing mechanism is the dual-conditioned noise process: the forward noising step adds the learned Layout-Init embedding $e(y)$ to every noisy sample, and the reverse update keeps using that embedding while predicting the denoised layout. The reverse network is a Transformer with three structured-masking attention types (component-wise self-attention, global self-attention, relational cross-attention), a continuous decoder for coordinate noise, and a discrete 'int2bit' decoder that rounds coordinates to 8-bit binary values to preserve collinearity and orthogonality.
What would settle it
Re-run the pipeline with standard DDPM forward noising while keeping reverse-only conditioning and compare FID and compatibility; if the scores match the reported values, the dual-conditioning mechanism in Eq. (4) is not the source of the gains. The alternative is to derive the posterior $q(x_{t-1}\mid x_t, x_0)$ for the modified forward process and check whether it equals the update used in Eq. (6).
Extended reading notes
Core claim
The central discovery is that conditioning a diffusion model on an LLM-produced Layout-Init in both the forward noising process and the reverse denoising process gives better final floorplans than conditioning only during denoising as HouseDiffusion does. The forward process injects the Layout-Init embedding $e(y)$ into every noisy sample via $x_t = \sqrt{\alpha_t}x_0 + \sqrt{1-\alpha_t}\epsilon + e(y)$, and the reverse process uses the same embedding when predicting the denoised layout. On RPlan, this two-stage recipe yields the best reported realism, FID-based diversity, and graph-edit compatibility scores across room counts 5 to 8, including a 28% diversity improvement and a 79% compatibility improvement over HouseDiffusion.
Load-bearing premise
The load-bearing premise is that adding the Layout-Init embedding directly into every noisy sample still behaves like a standard diffusion process, so that starting from ordinary random noise and reversing the noising steps stays valid; if that consistency is broken, the reported refinement gains collapse.
Editorial extensions
If this is right
- If the claim holds, text-to-floorplan systems can be built without large labeled layout-graph datasets: the LLM supplies the structural prior and the diffusion model handles geometric refinement.
- The dual-conditioning recipe is transferable: conditioning the forward noising process as well as the reverse process should improve other conditional diffusion tasks where a rough layout or structural prior is available.
- Natural-language interfaces become viable for non-expert users, since room counts, types, and approximate adjacency can be specified in plain text rather than bubble diagrams or exact geometry.
- The method's consistency across GPT-4o, DeepSeek-R1, and Doubao-1.5Pro suggests the prompting strategy, not the specific LLM, carries the first stage.
- The ablation results indicate that injecting too much conditional information degrades generation quality, so conditioning strength is a tunable knob rather than a fixed design choice.
Reading between the lines
- The success of this recipe suggests that any domain with a cheap, coarse spatial prior — furniture arrangement, warehouse layout, schematic diagrams — could adopt the same LLM-sketch-then-diffusion-refine pattern.
- An apples-to-apples benchmark in which HouseTune and Tell2Design receive identical plain-text prompts and identical room-count constraints would separate the benefit of the two-stage architecture from the difference in supervision.
- Because the paper reports that conditioning ratio strongly affects FID, a practical follow-up is to anneal the conditioning strength during training or sampling rather than keep it fixed.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes HouseTune, a two-stage text-to-floorplan generation framework. In the first stage, a multimodal LLM (GPT-4o) with a Chain-of-Thought prompt and a small set of demos produces an initial layout (Layout-Init) in JSON from a natural-language description. In the second stage, a conditional diffusion model refines Layout-Init into a final vector floorplan (Layout-Final), with conditioning applied both in the forward noising process and the reverse denoising process. The authors evaluate on the RPlan dataset against House-GAN, House-GAN++, HouseDiffusion, PuzzleFusion, and Tell2Design, reporting improvements in realism, diversity, and compatibility, plus ablations on one- versus two-stage generation, prompt design, LLM choice, and conditioning placement. The abstract claims state-of-the-art performance across all metrics.
Significance. If the method were sound, it would provide a practical text-to-floorplan pipeline that reduces reliance on domain-specific labeled training data and leverages LLM common-sense reasoning. The two-stage decomposition and the CoT prompting strategy are appealing and could inspire follow-up work. However, the central diffusion formulation is mathematically inconsistent as presented, and the experimental reporting has several gaps (missing appendix, no error bars, contradictory table prose). These issues currently prevent the paper from supporting its central claims.
major comments (4)
- [3.2.1] Equation (4) defines the forward process as xt = sqrt(alpha_t)*x0 + sqrt(1-alpha_t)*epsilon + e(y), so the marginal is q(xt|x0) = N(sqrt(alpha_t)*x0 + e(y), (1-alpha_t)I). At t=T this is approximately N(e(y), I). The reverse process described in Section 3.2.1 starts from a fully noised sample xT and applies Equation (6), which is the standard DDPM update derived for a forward process without the additive e(y) term. No posterior q(x_{t-1}|x_t,x0) is derived for the modified process, and the reverse chain is not initialized at N(e(y), I). Consequently, the noise-prediction loss in Equation (10) is not a valid variational bound for the sampling procedure, and the model is trained and sampled under inconsistent distributions. This is a load-bearing flaw: the claim of dual-conditioning diffusion refinement and the state-of-the-art results rest on a mechanism that is not mathematically well-defined as stated. The authors must reparameterize e(y) into the signal (e.g., xt = sqrt(alpha_t)(x0 + e(y)) + sqrt(1-alpha_t)*epsilon) or derive the corrected posterior and reverse initialization, then retrain and re-evaluate.
- [4.3] Table 3b and the surrounding text contradict each other. The prose states "as the conditional ratio increases, model performance gradually declines," but the table shows Macro IoU and Micro IoU increasing monotonically with the rate: 18.67%/15.43% at 1e-3, 20.12%/16.59% at 1e-2, and 21.37%/18.46% at 1e-1. Since the arrows in the table denote higher-is-better, the table implies the opposite conclusion. This matters because the conditional participation ratio is one of the method's free parameters, and the recommended setting is unclear from the present text.
- [4.1] The paper repeatedly refers to an Appendix for network architecture, implementation details, and the Text-to-Layout baseline (e.g., Section 3.2.2, Section 4.1, Section 4.2), but the arXiv v4 manuscript contains no appendix. The statement "Our code will be made publicly available" is not accompanied by a link or repository identifier. These omissions prevent reproducibility and make it impossible to verify the training setup or the one-stage baseline.
- [Tables 1-4] Tables 1 through 4 report no error bars, standard deviations, or significance tests. The headline claims, such as the 28% diversity improvement over HouseDiffusion (8.6 vs. 11.2 on task 5) and the 79% compatibility improvement, are based on single runs. Given the stochastic nature of both the LLM (temperature sampling) and the diffusion process, the absence of variance estimates does not support the abstract's claim of state-of-the-art performance across all metrics.
minor comments (5)
- [4.2] The numbers for HouseTune in the "unlabeled data" comparison (Micro IoU 21.84%, Macro IoU 17.75%) and in the "Training on Artificial Instructions Only" comparison (Micro IoU 15.69%, Macro IoU 11.43%) appear inconsistent; the paper should clarify which setting each number corresponds to.
- [3.2.3] Equation (11) uses symbols C^s and C^t that are not defined in the text; presumably these denote the predicted and ground-truth corner coordinates, but this should be stated explicitly.
- [Figure 1] The caption contains a typo: "Layou-Final" should be "Layout-Final."
- [References] The reference "What Makes In-Context Learning Work. Rethinking the role of demonstrations: ..." appears to be an incomplete citation; the authors should provide the full bibliographic entry.
- [4.2] The claim of a 79.88% diversity improvement over Tell2Design is not directly readable from Table 1 as formatted, because the table's column structure for Diversity across task sizes is ambiguous; the authors should present the comparison more clearly.
Circularity Check
The SOTA claim rests partly on a closed evaluation loop: the same LLM generates the test text from a reference layout and then generates the Layout-Init condition, while the metric compares against that same reference layout.
-
self definitional
[Section 3.1, Figure 2(b); Section 4.2, Figure 5 caption]
"Given a house layout sample, we use the LLM to describe it. The description is used to mimic the user’s demands. Using multiple examples as in (a) as demos, we ask the LLM to generate a Layout-Init for each sample. These initial layouts serve as conditions for the generator, which outputs Layouts-Final. ... The layout descriptions for HouseTune, Tell2Design’s annotations, and HouseDiffusion’s graphs are all derived from the reference samples shown in Fig.5(a)."
The paired text input is produced by having GPT-4o describe the reference layout, and the same GPT-4o is then used to generate Layout-Init from that text. Thus the diffusion condition (Layout-Init) is an LLM-generated summary of the very layout that later serves as the evaluation target. Compatibility and FID are computed against that same reference, so the reported metrics partly measure how much information the LLM can encode from the reference into its own text and Layout-Init, rather than an independent text-to-floorplan mapping. This closes the evaluation loop: the input text is defined in terms of the target layout, and the output is scored against the same target.
full rationale
The central two-stage construction is not Eq.-level circular: Layout-Init is an intermediate condition, Layout-Final is produced by a trained diffusion decoder, and the training losses (Eqs. 10-11) compare predicted noise and corners against external RPlan ground-truth values, so the output is not defined as the input by construction. The main circularity is in the evaluation protocol: because the paper creates paired text by asking the LLM to describe a reference layout, then uses the same LLM to generate Layout-Init from that text, and finally scores Layout-Final against the same reference, the benchmark is partially self-referential. This makes the SOTA claim less independent, but the diffusion target remains the external RPlan layout, so the circularity is partial rather than total. The Eq. (4)-(6) forward/reverse mismatch is a correctness flaw, not a circularity: it does not equate the prediction to the input, but it does mean the proposed dual-conditioned sampling distribution is not properly derived. Self-citations to Zhuo and Tan are incidental graph-representation citations and are not load-bearing for the main claim.
Assumptions & free parameters
free parameters (2)
- Conditional participation ratio (condition embedding strength) =
Best value chosen from Table 3b, reported as 1e-1 (highest IoU)
- Demo set size n for CoT prompt =
Not disclosed
assumptions (4)
- domain assumption RPlan is a representative corpus for residential floorplan design, and its vectorized layout graphs are a valid target distribution.
- domain assumption GPT-4o-generated natural language descriptions accurately mimic real user demands for floorplans.
- domain assumption The modified forward process in Eq. (4), which adds Layout-Init embedding e(y) to the noised sample, still permits the standard DDPM reverse update Eq. (6) and noise-prediction loss.
- domain assumption Corners and room types are a sufficient geometric representation, and the discrete int2bit decoding preserves structural constraints.
Cite this review
Pith. "Pith review of HouseTune: Two-Stage Floorplan Generation with LLM Assistance." pith.science (2026). https://pith.science/paper/O7AW2AOW
@misc{pith2026241112279,
author = {Pith},
title = {Pith review of: HouseTune: Two-Stage Floorplan Generation with LLM Assistance},
year = {2026},
howpublished = {\url{https://pith.science/paper/O7AW2AOW}},
note = {Machine review of arXiv:2411.12279}
}
read the original abstract
This paper proposes a two-stage text-to-floorplan generation framework that combines the reasoning capability of Large Language Models (LLMs) with the generative power of diffusion models. In the first stage, we leverage a Chain-of-Thought (CoT) prompting strategy to guide an LLM in generating an initial layout (Layout-Init) from natural language descriptions, which ensures a user-friendly and intuitive design process. However, Layout-Init may lack precise geometric alignment and fine-grained structural details. To address this, the second stage employs a conditional diffusion model to refine Layout-Init into a final floorplan (Layout-Final) that better adheres to physical constraints and user requirements. Unlike prior methods, our approach effectively reduces the difficulty of floorplan generation learning without the need for extensive domain-specific training data. Experimental results demonstrate that our approach achieves state-of-the-art performance across all metrics, which validates its effectiveness in practical home design applications.
Figures
Figures from the paper (4 more)
Reference graph
Works this paper leans on
-
[1]
Indoor scan2bim: Building information models of house interiors
Srivathsan Murali, Pablo Speciale, Martin R Oswald, and Marc Pollefeys. Indoor scan2bim: Building information models of house interiors. In 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages 6126–6133. IEEE,
work page 2017
-
[5]
Automatic chain of thought prompting in large language models
Zhuosheng Zhang, Aston Zhang, Mu Li, and Alex Smola. Automatic chain of thought prompting in large language models. arXiv preprint arXiv:2210.03493,
-
[9]
Analog bits: Generating discrete data using diffusion models with self-conditioning
Ting Chen, Ruixiang Zhang, and Geoffrey Hinton. Analog bits: Generating discrete data using diffusion models with self-conditioning. arXiv preprint arXiv:2208.04202,
-
[10]
Denoising diffusion implicit models
Jiaming Song, Chenlin Meng, and Stefano Ermon. Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502,
arXiv 2010
-
[11]
Hierarchical text-conditional image generation with clip latents
Aditya Ramesh, Prafulla Dhariwal, Alex Nichol, Casey Chu, and Mark Chen. Hierarchical text-conditional image generation with clip latents. arXiv preprint arXiv:2204.06125, 1(2):3,
-
[13]
Adam: A method for stochastic optimization
Diederik P Kingma. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980,
-
[14]
Decoupled weight decay regularization
I Loshchilov. Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101,
-
[15]
An exact graph edit distance algorithm for solving pattern recognition problems
11 arXiv Template A PREPRINT Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel, and Patrick Martineau. An exact graph edit distance algorithm for solving pattern recognition problems. In 4th International Conference on Pattern Recognition Applications and Methods 2015,
work page 2015
Show all 15 references
-
[2013]
Building generalizable agents with a realistic and rich 3d environment
Yi Wu, Yuxin Wu, Georgia Gkioxari, and Yuandong Tian. Building generalizable agents with a realistic and rich 3d environment. arXiv preprint arXiv:1801.02209,
-
[2014]
Flnet: graph constrained floor layout generation
Abhinav Upadhyay, Alpana Dubey, Veenu Arora, Suma Mani Kuriakose, and Shaurya Agarawal. Flnet: graph constrained floor layout generation. In 2022 IEEE International Conference on Multimedia and Expo Workshops (ICMEW), pages 1–6. IEEE,
2022
-
[2017]
Computer-generated residential building layouts
Paul Merrell, Eric Schkufza, and Vladlen Koltun. Computer-generated residential building layouts. In ACM SIGGRApH Asia 2010 papers, pages 1–12
2010
-
[2020]
Procedural modeling of buildings
Pascal Müller, Peter Wonka, Simon Haegler, Andreas Ulmer, and Luc Van Gool. Procedural modeling of buildings. In ACM SIGGRAPH 2006 Papers, pages 614–623
2006
-
[2022]
House-gan: Relational generative adversarial networks for graph-constrained house layout generation
Nelson Nauata, Kai-Hung Chang, Chin-Yi Cheng, Greg Mori, and Yasutaka Furukawa. House-gan: Relational generative adversarial networks for graph-constrained house layout generation. In Computer Vision–ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceed...
2020
-
[2023]
Tell2design: A dataset for language-guided floor plan generation
Sicong Leng, Yang Zhou, Mohammed Haroon Dupty, Wee Sun Lee, Sam Conrad Joyce, and Wei Lu. Tell2design: A dataset for language-guided floor plan generation. arXiv preprint arXiv:2311.15941,
-
[2024]
Language models are few-shot learners
Ben Mann, N Ryder, M Subbiah, J Kaplan, P Dhariwal, A Neelakantan, P Shyam, G Sastry, A Askell, S Agarwal, et al. Language models are few-shot learners. arXiv preprint arXiv:2005.14165, 1,
2005 arXiv
Reviewed August 12, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.