mlsanityData to 14 Oct 2026

Efficient Optimal Selection for Composited Advertising Creatives with Tree Structure

arXiv 2103.01453 ↗First posted 2 Mar 2021cs.IR cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Ad creatives are one of the prominent mediums for online e-commerce advertisements. Ad creatives with enjoyable visual appearance may increase the click-through rate (CTR) of products. Ad creatives are typically handcrafted by advertisers and then delivered to the advertising platforms for advertisement. In recent years, advertising platforms are capable of instantly compositing ad creatives with arbitrarily designated elements of each ingredient, so advertisers are only required to provide basic materials. While facilitating the advertisers, a great number of potential ad creatives can be composited, making it difficult to accurately estimate CTR for them given limited real-time feedback. To this end, we propose an Adaptive and Efficient ad creative Selection (AES) framework based on a tree structure. The tree structure on compositing ingredients enables dynamic programming for efficient ad creative selection on the basis of CTR. Due to limited feedback, the CTR estimator is usually of high variance. Exploration techniques based on Thompson sampling are widely used for reducing variances of the CTR estimator, alleviating feedback sparsity. Based on the tree structure, Thompson sampling is adapted with dynamic programming, leading to efficient exploration for potential ad creatives with the largest CTR. We finally evaluate the proposed algorithm on the synthetic dataset and the real-world dataset. The results show that our approach can outperform competing baselines in terms of convergence rate and overall CTR.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 6 of its 28 references that are in the map. First posted on arXiv 2 Mar 2021.

Builds on

6 of 28 references.

References · 6

  1. 2019LayoutGAN: Generating Graphic Layouts with Wireframe Discriminatorscited by 131
  2. 2018An Efficient Bandit Algorithm for Realtime Multivariate Optimizationcited by 34
  3. 2016Deep CTR Prediction in Display Advertisingcited by 31
  4. 2019Top-k Combinatorial Bandits with Full-Bandit Feedbackcited by 28
  5. 2020Category-Specific CNN for Visual-aware CTR Prediction at JD.comcited by 9
  6. 2018Adaptive, Personalized Diversity for Visual Discoverycited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 2.

5 papers.