Application of Bayesian Optimization in Periodic Delivery

In modern e-commerce advertising, how to efficiently allocate advertising budgets to maximize the effect (i.e., impressions/cost) is an important challenge. Traditionally, advertising budget allocation relies on experience and manual judgment. Although it is effective in some cases, it often lacks systematicity and precision and is difficult to adapt to the complex and changing market environment. More and more merchants are eager to know which factors to consider and which aspects can improve the conversion rate of advertisements at a lower cost, thereby increasing sales revenue and making better profits. This paper proposes an automated advertising delivery strategy based on Bayesian optimization and Gaussian process regression (GPR) model. By combining the periodic characteristics of time with cost, the model can dynamically adjust the delivery strategy in different time periods to maximize the impression volume per unit cost. Experimental results show that compared with the traditional empirical delivery method, this automated method significantly improves the efficiency of advertising delivery. In practical applications, this method can not only predict the optimal delivery strategy more accurately, but also improve its responsiveness to market changes through continuous learning and optimization. This study provides an effective intelligent solution for e-commerce advertising delivery, which has high application value and promotion prospects.

Authors

Institutions

Publication Details

Published
2025-03-14
DOI
https://doi.org/10.1145/3746709.3746805
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Application of Bayesian Optimization in Periodic Delivery

Yan Wang
1 links
Advanced Multi-Objective Optimization Algorithms
article

Application of Bayesian Optimization in Periodic Delivery

Yan Wang
article en

Abstract

In modern e-commerce advertising, how to efficiently allocate advertising budgets to maximize the effect (i.e., impressions/cost) is an important challenge. Traditionally, advertising budget allocation relies on experience and manual judgment. Although it is effective in some cases, it often lacks systematicity and precision and is difficult to adapt to the complex and changing market environment. More and more merchants are eager to know which factors to consider and which aspects can improve the conversion rate of advertisements at a lower cost, thereby increasing sales revenue and making better profits. This paper proposes an automated advertising delivery strategy based on Bayesian optimization and Gaussian process regression (GPR) model. By combining the periodic characteristics of time with cost, the model can dynamically adjust the delivery strategy in different time periods to maximize the impression volume per unit cost. Experimental results show that compared with the traditional empirical delivery method, this automated method significantly improves the efficiency of advertising delivery. In practical applications, this method can not only predict the optimal delivery strategy more accurately, but also improve its responsiveness to market changes through continuous learning and optimization. This study provides an effective intelligent solution for e-commerce advertising delivery, which has high application value and promotion prospects.

Shanghai Academy of Agricultural Sciences (CN)
Openalex Percentile: Top 76%
Advanced Multi-Objective Optimization Algorithms
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.