Offer Personalization using Temporal Convolution Network and Optimization

• URL: http://arxiv.org/abs/2010.08130v1
• Date: Wed, 14 Oct 2020 10:59:34 GMT
• Title: Offer Personalization using Temporal Convolution Network and Optimization
• Authors: Ankur Verma
• Abstract summary: Increase in online shopping and high market competition has led to an increase in promotional expenditure for online retailers. We propose our approach to solve the offer optimization problem at the intersection of consumer, item and time in retail setting.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Lately, personalized marketing has become important for retail/e-retail firms due to significant rise in online shopping and market competition. Increase in online shopping and high market competition has led to an increase in promotional expenditure for online retailers, and hence, rolling out optimal offers has become imperative to maintain balance between number of transactions and profit. In this paper, we propose our approach to solve the offer optimization problem at the intersection of consumer, item and time in retail setting. To optimize offer, we first build a generalized non-linear model using Temporal Convolutional Network to predict the item purchase probability at consumer level for the given time period. Secondly, we establish the functional relationship between historical offer values and purchase probabilities obtained from the model, which is then used to estimate offer-elasticity of purchase probability at consumer item granularity. Finally, using estimated elasticities, we optimize offer values using constraint based optimization technique. This paper describes our detailed methodology and presents the results of modelling and optimization across categories.

Related papers

• Robust personalized pricing under uncertainty of purchase probabilities [2.9061423802698565]
  We propose a robust optimization model for personalized pricing that accounts for the uncertainty of predicted purchase probabilities. We also develop a Lagrangian decomposition algorithm combined with line search to efficiently find high-quality solutions for large-scale optimization problems.
  arXiv  Detail & Related papers  (2024-07-22T02:36:19Z)
• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• A Bargaining-based Approach for Feature Trading in Vertical Federated Learning [54.51890573369637]
  We propose a bargaining-based feature trading approach in Vertical Federated Learning (VFL) to encourage economically efficient transactions. Our model incorporates performance gain-based pricing, taking into account the revenue-based optimization objectives of both parties.
  arXiv  Detail & Related papers  (2024-02-23T10:21:07Z)
• LMaaS: Exploring Pricing Strategy of Large Model as a Service for Communication [11.337245234301857]
  We argue that a pay-as-you-go service mode will be suitable in this context, referred to as Large Model as a Service (LM) We propose an Iterative Model Pricing (IMP) algorithm that optimize the prices of large models iteratively by reasoning customers' future rental decisions. In the second step, we optimize customers' selection decisions by designing a robust selecting and renting algorithm.
  arXiv  Detail & Related papers  (2024-01-05T07:19:19Z)
• Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model [50.06663781566795]
  We consider a dynamic model with the consumers' preferences as well as price sensitivity varying over time. We measure the performance of a dynamic pricing policy via regret, which is the expected revenue loss compared to a clairvoyant that knows the sequence of model parameters in advance. Our regret analysis results not only demonstrate optimality of the proposed policy but also show that for policy planning it is essential to incorporate available structural information.
  arXiv  Detail & Related papers  (2023-03-28T00:23:23Z)
• Approaching sales forecasting using recurrent neural networks and transformers [57.43518732385863]
  We develop three alternatives to tackle the problem of forecasting the customer sales at day/store/item level using deep learning techniques. Our empirical results show how good performance can be achieved by using a simple sequence to sequence architecture with minimal data preprocessing effort. The proposed solution achieves a RMSLE of around 0.54, which is competitive with other more specific solutions to the problem proposed in the Kaggle competition.
  arXiv  Detail & Related papers  (2022-04-16T12:03:52Z)
• Towards Revenue Maximization with Popular and Profitable Products [69.21810902381009]
  A common goal for companies marketing is to maximize the return revenue/profit by utilizing the various effective marketing strategies. Finding credible and reliable information on products' profitability is difficult since most products tends to peak at certain times. This paper proposes a general profit-oriented framework to address the problem of revenue based on economic behavior, and conducting the 0n-shelf Popular and most Profitable Products (OPPPs) for the targeted marketing.
  arXiv  Detail & Related papers  (2022-02-26T02:07:25Z)
• E-Commerce Promotions Personalization via Online Multiple-Choice Knapsack with Uplift Modeling [1.027974860479791]
  We study the Online Constrained Multiple-Choice Promotions Personalization Problem. Our work formalizes the problem as an Online Multiple Choice Knapsack Problem. We provide a real-time adaptive method that guarantees budget constraints compliance.
  arXiv  Detail & Related papers  (2021-08-11T15:09:16Z)
• Markdowns in E-Commerce Fresh Retail: A Counterfactual Prediction and Multi-Period Optimization Approach [29.11201102550876]
  We build a semi-parametric structural model to learn individual price elasticity and predict counterfactual demand. We propose a multi-period dynamic pricing algorithm to maximize the overall profit of a perishable product over its finite selling horizon. The proposed framework has been successfully deployed to the well-known e-commerce fresh retail scenario - Freshippo.
  arXiv  Detail & Related papers  (2021-05-18T07:01:37Z)
• Function Design for Improved Competitive Ratio in Online Resource Allocation with Procurement Costs [16.68130648568593]
  We study the problem of online resource allocation, where multiple customers arrive the seller must allocate resources to each incoming customer while also facing a procurement cost for the total allocation.
  arXiv  Detail & Related papers  (2020-12-23T02:32:47Z)
• 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)

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.