- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work introduces a generative auto‑bidding framework for online advertising built upon conditional diffusion trajectory modelling. The authors first identify and theoretically prove a mode‑concentration failure. Instead of fine‑tuning the full diffusion model, AMINO decouples multimodal trajectory generation and performance optimization. Evaluations are conducted on AuctionNet real‑world advertising benchmark. AMINO outperforms prior offline RL, Decision‑Transformer‑based, diffusion‑based and LLM‑based auto‑bidding baselines.
Critical strengths
-
Novel theoretical proof of mode‑concentration under high return conditioning for diffusion‑based auto‑bidding. The paper derives Proposition 1 showing extreme target‑return conditioning collapses trajectory mode entropy. This explains a key practical failure mode widely ignored in existing diffusion auto‑bidding literature.
-
Effective decoupled optimisation pipeline tailored to auto‑bidding constraints and delayed trajectory‑level feedback. By freezing the pretrained diffusion planner and only optimising initial noise via GNPO, AMINO preserves the pre‑learned multimodal trajectory distribution and avoids the risk of destroying multimodality that comes from end‑to‑end RL fine‑tuning of diffusion networks. Empirical improvements over state‑of‑art baselines validate the practical value.
Critical weaknesses
-
Lack of online‑interaction / offline‑to‑online evaluation. All experiments run purely within offline‑simulated benchmark environments. In real auto‑bidding systems, market distributions usually shift after deployment. It remains untested whether the optimised noise policy degrades severely when facing real online distribution drift.
-
Limited comparison against alternative latent‑space RL for diffusion. While the paper compares against CEM and GMM‑based baselines, it provides only limited discussion and empirical contrast against existing general‑purpose initial‑noise RL methods from broader diffusion literature. It is unclear how much performance gain comes from the auto‑bidding‑specific GNPO group‑relative formulation versus vanilla latent‑space RL adapted to this setting.
Questions for authors
-
For Proposition 1’s mode‑concentration proof, the analysis assumes mode‑conditional returns follow Gaussian distributions. How well does this Gaussian assumption hold for real‑world auto‑bidding trajectory returns in AuctionNet?
-
In GNPO, group‑relative advantage relies on sampling G noise candidates per history. How sensitive is final performance to group size G?
-
Have you attempted adapting existing general latent‑noise RL algorithms to this auto‑bidding setup for direct comparison?
-
What obstacles prevent adding online‑shift simulation experiments on AuctionNet to evaluate how AMINO’s noise policy degrades under distribution shift? Could simple fine‑tuning of only the noise policy address the online adaptation?
5 comments
Official Comment by Authors (2/2)
2. Gaussian Assumption in Proposition 1 (Q1)
Thank you for the helpful question. Proposition 1 aims to provide a theoretical explanation for the potential limitations of conditioning diffusion planners on excessively high return-to-go targets. For analytical tractability, we assume that returns within each trajectory mode follow a Gaussian distribution. However, mode concentration can also occur under non-Gaussian distributions, provided that a unique right-tail-dominant mode exists.
Following the reviewer's suggestion, we further conducted empirical validation of the Gaussian assumption on AuctionNet. We selected three representative bidding behavior modes—Aggressive, Uniform, and Conservative—and grouped trajectories with similar observed histories at decision steps . Gaussian distributions were fitted to the future returns within each history–mode group.
We evaluate the goodness of fit using excess kurtosis (deviation from Gaussian kurtosis), the Kolmogorov–Smirnov (KS) statistic (maximum difference between empirical and fitted cumulative distributions), and Q95 Error (relative error in the 95th-percentile return). The results are summarized below.
| Mode | Excess Kurtosis | KS | Q95 Error |
|---|---|---|---|
| Aggressive | 0.248 | 0.104 | 6.47% |
| Uniform | -0.011 | 0.112 | 7.67% |
| Conservative | 0.054 | 0.113 | 6.32% |
The results show that all three modes exhibit excess kurtosis close to zero, with 95th-percentile fitting errors of 6.32%–7.67%. Although the KS statistics indicate some deviations from exact Gaussianity, these findings support Gaussian distributions as a reasonable approximation of conditional returns in AuctionNet.
We have included this empirical analysis in Appendix E.6 of the revised manuscript.
3. Group Size Sensitivity (Q2)
We conducted additional experiments to evaluate the sensitivity of GNPO to the group size , while keeping all other settings unchanged.
| 8 | 16 | 32 | 64 | 128 | |
|---|---|---|---|---|---|
| Score | 351 | 363 | 374 | 371 | 366 |
The results demonstrate that GNPO is relatively insensitive to the group size. Despite a 16-fold variation in (from 8 to 128), the maximum relative Score difference is only 6.1%. Moreover, all configurations consistently outperform Diffusion Only (318) by at least 10.4%, demonstrating the robustness of GNPO across different group sizes.
We have included these results in Appendix E.4 of the revised manuscript.
4. Comparison with General Latent-Noise RL Methods (Q3 & W2)
Thank you for the valuable comments. We would like to clarify that AMINO's contributions extend beyond GNPO to a tailored noise optimization pipeline for auto-bidding, integrating a trajectory evaluator, GNPO, and conservative optimization. These components jointly address key challenges in directly applying general latent-noise RL methods to auto-bidding, including delayed trajectory-level feedback and unreliable reward estimation in offline settings.
To further validate its effectiveness, we adapt two representative latent-noise RL approaches to auto-bidding: Noise PPO-style, based on PPO, and DSRL-style, based on SAC-style actor–critic optimization[1][2l]. Their configurations are kept as consistent with AMINO as possible to ensure a fair comparison. The results are summarized below.
| Method | DSRL-style | Noise PPO-style | Noise PPO-style + Reward Shaping | AMINO |
|---|---|---|---|---|
| Score ↑ | 339 | 343 | 351 | 374 |
AMINO outperforms both approaches, achieving a 6.6% improvement over Noise PPO-style with reward shaping and a 10.3% improvement over DSRL-style. Notably, reward shaping improves Noise PPO-style from 343 to 351, further supporting the effectiveness of conservative optimization.
We have added these comparisons to Appendix E.3 and include Noise PPO in the Related Work section.
References:
[1] Ren, A. Z., et al. (2025). Diffusion Policy Policy Optimization. The Thirteenth International Conference on Learning Representations (ICLR).
[2] Wagenmaker, A., et al. (2025). Steering Your Diffusion Policy with Latent Space Reinforcement Learning. Proceedings of the 9th Conference on Robot Learning (CoRL), PMLR, 305, 258–282.
Summary Response
We sincerely thank you for the valuable comments and for recognizing the novelty of our theoretical analysis of mode concentration, the effectiveness of our decoupled optimization framework, and the performance improvements over existing methods.
We are also encouraged that the other two reviewers independently highlighted the novelty and significance of our main contributions. Reviewer Bage particularly appreciated the novel perspective of treating initial noise as a learnable policy and the comprehensive experimental evaluation. Reviewer y5SE emphasized the theoretically and empirically supported analysis of mode concentration, as well as the simplicity and effectiveness of separating multimodal trajectory generation from performance optimization.
Motivated by your suggestions, we have substantially strengthened our experimental evaluation, including additional experiments on real-world industrial advertising data, simulated distribution shifts and noise-policy adaptation, empirical validation of the Gaussian assumption, group-size sensitivity analysis, and direct comparisons with general latent-noise RL methods. These new results further support both the practical effectiveness and robustness of AMINO.
We hope these additional experiments and clarifications have adequately addressed your concerns and strengthened the evidence for our contributions. If you find our responses satisfactory, we would be sincerely grateful if you could reconsider your overall rating. We welcome any further discussion or suggestions.
Official Comment by Authors (1/2)
We sincerely thank Reviewer kvcj for the insightful comments. The remainders focus on concerns to address.
1. Real-World Evaluation and Adaptation under Distribution Shift (W1 & Q4)
Thank you for raising this important concern. As acknowledged in our Limitations section, safe online adaptation remains an important challenge due to distribution shifts and potentially unstable policy updates. Direct online deployment also faces operational safety risks and deployment costs. To further assess AMINO's practical applicability and adaptability to changing market conditions, we conducted two additional experiments.
(a) Evaluation on Real-World Industrial Data
To evaluate AMINO beyond the AuctionNet benchmark, we conducted additional experiments using recent production data collected in October 2026 from a large-scale e-commerce advertising platform. Unlike AuctionNet's benchmark simulator, this evaluation uses actual impression-level traffic, market prices, and predicted values from a production advertising system.
Under joint budget and ROAS constraints, we train the model offline using seven consecutive days of real bidding trajectories and evaluate it on a separate day. The evaluation follows the platform's bidding and budget-control rules, adjusting bidding parameters every 15 minutes and replaying auctions against recorded market prices. Performance is measured using normalized GMV with penalties for ROAS constraint violations.
Compared with DT, AMINO achieves the following improvements:
These results provide further evidence of AMINO's effectiveness in practical advertising settings. While this remains an offline replay evaluation rather than an online A/B test, it incorporates real production market conditions. We have included these results in Section 6.7 of the revised manuscript.
(b) Adaptation under Distribution Shifts
To investigate whether fine-tuning only the noise policy can adapt to changing market conditions, we consider three distribution shifts in AuctionNet: (1) market prices increasing by 25%, (2) traffic volume decreasing by 20%, and (3) conversion probabilities decreasing by 20%.
Starting from the pretrained AMINO checkpoint, we freeze the diffusion planner and inverse dynamics model, updating only the noise policy through episode-level group-relative policy optimization using simulator rewards, without the trajectory evaluator. Adaptation is performed on a separate delivery period (period 8), while evaluation uses the original test period (period 7) under the same shift.
The results show that AMINO maintains a substantial advantage over DT across all three distribution shifts, while fine-tuning only the noise policy yields further improvements of 4.9%–9.5%. These findings demonstrate the effectiveness of lightweight noise-policy adaptation under changing market conditions without retraining the diffusion planner, while safe adaptation in real online systems remains an important direction for future work. We have included these results in Appendix E.4 of the revised manuscript.