CATALIST: Structurally Guided Sequence Learning withModel-Based Augmentation for Offline Auto-Bidding

Abstract Offline auto-bidding learns bidding policies from logged auction trajectories to optimize resourceallocation under budget and cost-per-acquisition (CPA) constraints. Temporal dependencies amongauction features and limited action coverage in the logs complicate policy learning. This paper pro-poses CATALIST, a structurally guided sequence-learning framework that combines dependencypriors with local model-based augmentation. CATALIST constructs structured representations usinglagged and instantaneous dependency priors and models decision histories through token-type andtemporal attention biases. Alternative actions are generated within the same historical context andselected through resource-feasibility checks and model-predicted gain screening for action supervi-sion. Training jointly incorporates action learning from observed and generated samples, outcome andvalue prediction using only observed records, and context-consistency regularization. On AuctionNet,CATALIST achieves a Score of 260.95 at the nominal budget, improving over CDT’s 175.48 by 48.7%.At the 150% budget ratio, it achieves 339.24, exceeding GAS and GAVE, which obtain 294.13 and304.32, by 15.3% and 11.5%, respectively. The experimental results show that combining structurally guided sequence learning with model-based augmentation improves offline auto-bidding performance.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-04
DOI
https://doi.org/10.21203/rs.3.rs-11412157/v1
Primary Topic
Auction Theory and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

CATALIST: Structurally Guided Sequence Learning withModel-Based Augmentation for Offline Auto-Bidding

Haiyu Liu, Jinghui Wang, Liyu Huang
Research Square
Auction Theory and Applications
preprint

CATALIST: Structurally Guided Sequence Learning withModel-Based Augmentation for Offline Auto-Bidding

Haiyu Liu, Jinghui Wang, Liyu Huang
preprint en

Abstract

Abstract Offline auto-bidding learns bidding policies from logged auction trajectories to optimize resourceallocation under budget and cost-per-acquisition (CPA) constraints. Temporal dependencies amongauction features and limited action coverage in the logs complicate policy learning. This paper pro-poses CATALIST, a structurally guided sequence-learning framework that combines dependencypriors with local model-based augmentation. CATALIST constructs structured representations usinglagged and instantaneous dependency priors and models decision histories through token-type andtemporal attention biases. Alternative actions are generated within the same historical context andselected through resource-feasibility checks and model-predicted gain screening for action supervi-sion. Training jointly incorporates action learning from observed and generated samples, outcome andvalue prediction using only observed records, and context-consistency regularization. On AuctionNet,CATALIST achieves a Score of 260.95 at the nominal budget, improving over CDT’s 175.48 by 48.7%.At the 150% budget ratio, it achieves 339.24, exceeding GAS and GAVE, which obtain 294.13 and304.32, by 15.3% and 11.5%, respectively. The experimental results show that combining structurally guided sequence learning with model-based augmentation improves offline auto-bidding performance.

Research Square
Jiangsu University (CN)
Auction Theory and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
CATALIST: Structurally Guided Sequence Learning withModel-Based Augmentation for Offline Auto-Bidding — Haiyu Liu, Jinghui Wang, et al. · Research Square (2026) | TGRS Research Map | TGRS