- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes PlayGround, a workflow for arranging multimodal elements, such as text and images, in graphic design. Unlike prior approaches that directly predict the attributes of all elements in a single pass, PlayGround decomposes the design process into multiple steps and learns to place a subset of elements at each step. The Structure-Aware Retriever predicts a coarse layout structure, which is used to retrieve the Top-5 reference designs from a constructed reference pool. These references are subsequently provided as contextual input to the Progressive Planner, which predicts a group-level plan and selects the group of elements to be rendered at the current step. The Layout Generator then predicts the layout and text attributes of the elements in that group, conditioned on the Planner’s output and the retrieved references. In addition, the Visual Verifier evaluates the current predictions and, if they are rejected, provides feedback for revision and regeneration. The evaluations on Crello and LICA show that PlayGround outperforms the baselines on multiple VLM-based metrics.
Critical strengths
- Comprehensive coverage of related work and competitive empirical comparisons. The paper provides a comprehensive discussion of related work and compares PlayGround against several competitive open-source methods.
- Extensive evaluation of the proposed components. The paper provides a relatively comprehensive analysis of the effects of its individual modules, demonstrating how each component contributes to the final performance.
Critical weaknesses
- Limited methodological novelty. My primary concern is the novelty of the proposed method. PlayGround remains a workflow that combines multiple domain-specialized VLM modules, and its overall architecture does not appear fundamentally different from prior agentic systems. More specifically, it follows a familiar Planner–Predictor–Verifier structure. Moreover, the main advantage claimed by the paper—iterative design generation—have already been explored in PSDesigner. Therefore, it is unclear whether the paper provides a sufficiently substantial conceptual or algorithmic advance beyond existing systems.
- Evaluation is limited to relatively simple design tasks. The Crello dataset is limited in terms of element and attribute types, layout diversity, and the number of layers. This raises concerns about whether a system specifically designed and evaluated in this setting can generalize to more complex design tasks. For formats such as HTML, PowerPoint, and PSD, the substantially larger number of layers and greater diversity of element types introduce much greater complexity. In my opinion, PlayGround may be more suitable for simple layout tasks, which limits its applicability to realistic design scenarios.
- The system may not scale to more complex inputs. Several components, including the Structure-Aware Retriever and Progressive Planner, need to process the complete element inventory. This can substantially increase memory consumption and computational cost and may eventually exceed the effective context or processing capacity of the underlying pretrained model. Although the relative simplicity of Crello may mitigate this issue, scalability could become a serious limitation as the number of input assets increases.
- Pure SFT training may lead to a substantial training–inference gap. During inference, prediction errors from earlier steps will inevitably affect subsequent design decisions because the proposed components are trained only on ground-truth trajectories. Although the method introduces a Visual Verifier implemented with GPT-5.6 Luna to mitigate this issue, the effectiveness of this verifier in the graphic-design domain has not been sufficiently validated. More importantly, it does not fundamentally address the underlying training–inference discrepancy.
Questions for authors
- Generalization to more complex designs. Has the method been evaluated on more challenging design benchmarks, particularly those containing substantially more layers than are commonly observed in the training set? If the method performs well only on relatively simple evaluation sets such as Crello, its practical value in real-world design applications would remain unclear. Evidence on such settings could materially improve my assessment.
- Construction and role of the reference pool. How is the reference pool constructed? Why is the coarse layout predicted by the Structure-Aware Retriever used only for retrieval rather than directly guiding the downstream modules? What are the respective limitations of directly conditioning on the predicted coarse layout and conditioning on retrieved reference designs? In addition, providing five reference designs may consume a considerable number of visual tokens, resulting in substantial memory and computational overhead. Please provide an analysis of this trade-off.
- Revision of previously placed elements. How does PlayGround handle cases in which a newly inserted group makes the layout of previously placed elements suboptimal? The current design appears to revise only the group being processed in the current iteration, while elements accepted in previous iterations remain fixed and cannot be updated.
- Training–inference gap. How does PlayGround address the training–inference gap? Without self-forcing, the method may be sensitive to inference-time prediction noise, such that an incorrect element placement at one step affects all subsequent predictions. Please provide experiments or analyses that quantify this issue and demonstrate whether the Visual Verifier is sufficient to mitigate error accumulation.
6 comments
Author Rebuttal(2/2)
Table B3. Quality and resource trade-off of reference retrieval.
\hline \text{Metric} & \text{Top-5 references} & \text{No references} \\\\ \hline \text{Overall VLM} & \mathbf{3.958} & 3.901 \\\\ \text{Compute (TFLOPs/design)} & 425 & 346 \\\\ \text{Peak GPU memory (GiB)} & 24.0 & 22.4 \\\\ \text{Verifier retries / design} & 3.05 & 3.57 \\\\ \text{Latency (s/design)} & 176 & 193 \\\\ \text{GPT API cost (USD/design)} & 0.0129 & 0.0138 \\\\ \hline \end{array}$$ **[Computational Overhead.]** Using five references increases computation by 23% (346 → 425 TFLOPs per design) and peak GPU memory by 7% (22.4 → 24.0 GiB). However, reference guidance reduces Visual Verifier retries by 15% (3.57 → 3.05), offsetting the additional computational overhead. Consequently, end-to-end latency decreases by 9% (193 → 176 s/design), while GPT API cost also decreases by 7% (\$0.0138 → \$0.0129 per design). Meanwhile, retrieval yields a statistically significant quality improvement over the no-reference setting (Δ = +0.058, 95% CI: [0.024, 0.093], p = 0.0012). These results demonstrate that reference retrieval improves design quality while reducing end-to-end latency and API cost, despite the additional GPU computation and memory requirements. We have added these analyses in Appendix D.4 (Table 14). >**[Q3–Q4] Previously accepted groups and the training–inference gap** **Table B4. Stage-wise performance after an injected adverse intermediate state.** $$\begin{array}{lccccc} \hline \text{Stage} & \text{PLAYGROUND} & \text{A (Error + Verifier)} & \text{B (Error + Random)} & \Delta_A & \Delta_B \\\\ \hline \text{Intervention } & 3.261 & 3.175 & 3.175 & 0.086 & 0.086 \\\\ \text{Subsequent (avg.)} & 3.778 & 3.701 & 3.613 & 0.077 & 0.165 \\\\ \text{Final} & \mathbf{3.958} & 3.885 & 3.712 & \mathbf{0.073} & \mathbf{0.246} \\\\ \hline \end{array}$$ ****[Scope of Revision.]**** PLAYGROUND adopts a **closed-loop, group-wise generation process**, where revisions are restricted to the current group's elements. To ensure reliable placement within this constraint, our Progressive Planner adaptively generates layout plans based on the evolving canvas, while the Visual Verifier selects among five candidates and provides render-grounded feedback to refine the current layout instruction. We acknowledge that revising previously placed elements could further improve design quality and consider this a promising future direction. ****[Training-Inference Gap: Error Injection.]**** To assess whether PLAYGROUND can **adapt to imperfect intermediate states without revising previously placed elements**, we conducted an error-injection experiment using PLAYGROUND's generated trajectories from the Crello 600-design ablation subset. **For each design, we selected an intervention turn at the midpoint of its generation trajectory**, where we used GPT-6 Luna to identify the **most erroneous candidate among the four non-selected layouts** and forcibly committed it before continuing generation. Since PLAYGROUND ordinarily selects a verifier-approved candidate rather than the worst alternative, this intervention creates a more challenging intermediate state than typically encountered during generation. Despite this challenging setting, **PLAYGROUND maintains strong performance (A: 3.885 vs. Ours: 3.958)**, with only a 0.073-point decrease. To examine the contribution of the Visual Verifier, we introduce **variant B, which removes the Visual Verifier** and randomly selects among five candidates in subsequent turns, starting from the **same erroneous canvas as A**. The substantial performance degradation in B (3.712 vs. 3.885 in A, Δ = 0.173) indicates that **the Visual Verifier is critical to maintaining design quality even when generation starts from an erroneous intermediate state**. ****[Error Accumulation Analysis.]**** To further analyze error propagation, we evaluate layouts at different generation stages, using **the overall VLM score gap relative to unperturbed PLAYGROUND as a proxy for error impact**. With the Visual Verifier (A), the gap remains stable and slightly decreases (0.086 → 0.077 → 0.073). In contrast, without the Visual Verifier (B), the gap progressively increases (0.086 → 0.165 → 0.246). **While absolute VLM scores naturally increase as more elements are placed on the canvas, these relative gaps reveal how the impact of injected errors evolves.** These results demonstrate that **the Visual Verifier effectively handles error accumulation by mitigating the propagation and amplification of injected errors throughout progressive generation**. We have added this experiment in Appendix D.4 (Table 15).Dear Reviewer bGdJ, we sincerely appreciate your thoughtful feedback and the opportunity to further clarify our work. In response to your suggestions, we have clarified the novelty of our approach and conducted additional experiments to examine its effectiveness, computational cost, and robustness. We hope these clarifications and new results help address your questions. As the discussion period draws to a close, we would be grateful to hear your assessment of our updated response and would be happy to address any remaining questions.
Author Rebuttal(1/2)
We thank the reviewer for recognizing the breadth of our baseline comparisons and ablations. Your comments help us clarify the methodological contribution and the limits of the current system.
We appreciate the reviewer's comparison to existing Planner–Generator–Verifier frameworks. However, our key contribution goes beyond the generic architecture or iterative refinement. Specifically, we introduce a render-grounded progressive policy that jointly determines which remaining elements to group, when to place them, and how to arrange them based on the evolving canvas. To enable this, we introduce functional groups as adaptive decision units and, as also recognized by Reviewer LEAE, an automatic annotation pipeline that constructs the required step-wise supervision.
Furthermore, as discussed in Appendix A, prior retrieval-based layout methods primarily predict element bounding boxes (e.g., text, logos, and underlays) on a given background, without requiring the actual element content. They can therefore retrieve similar layouts using spatial cues from the background, such as the main subject's position. In contrast, our setting provides only a blank canvas and predefined elements with unknown positions and scales, making such retrieval strategies inapplicable. To address this, we predict coarse functional group–region pairs from the supplied elements to retrieve structurally similar designs. To the best of our knowledge, we are the first to introduce retrieval-based guidance for asset-given element-to-design composition.
Table B1. Overall VLM Scores Across Element Counts
\hline \text{Element Count} & \text{Samples} & \text{PLAYGROUND} & \text{FlexDM} & \text{LaDeCo} & \text{PosterCopilot} & \text{VFLM} \\\\ \hline 1\text{--}10 & 1,312 & \mathbf{4.063} & - & - & - & - \\\\ 11\text{--}20 & 956 & \mathbf{3.940} & - & - & - & - \\\\ 21\text{--}30 & 85 & \mathbf{3.771} & - & - & - & - \\\\ 31\text{--}50 & 22 & \mathbf{3.962} & - & - & - & - \\\\ \hline \text{Overall} & 2,375 & \mathbf{4.001} & 2.970 & 3.378 & 3.263 & 3.531 \\\\ \hline \end{array}$$ We understand the reviewer's concern that Crello contains relatively simple designs. To examine whether our performance degrades as layout complexity increases, we analyze the VLM scores in Table 1 by the number of input elements. As shown in Table B1, **PLAYGROUND consistently achieves scores above 3.771 across all element-count ranges**, exceeding the overall scores of the baselines: FlexDM (2.970), LaDeCo (3.378), PosterCopilot (3.263), and VFLM (3.531). This indicates that our method maintains strong performance even on more element-dense designs within Crello. **To further evaluate generalization beyond the complexity observed during training**, we consider LICA, where 16.8% of test designs contain more than 25 elements—the maximum in our Crello training set—including designs with over 50 elements. Despite these more challenging inputs, PLAYGROUND achieves the highest overall VLM score among the compared methods **without training on LICA**. These results provide encouraging evidence of generalization to more complex designs and suggest that further training on such datasets, enabled by our automatic annotation pipeline, could yield additional improvements. >**[W3, Q2] Reference Pool, Conditioning, and Computational Trade-off** **Table B2. Direct coarse-layout conditioning versus retrieved references.** $$\begin{array}{lc} \hline \text{Conditioning} & \text{Overall VLM} \\\\ \hline \text{Top-5 references} & \mathbf{3.958} \\\\ \text{No references} & 3.901 \\\\ \text{Lowest-5 references} & 3.867 \\\\ \text{Direct coarse layout} & 3.908 \\\\ \hline \end{array}$$ **[Reference Pool Construction and Direct Coarse Layout Conditioning.]** Our reference pool consists exclusively of the **Crello training set** across all experiments. We use predicted coarse group–region pairs for retrieval rather than directly conditioning downstream modules, as uncertain initial spatial predictions may constrain subsequent layout decisions. Instead, retrieved designs provide richer visual guidance while allowing flexible, canvas-conditioned planning. To validate this design choice, we conducted an additional ablation that directly conditions the planner and predictor on the predicted coarse layout without retrieving reference designs. **Direct conditioning (3.908) outperforms conditioning on the lowest-ranked references (3.867), but performs comparably to using no references (3.901)**, while our retrieval-based approach achieves **3.958**. These results support our design choice of using coarse layout predictions to retrieve informative reference designs rather than directly constraining downstream generation. We have added these analyses in Sec. 5.3 (Table 2)