Mobile Gamer Lifetime Value Prediction via Objective Decomposition and Reconstruction

• URL: http://arxiv.org/abs/2510.08281v1
• Date: Thu, 09 Oct 2025 14:33:12 GMT
• Title: Mobile Gamer Lifetime Value Prediction via Objective Decomposition and Reconstruction
• Authors: Tianwei Li, Yu Zhao, Yunze Li, Sheng Li,
• Abstract summary: In this paper, we propose a novel LTV prediction method to address distribution challenges through an objective decomposition and reconstruction framework.<n>Based on the in-app purchase characteristics of mobile gamers, our model was designed to first predict the number of transactions at specific prices and then calculate the total payment amount from these intermediate predictions.<n>Our proposed model was evaluated through experiments on real-world industrial dataset, and deployed on the TapTap RTB advertising system for online A/B testing along with the state-of-the-art ZILN model.
• Score: 9.270686163643672
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: For Internet platforms operating real-time bidding (RTB) advertising service, a comprehensive understanding of user lifetime value (LTV) plays a pivotal role in optimizing advertisement allocation efficiency and maximizing the return on investment (ROI) for advertisement sponsors, thereby facilitating growth of commercialization revenue for the platform. However, the inherent complexity of user LTV distributions induces significant challenges in accurate LTV prediction. Existing state-of-the-art works, which primarily focus on directly learning the LTV distributions through well-designed loss functions, achieve limited success due to their vulnerability to outliers. In this paper, we proposed a novel LTV prediction method to address distribution challenges through an objective decomposition and reconstruction framework. Briefly speaking, based on the in-app purchase characteristics of mobile gamers, our model was designed to first predict the number of transactions at specific prices and then calculate the total payment amount from these intermediate predictions. Our proposed model was evaluated through experiments on real-world industrial dataset, and deployed on the TapTap RTB advertising system for online A/B testing along with the state-of-the-art ZILN model.

Related papers

• SHORE: A Long-term User Lifetime Value Prediction Model in Digital Games [0.7256915467062311]
  Long-term user lifetime value (LTV) prediction is essential for monetization strategy in digital games.<n>Current models often underestimate long-term value or suffer from poor robustness.<n>We propose a novel LTV prediction framework that integrates short-horizon predictions and order-preserving REgression.
  arXiv  Detail & Related papers  (2025-06-12T08:42:11Z)
• Customer Lifetime Value Prediction with Uncertainty Estimation Using Monte Carlo Dropout [3.187236205541292]
  We propose a novel approach that enhances the architecture of purely neural network models by incorporating the Monte Carlo Dropout (MCD) framework. We benchmarked the proposed method using data from one of the most downloaded mobile games in the world. Our approach provides confidence metric as an extra dimension for performance evaluation across various neural network models.
  arXiv  Detail & Related papers  (2024-11-24T18:14:44Z)
• BreakGPT: Leveraging Large Language Models for Predicting Asset Price Surges [55.2480439325792]
  This paper introduces BreakGPT, a novel large language model (LLM) architecture adapted specifically for time series forecasting and the prediction of sharp upward movements in asset prices. We showcase BreakGPT as a promising solution for financial forecasting with minimal training and as a strong competitor for capturing both local and global temporal dependencies.
  arXiv  Detail & Related papers  (2024-11-09T05:40:32Z)
• ADSNet: Cross-Domain LTV Prediction with an Adaptive Siamese Network in Advertising [28.894933598821527]
  Advertising platforms have evolved in estimating Lifetime Value (LTV) to better align with advertisers' true performance metric. Sparsity of real-world LTV data presents a significant challenge to LTV predictive model. We propose to utilize external data to expand the size of purchase samples and enhance the LTV prediction model.
  arXiv  Detail & Related papers  (2024-06-15T06:04:46Z)
• 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)
• An Auction-based Marketplace for Model Trading in Federated Learning [54.79736037670377]
  Federated learning (FL) is increasingly recognized for its efficacy in training models using locally distributed data. We frame FL as a marketplace of models, where clients act as both buyers and sellers. We propose an auction-based solution to ensure proper pricing based on performance gain.
  arXiv  Detail & Related papers  (2024-02-02T07:25:53Z)
• Contrastive Multi-view Framework for Customer Lifetime Value Prediction [48.24479287526052]
  Many existing LTV prediction methods directly train a single-view LTV predictor on consumption samples. We propose a contrastive multi-view framework for LTV prediction, which is a plug-and-play solution compatible with various backbone models. We conduct extensive experiments on a real-world game LTV prediction dataset and the results validate the effectiveness of our method.
  arXiv  Detail & Related papers  (2023-06-26T03:23:53Z)
• Can ChatGPT Forecast Stock Price Movements? Return Predictability and Large Language Models [51.3422222472898]
  We document the capability of large language models (LLMs) like ChatGPT to predict stock price movements using news headlines. We develop a theoretical model incorporating information capacity constraints, underreaction, limits-to-arbitrage, and LLMs.
  arXiv  Detail & Related papers  (2023-04-15T19:22:37Z)
• 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)
• 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)
• Arbitrary Distribution Modeling with Censorship in Real-Time Bidding Advertising [2.562910030418378]
  The purpose of Inventory Pricing is to bid the right prices to online ad opportunities, which is crucial for a Demand-Side Platform (DSP) to win auctions in Real-Time Bidding (RTB) Most of the previous works made strong assumptions on the distribution form of the winning price, which reduced their accuracy and weakened their ability to make generalizations. We propose a novel loss function, Neighborhood Likelihood Loss (NLL), collaborating with a proposed framework, Arbitrary Distribution Modeling (ADM) to predict the winning price distribution under censorship.
  arXiv  Detail & Related papers  (2021-10-26T11:40:00Z)

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.