Enhancing Monotonic Modeling with Spatio-Temporal Adaptive Awareness in Diverse Marketing

• URL: http://arxiv.org/abs/2406.14132v1
• Date: Thu, 20 Jun 2024 09:21:09 GMT
• Title: Enhancing Monotonic Modeling with Spatio-Temporal Adaptive Awareness in Diverse Marketing
• Authors: Bin Li, Jiayan Pei, Feiyang Xiao, Yifan Zhao, Zhixing Zhang, Diwei Liu, HengXu He, Jia Jia,
• Abstract summary: OFOS platforms offer dynamic allocation incentives to users and merchants to encourage payments. We propose a Constrained Monotonic Adaptive Network (CoMAN) method for robustness-temporal perception within marketing pricing efficiency. Our experiments demonstrate the effectiveness of the proposed approach while outperforming the monotonic state-of-the-art method.
• Score: 15.024320284683215
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the mobile internet era, the Online Food Ordering Service (OFOS) emerges as an integral component of inclusive finance owing to the convenience it brings to people. OFOS platforms offer dynamic allocation incentives to users and merchants through diverse marketing campaigns to encourage payments while maintaining the platforms' budget efficiency. Despite significant progress, the marketing domain continues to face two primary challenges: (i) how to allocate a limited budget with greater efficiency, demanding precision in predicting users' monotonic response (i.e. sensitivity) to incentives, and (ii) ensuring spatio-temporal adaptability and robustness in diverse marketing campaigns across different times and locations. To address these issues, we propose a Constrained Monotonic Adaptive Network (CoMAN) method for spatio-temporal perception within marketing pricing. Specifically, we capture spatio-temporal preferences within attribute features through two foundational spatio-temporal perception modules. To further enhance catching the user sensitivity differentials to incentives across varied times and locations, we design modules for learning spatio-temporal convexity and concavity as well as for expressing sensitivity functions. CoMAN can achieve a more efficient allocation of incentive investments during pricing, thus increasing the conversion rate and orders while maintaining budget efficiency. Extensive offline and online experimental results within our diverse marketing campaigns demonstrate the effectiveness of the proposed approach while outperforming the monotonic state-of-the-art method.

Related papers

• Adaptive Budget Optimization for Multichannel Advertising Using Combinatorial Bandits [9.197038204851458]
  We introduce three key contributions to the field of budget allocation in digital advertising. First, we develop a simulation environment designed to mimic multichannel advertising campaigns over extended time horizons. Second, we propose an enhanced bandit budget allocation strategy that leverages a saturating mean function and a targeted exploration mechanism with change-point detection.
  arXiv  Detail & Related papers  (2025-02-05T06:29:52Z)
• Procurement Auctions via Approximately Optimal Submodular Optimization [53.93943270902349]
  We study procurement auctions, where an auctioneer seeks to acquire services from strategic sellers with private costs. Our goal is to design computationally efficient auctions that maximize the difference between the quality of the acquired services and the total cost of the sellers.
  arXiv  Detail & Related papers  (2024-11-20T18:06:55Z)
• End-to-End Cost-Effective Incentive Recommendation under Budget Constraint with Uplift Modeling [12.160403526724476]
  We propose a novel End-to-End Cost-Effective Incentive Recommendation (E3IR) model under budget constraints. Specifically, our methods consist of two modules, i.e., the uplift prediction module and the differentiable allocation module. Our E3IR improves allocation performance compared to existing two-stage approaches.
  arXiv  Detail & Related papers  (2024-08-21T13:48:00Z)
• Improving Point-based Crowd Counting and Localization Based on Auxiliary Point Guidance [59.71186244597394]
  We introduce an effective approach to stabilize the proposal-target matching in point-based methods. We propose Auxiliary Point Guidance (APG) to provide clear and effective guidance for proposal selection and optimization. We also develop Implicit Feature Interpolation (IFI) to enable adaptive feature extraction in diverse crowd scenarios.
  arXiv  Detail & Related papers  (2024-05-17T07:23:27Z)
• An End-to-End Framework for Marketing Effectiveness Optimization under Budget Constraint [25.89397524825504]
  We propose a novel end-to-end framework to directly optimize the business goal under budget constraints. Our core idea is to construct a regularizer to represent the marketing goal and optimize it efficiently using gradient estimation techniques. Our proposed method is currently deployed to allocate marketing budgets for hundreds of millions of users on a short video platform.
  arXiv  Detail & Related papers  (2023-02-09T07:39:34Z)
• VFed-SSD: Towards Practical Vertical Federated Advertising [53.08038962443853]
  We propose a semi-supervised split distillation framework VFed-SSD to alleviate the two limitations. Specifically, we develop a self-supervised task MatchedPair Detection (MPD) to exploit the vertically partitioned unlabeled data. Our framework provides an efficient federation-enhanced solution for real-time display advertising with minimal deploying cost and significant performance lift.
  arXiv  Detail & Related papers  (2022-05-31T17:45:30Z)
• A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in Online Advertising [53.636153252400945]
  We propose a general Multi-Agent reinforcement learning framework for Auto-Bidding, namely MAAB, to learn the auto-bidding strategies. Our approach outperforms several baseline methods in terms of social welfare and guarantees the ad platform's revenue.
  arXiv  Detail & Related papers  (2021-06-11T08:07:14Z)
• Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising [52.3825928886714]
  We formulate the sequential advertising strategy optimization as a dynamic knapsack problem. We propose a theoretically guaranteed bilevel optimization framework, which significantly reduces the solution space of the original optimization space. To improve the exploration efficiency of reinforcement learning, we also devise an effective action space reduction approach.
  arXiv  Detail & Related papers  (2020-06-29T18:50:35Z)
• Graph Representation Learning for Merchant Incentive Optimization in Mobile Payment Marketing [26.154050518762457]
  We present a graph representation learning method atop of transaction networks for merchant incentive optimization in mobile payment marketing. We are able to model the sensitivity to incentive for each merchant, and spend the most budgets on those merchants that show strong sensitivities in the marketing campaign.
  arXiv  Detail & Related papers  (2020-02-27T18:48:55Z)
• MoTiAC: Multi-Objective Actor-Critics for Real-Time Bidding [47.555870679348416]
  We propose a Multi-ecTive Actor-Critics algorithm named MoTiAC for the problem of bidding optimization with various goals. Unlike previous RL models, the proposed MoTiAC can simultaneously fulfill multi-objective tasks in complicated bidding environments.
  arXiv  Detail & Related papers  (2020-02-18T07:16:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.