mlsanityData to 14 Oct 2026

Who Are the Best Adopters? User Selection Model for Free Trial Item Promotion

arXiv 2202.09508 ↗First posted 19 Feb 2022cs.IR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

With the increasingly fierce market competition, offering a free trial has become a potent stimuli strategy to promote products and attract users. By providing users with opportunities to experience goods without charge, a free trial makes adopters know more about products and thus encourages their willingness to buy. However, as the critical point in the promotion process, finding the proper adopters is rarely explored. Empirically winnowing users by their static demographic attributes is feasible but less effective, neglecting their personalized preferences. To dynamically match the products with the best adopters, in this work, we propose a novel free trial user selection model named SMILE, which is based on reinforcement learning (RL) where an agent actively selects specific adopters aiming to maximize the profit after free trials. Specifically, we design a tree structure to reformulate the action space, which allows us to select adopters from massive user space efficiently. The experimental analysis on three datasets demonstrates the proposed model's superiority and elucidates why reinforcement learning and tree structure can improve performance. Our study demonstrates technical feasibility for constructing a more robust and intelligent user selection model and guides for investigating more marketing promotion strategies.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 76 references that are in the map. First posted on arXiv 19 Feb 2022.

Builds on

20 of 76 references.

References · 20

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2015Continuous control with deep reinforcement learningcited by 3,407
  3. 2017Neural Collaborative Filteringcited by 1,111
  4. 2015Session-based Recommendations with Recurrent Neural Networkscited by 695
  5. 2019Neural Graph Collaborative Filteringcited by 661
  6. 2018Session-based Recommendation with Graph Neural Networkscited by 312
  7. 2018Adversarial Attack on Graph Structured Datacited by 301
  8. 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 182
  9. 2015Deep Reinforcement Learning in Large Discrete Action Spacescited by 161
  10. 2021Advances and Challenges in Conversational Recommender Systems: A Surveycited by 118
  11. 2018Deep Reinforcement Learning for Page-wise Recommendationscited by 100
  12. 2017Real-Time Bidding by Reinforcement Learning in Display Advertisingcited by 91
8 more
  1. 2017Deep Reinforcement Learning for Sepsis Treatmentcited by 71
  2. 2018Recommendations with Negative Feedback via Pairwise Deep Reinforcement Learningcited by 71
  3. 2019The Unfairness of Popularity Bias in Recommendationcited by 70
  4. 2018Real-Time Bidding with Multi-Agent Reinforcement Learning in Display Advertisingcited by 65
  5. 2018Reinforcement Learning to Rank in E-Commerce Search Engine: Formalization, Analysis, and Applicationcited by 34
  6. 2018Large-scale Interactive Recommendation with Tree-structured Policy Gradientcited by 30
  7. 2019Adaptive Greedy versus Non-adaptive Greedy for Influence Maximizationcited by 3
  8. 2019MarlRank: Multi-agent Reinforced Learning to Rankcited by 2

Built on by

Not cited yet.