aiqbench analysis
This research introduces PRO-Bid, an advanced auto-bidding framework designed to maximize marketing value while strictly adhering to efficiency constraints like Target CPA. By integrating Constraint-Decoupled Pareto Representation with Counterfactual Regret Optimization, the model overcomes limitations in standard Decision Transformers regarding resource pacing and historical averaging. The approach demonstrates superior performance on public benchmarks and online A/B tests by effectively navigating high-efficiency boundaries without sacrificing compliance.
PRO-Bid: Pareto-Prioritized Regret Optimization for Constraint-Aware Generative Auto-Bidding
arXiv:2602.08261v2 Announce Type: replace Abstract: Auto-bidding systems strive to maximize marketing value while maintaining high compliance with efficiency constraints, such as Target Cost-Per-Action (CPA). While Decision Transformers offer powerful sequence modeling capabilities, their application to this setting faces two challenges: 1) standard Return-to-Go conditioning causes state aliasing by ignoring the cost dimension, preventing precise resource pacing; and 2) standard regression constrains the policy to mimic historical averages, limiting its capacity to optimize performance near the high-efficiency boundary. To tackle these challenges, we propose PRO-Bid, a constraint-aware generative auto-bidding framework featuring systematic redesigns across data, architecture, and training via two synergistic mechanisms: 1) Constraint-Decoupled Pareto Representation (CDPR) separates global constraints into recursive cost and value contexts to restore resource perception, while reweighting trajectories based on the empirical Pareto frontier to prioritize high-efficiency data; and 2) Counterfactual Regret Optimization (CRO) employs a global predictor to evaluate alternative actions and identify promising local adjustments. By utilizing these high-utility outcomes as weighted regression targets, the model overcomes mean regression and approaches the empirical high-efficiency boundary. Extensive experiments on two public benchmarks and online A/B tests show that PRO-Bid achieves better constraint satisfaction and value acquisition than state-of-the-art baselines.
Abstract:Auto-bidding systems strive to maximize marketing value while maintaining high compliance with efficiency constraints, such as Target Cost-Per-Action (CPA). While Decision Transformers offer powerful sequence modeling capabilities, their application to this setting faces two challenges: 1) standard Return-to-Go conditioning causes state aliasing by ignoring the cost dimension, preventing precise resource pacing; and 2) standard regression constrains the policy to mimic historical averages, limiting its capacity to optimize performance near the high-efficiency boundary. To tackle these challenges, we propose PRO-Bid, a constraint-aware generative auto-bidding framework featuring systematic redesigns across data, architecture, and training via two synergistic mechanisms: 1) Constraint-Decoupled Pareto Representation (CDPR) separates global constraints into recursive cost and value contexts to restore resource perception, while reweighting trajectories based on the empirical Pareto frontier to prioritize high-efficiency data; and 2) Counterfactual Regret Optimization (CRO) employs a global predictor to evaluate alternative actions and identify promising local adjustments. By utilizing these high-utility outcomes as weighted regression targets, the model overcomes mean regression and approaches the empirical high-efficiency boundary. Extensive experiments on two public benchmarks and online A/B tests show that PRO-Bid achieves better constraint satisfaction and value acquisition than state-of-the-art baselines.
Machine Learning (cs.LG); Computer Science and Game Theory (cs.GT)
arXiv:2602.08261 [cs.LG]
(or arXiv:2602.08261v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2602.08261 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 287 words
Related coverage

[AINews] Reality Checks on AI News (Yegge shuts down Gas Town, Databricks’ +60% Astra cost)
Latent Space · Sep 17, 2026

Jev: System One models for Prod, not God — with Diogo Almeida, CEO, TypeSafe AI
Latent Space · Sep 21, 2026

[AINews] DeepSeek v4.1-Flash: 763B-P8B-D16B novel causal Encoder–Decoder architecture with vision marks the Return of the Whale
Latent Space · Sep 12, 2026

Humanity’s Last Invention — Richard Socher of Recursive
Latent Space · Sep 14, 2026