- Rating
- 4
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes AdsPrompter, a framework aimed at generating multimodal advertising designs that simultaneously balance visual design aesthetics and commercial effectiveness. To bridge the gap between their conflicts, the authors introduce UDPO, a coarse-to-fine learning strategy. In the coarse stage, a prompt generator (SFT on Qwen3-VL-8B) and an image renderer (full fine-tuning on a DiT model) are trained. In the fine stage, the prompt generator is refined via policy optimization using two complementary reward models: a User Reward Model (capturing CTR preferences via pairwise ranking) and a Designer Reward Model (capturing visual layout and style using DINOv2 with ordinal loss). The framework employs an optimization algorithm to dynamically balance the two reward objectives. The authors also introduce a dataset of 200k product-advertisement pairs along with 10k CTR preference pairs. Experiments show improvements over baseline methods across both aesthetic and commercial metrics.
Critical strengths
-
Important problem: Addressing the discrepancy between commercial performance (CTR) and visual aesthetic quality (design principles) in multimodal ad generation is a highly relevant, real-world research problem;
-
Data contribution: the creation of a 200k multimodal dataset with structured prompt protocols and real-world CTR preference annotations represents a valuable contribution to the community.
Critical weaknesses
-
The optimization pipeline requires training multiple large components (a 30B multimodal URM, a DINOv2 DRM, a full DiT fine-tune, and GRPO on an 8B VLM). The computational demand is significant (e.g., hundreds of GPU hours), which may limit accessibility and reproduction for resource-constrained groups.
-
The proposed optimization algorithm, i.e., MDGA with EMA, is heuristic and slightly over-engineered. In stochastic RL settings (like GRPO), MGDA updates derived from mini-batch policy gradients are noisy and sensitive to gradient magnitudes rather than true objective priority. The addition of periodic updates and EMA smoothing essentially acts as an empirical patch to stabilize MGDA's inherent variance in policy gradient training. An ablation comparing MGDA+EMA against simple running normalized scalarization would clarify if MGDA's mathematical overhead actually delivers a meaningful gain over simpler dynamic heuristics.
Questions for authors
How sensitive is the MGDA weight during policy optimization? Does it stabilize quickly, or does it oscillate significantly across different product domains?
Response to Reviewer Sjsh
We thank the reviewer for recognizing the practical importance of jointly considering design quality and user engagement, as well as the value of the dataset. We sincerely appreciate the constructive feedback and provide the following responses to address the concerns raised. We will be happy to clarify any further concerns.
Q1: The optimization pipeline requires training multiple large components...which may limit accessibility and reproduction for resource-constrained groups.
A1: As we focus on a practical problem of high-quality advertisement generation, we agree with the reviewer that the complete training pipeline requires substantial computational resources. Such costs are common in the adaptation of large generative models, particularly with RL-based optimization involving repeated candidate generation and reward evaluation.
It is worthnoting that at inference time, our model can run on a single RTX 4090 GPU, taking approximately 40–50 seconds to generate an advertisement. We will release both the code and the pre-trained model to enable inference and further adaptation without repeating the complete training pipeline.
Q2: The proposed optimization algorithm is heuristic and slightly over-engineered...An ablation comparing MGDA+EMA against simple running normalized scalarization would clarify if MGDA's mathematical overhead actually delivers a meaningful gain over simpler dynamic heuristics.
A2: Thanks for the valuable suggestion. The motivation for MGDA+EMA in the proposed UDPO is to balance the optimization between the designer and user policy gradients. The fusion weight is updated every 50 steps, and the two policy gradients are computed at those update steps.
We first compare the proposed strategy with several fixed-weight strategies and uncertainty modulation in the table below, showing that the proposed adaptive weighting strategy generally outperforms the fixed-weight configurations.
We further conduct an ablation study without EMA (w/o EMA) to investigate the effect of smoothing. The table below records the fusion weight under the two settings, together with the standard deviation and range of w over the last 1000 steps. We can see that EMA reduces the observed fluctuations of the applied fusion weight and keeps the optimization objective stable during training.
We have added the results and discussion in the revised PDF (see Table 3 and L480-L499).
Q3: How sensitive is the MGDA weight during policy optimization? Does it stabilize quickly, or does it oscillate significantly across different product domains?
A3: The EMA-smoothed MGDA weight w is initialized to 0.5, re-solved by MGDA every 50 steps, and smoothed by EMA with a coefficient of 0.9. During policy optimization, w stabilizes quickly from its initial value and converges without significant oscillation.
As suggested, we further analyze the user and designer weights across different product domains. For five product categories in our dataset, we compute the agreement rate, i.e., the proportion of CTR preference pairs in which the higher-CTR advertisement also receives the higher designer score.
As shown above, the preferences across these coarse-level product domains do not vary a lot. We believe that considering fine-grained product categories could be an interesting future work in this direction.