Targeted Advertising on Social Networks Using Online Variational Tensor Regression

• URL: http://arxiv.org/abs/2208.10627v4
• Date: Sat, 25 Jan 2025 02:46:51 GMT
• Title: Targeted Advertising on Social Networks Using Online Variational Tensor Regression
• Authors: Tsuyoshi Idé, Keerthiram Murugesan, Djallel Bouneffouf, Naoki Abe,
• Abstract summary: We propose what we believe is the first contextual bandit framework for online targeted advertising. The proposed framework is designed to accommodate any number of feature vectors in the form of multi-mode tensor. We empirically confirm that the proposedUCB algorithm achieves a significant improvement in influence tasks over the benchmarks.
• Score: 21.40403535421477
• License:
• Abstract: This paper is concerned with online targeted advertising on social networks. The main technical task we address is to estimate the activation probability for user pairs, which quantifies the influence one user may have on another towards purchasing decisions. This is a challenging task because one marketing episode typically involves a multitude of marketing campaigns/strategies of different products for highly diverse customers. In this paper, we propose what we believe is the first tensor-based contextual bandit framework for online targeted advertising. The proposed framework is designed to accommodate any number of feature vectors in the form of multi-mode tensor, thereby enabling to capture the heterogeneity that may exist over user preferences, products, and campaign strategies in a unified manner. To handle inter-dependency of tensor modes, we introduce an online variational algorithm with a mean-field approximation. We empirically confirm that the proposed TensorUCB algorithm achieves a significant improvement in influence maximization tasks over the benchmarks, which is attributable to its capability of capturing the user-product heterogeneity.

Related papers

• Transferable and Forecastable User Targeting Foundation Model [37.50233807898246]
  We propose FOUND, an industrial-grade, transferable, and forecastable user targeting foundation model. Our framework integrates heterogeneous multi-scenario user data, aligning them with one-sentence targeting demand inputs. Our approach significantly outperforms existing baselines in cross-domain, real-world user targeting scenarios.
  arXiv  Detail & Related papers  (2024-12-17T02:05:09Z)
• Maximizing the Success Probability of Policy Allocations in Online Systems [5.485872703839928]
  In this paper we consider the problem at the level of user timelines instead of individual bid requests. In order to optimally allocate policies to users, typical multiple treatments allocation methods solve knapsack-like problems. We introduce the SuccessProMax algorithm that aims at finding the policy allocation which is the most likely to outperform a fixed policy.
  arXiv  Detail & Related papers  (2023-12-26T10:55:33Z)
• Mutual-modality Adversarial Attack with Semantic Perturbation [81.66172089175346]
  We propose a novel approach that generates adversarial attacks in a mutual-modality optimization scheme. Our approach outperforms state-of-the-art attack methods and can be readily deployed as a plug-and-play solution.
  arXiv  Detail & Related papers  (2023-12-20T05:06:01Z)
• Entity-Graph Enhanced Cross-Modal Pretraining for Instance-level Product Retrieval [152.3504607706575]
  This research aims to conduct weakly-supervised multi-modal instance-level product retrieval for fine-grained product categories. We first contribute the Product1M datasets, and define two real practical instance-level retrieval tasks. We exploit to train a more effective cross-modal model which is adaptively capable of incorporating key concept information from the multi-modal data.
  arXiv  Detail & Related papers  (2022-06-17T15:40:45Z)
• Byzantine-Robust Online and Offline Distributed Reinforcement Learning [60.970950468309056]
  We consider a distributed reinforcement learning setting where multiple agents explore the environment and communicate their experiences through a central server. $alpha$-fraction of agents are adversarial and can report arbitrary fake information. We seek to identify a near-optimal policy for the underlying Markov decision process in the presence of these adversarial agents.
  arXiv  Detail & Related papers  (2022-06-01T00:44:53Z)
• Preference Enhanced Social Influence Modeling for Network-Aware Cascade Prediction [59.221668173521884]
  We propose a novel framework to promote cascade size prediction by enhancing the user preference modeling. Our end-to-end method makes the user activating process of information diffusion more adaptive and accurate.
  arXiv  Detail & Related papers  (2022-04-18T09:25:06Z)
• Evaluating Deep Vs. Wide & Deep Learners As Contextual Bandits For Personalized Email Promo Recommendations [1.1213676742918772]
  Personalization enables businesses to learn customer preferences from past interactions. We consider the problem of predicting the optimal promotional offer for a given customer out of several options as a contextual bandit problem.
  arXiv  Detail & Related papers  (2022-01-31T23:26:17Z)
• Contextual Bandits for Advertising Campaigns: A Diffusion-Model Independent Approach (Extended Version) [73.59962178534361]
  We study an influence problem in which little is assumed to be known about the diffusion network or about the model that determines how information may propagate. In this setting, an explore-exploit approach could be used to learn the key underlying diffusion parameters, while running the campaign. We describe and compare two methods of contextual multi-armed bandits, with upper-confidence bounds on the remaining potential of influencers.
  arXiv  Detail & Related papers  (2022-01-13T22:06:10Z)
• DCAP: Deep Cross Attentional Product Network for User Response Prediction [20.17934000984361]
  We propose a novel architecture Deep Cross Attentional Product Network (DCAP) DCAP keeps cross network's benefits in modeling high-order feature interactions explicitly at the vector-wise level. Our proposed model can be easily implemented and train in parallel.
  arXiv  Detail & Related papers  (2021-05-18T16:27:20Z)
• Learning to Infer User Hidden States for Online Sequential Advertising [52.169666997331724]
  We propose our Deep Intents Sequential Advertising (DISA) method to address these issues. The key part of interpretability is to understand a consumer's purchase intent which is, however, unobservable (called hidden states)
  arXiv  Detail & Related papers  (2020-09-03T05:12:26Z)

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.