Improving AI Web Page Generation with Rubrics
Listen to the summary
Uses a voice available on your device
Audio options
On this page 4 sections
Related concepts 3 concepts
Key Takeaways
- RubSE outperformed standard self-evolution in 15 out of 18 final-round experimental settings.
- The method achieved an average gain of +1.20 overall points and +0.11 in aspect-mean scores.
- Refinement stability improved, with a +1.13 average gain in best-round performance across 14 of 18 test cases.
- The approach was validated across three benchmarks, including Design2Code and UI2Code-Real, using frontier models like GPT-5.4 and Qwen3-VL-32B-Instruct.
Summary & Methodology Analysis
The RubSE method addresses the challenge of visual repair coupling, where local code modifications often trigger unintended regressions in complex web layouts. The architecture operates through a cycle of rubric-based evaluation and targeted revision. It generates a candidate set of failure descriptors across five specific aspects: layout geometry, spacing density, typography text, styling visual, and completeness. By selecting a prioritized rubric and maintaining a per-instance history of these choices, the agent avoids redundant or regressive code edits during the iterative generation process. This history effectively serves as an avoid list for the model as it traverses the solution space.
Performance was evaluated across a diverse set of models, including proprietary frontier VLMs like GPT-5.4, GPT-5.2, and Claude-Sonnet-4.5, as well as open-source variants such as Qwen3-VL-32B-Instruct, Qwen3.5-9B, and Qwen-3.6-35B-A3B. The system demonstrates a higher trajectory-level ceiling for code quality compared to naive approaches. The evaluation relies on benchmarks like Design2Code, which provides model-based metrics, and UI2Code-Real, which contains 115 real-world web pages designed to challenge existing models with realistic UI complexity.
Despite these gains, the research has notable limitations. The paper does not explicitly guarantee code correctness, and the refinement process occasionally introduces syntax or runtime errors that lead to rendering failures. Additionally, evaluations performed by VLMs can remain unstable, potentially diverging from human judgment in later refinement rounds when assessing subtle visual differences. The current research scope is limited to HTML and CSS, leaving the performance of RubSE on other UI languages and a broader range of model families underexplored.
Interactive System Flowchart
Cross-Examination & FAQs
A deeper dive clarifying mechanics, constraints, and baseline evaluations.
Q1. What is the primary goal of the RubSE system?
RubSE aims to improve the quality of AI-generated web code by using structured visual rubrics to guide the self-evolution of UI layouts.
Q2. Does RubSE improve performance compared to standard self-evolution?
Yes, RubSE improved over naive self-evolution in 15 out of 18 settings, achieving higher overall and aspect-mean scores.
Q3. Is RubSE limited to a specific type of code?
Yes, the research is currently focused on HTML and CSS webpage generation.
Q4. What are the five aspects used in the RubSE taxonomy?
The taxonomy includes layout geometry, spacing density, typography text, styling visual, and completeness.
Q5. Which benchmarks were used to assess the method?
The authors used Design2Code and UI2Code-Real, which contains 115 real-world webpages.
Q6. Does the system guarantee that the generated code will always work?
No, the paper explicitly states that RubSE does not guarantee code correctness, and refinement steps can introduce syntax or runtime errors.
Q7. How do the authors account for potential bias in evaluation?
The authors note that VLM-based evaluation, while improved, is not perfectly stable and may diverge from human evaluation, particularly when assessing subtle visual differences.
Q8. Which models were tested in this research?
The models include GPT-5.4, GPT-5.2, Claude-Sonnet-4.5, Qwen3-VL-32B-Instruct, Qwen3.5-9B, and Qwen-3.6-35B-A3B.
Q9. Did the study measure the exact latency or token cost of the refinement rounds?
The paper does not specify the latency or computational cost of the refinement rounds.