arXiv — Machine Learning · · 3 min read

DRIVE: Distributional and Retrieval-Augmented Bidding with Value Evaluation

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Computer Science > Machine Learning

arXiv:2606.14192 (cs)
[Submitted on 12 Jun 2026]

Title:DRIVE: Distributional and Retrieval-Augmented Bidding with Value Evaluation

View a PDF of the paper titled DRIVE: Distributional and Retrieval-Augmented Bidding with Value Evaluation, by Miduo Cui and Haochen Wang and Shangqin Mao and Xun Yang and Qianlong Xie and Xingxing Wang and Xuri Ge and Ying Zhou and Zhiwei Xu
View PDF HTML (experimental)
Abstract:Auto-bidding is a core component of real-time advertising systems, where decisions must optimize long-term performance under budget and cost constraints, while online exploration is prohibitively risky. Offline reinforcement learning and, more recently, Transformer-based sequence modeling have shown promise for learning bidding policies from logged data, but their unimodal and purely parametric formulations often collapse multiple effective bidding strategies into suboptimal averaged actions and perform unreliably under sparse or long-tail traffic. To mitigate these limitations, we propose DRIVE (Distributional and Retrieval-Augmented Bidding with Value Evaluation), a unified Transformer-based framework that decouples candidate action generation from decision making for offline auto-bidding. DRIVE combines distributional action modeling, retrieval-augmented candidate generation from high-quality historical decisions, and value-based evaluation to select the most promising bid at inference time. Extensive experiments on AuctionNet and additional offline reinforcement learning benchmarks demonstrate that DRIVE consistently improves bidding performance and generalizes well across multiple Transformer-based methods.
Comments: Accepted to ICML 2026
Subjects: Machine Learning (cs.LG)
Cite as: arXiv:2606.14192 [cs.LG]
  (or arXiv:2606.14192v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2606.14192
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Miduo Cui [view email]
[v1] Fri, 12 Jun 2026 07:21:07 UTC (761 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled DRIVE: Distributional and Retrieval-Augmented Bidding with Value Evaluation, by Miduo Cui and Haochen Wang and Shangqin Mao and Xun Yang and Qianlong Xie and Xingxing Wang and Xuri Ge and Ying Zhou and Zhiwei Xu
  • View PDF
  • HTML (experimental)
  • TeX Source

Current browse context:

cs.LG
< prev   |   next >
Change to browse by:
cs

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender (What is IArxiv?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

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.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning