Constrained user-item allocation for e-commerce marketing campaigns

• URL: http://arxiv.org/abs/2606.09623v1
• Date: Mon, 08 Jun 2026 15:26:14 GMT
• Title: Constrained user-item allocation for e-commerce marketing campaigns
• Abstract summary: We formalize this problem as auto-targeting: jointly selecting users and items to construct multiple disjoint campaigns.<n>We propose three complementary strategies: (i) constrained spectral biclustering to find dense regions in the user-item affinity matrix, (ii) greedy local search with pairwise swaps for greedy refinement, and (iii) a multi-armed bandit framework to escape local optima.<n>Results show that biclustering consistently achieves the highest campaign quality, lift, and fairness scores.
• Score: 0.5219568203653523
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: When running marketing campaigns, retailers must decide which products to promote and which users to target. These decisions are inherently coupled: effective campaigns match users and items with strong mutual affinity into non-overlapping groups of predefined sizes. However, existing approaches assume predefined campaign structure or decouple item selection from user assignment, and cannot discover campaign groupings directly from joint interaction patterns. We therefore formalize this campaign problem as auto-targeting: jointly selecting users and items to construct multiple disjoint campaigns. To solve this combinatorial problem, we propose three complementary strategies: (i) constrained spectral biclustering to find dense regions in the user-item affinity matrix, (ii) greedy local search with pairwise swaps for combinatorial refinement, and (iii) a multi-armed bandit framework to escape local optima through exploration. We evaluate these methods on a synthetic dataset, the Amazon Reviews benchmarks, and large-scale proprietary commercial data, and compare the results to simulated annealing as a baseline. The results show that biclustering consistently achieves the highest campaign quality, lift, and fairness scores. While biclustering runs efficiently on smaller datasets, its runtime increases substantially on very large ones, where bandit-based methods instead offer a scalable alternative.

Related papers

• Collaborative Group-Aware Hashing for Fast Recommender Systems [66.92426381995695]
  Hash technique has shown its superiority for speeding up the online recommendation by bit operations on Hamming distance computations.<n>Existing hashing-based recommendations suffer from low accuracy, especially with sparse settings.<n>This paper lodges a Collaborative Group-Aware Hashing (CGAH) method for both collaborative filtering and content-aware recommendations.
  arXiv  Detail & Related papers  (2025-12-23T09:07:28Z)
• Online Clustering of Dueling Bandits [59.09590979404303]
  We introduce the first "clustering of dueling bandit algorithms" to enable collaborative decision-making based on preference feedback.<n>We propose two novel algorithms: (1) Clustering of Linear Dueling Bandits (COLDB) which models the user reward functions as linear functions of the context vectors, and (2) Clustering of Neural Dueling Bandits (CONDB) which uses a neural network to model complex, non-linear user reward functions.
  arXiv  Detail & Related papers  (2025-02-04T07:55:41Z)
• Text-Based Product Matching -- Semi-Supervised Clustering Approach [9.748519919202986]
  This paper aims to present a new philosophy to product matching utilizing a semi-supervised clustering approach. We study the properties of this method by experimenting with the IDEC algorithm on the real-world dataset.
  arXiv  Detail & Related papers  (2024-02-01T18:52:26Z)
• Efficient Bilateral Cross-Modality Cluster Matching for Unsupervised Visible-Infrared Person ReID [56.573905143954015]
  We propose a novel bilateral cluster matching-based learning framework to reduce the modality gap by matching cross-modality clusters. Under such a supervisory signal, a Modality-Specific and Modality-Agnostic (MSMA) contrastive learning framework is proposed to align features jointly at a cluster-level. Experiments on the public SYSU-MM01 and RegDB datasets demonstrate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2023-05-22T03:27:46Z)
• Robust Consensus Clustering and its Applications for Advertising Forecasting [18.242055675730253]
  We propose a novel algorithm -- robust consensus clustering that can find common ground truth among experts' opinions. We apply the proposed method to the real-world advertising campaign segmentation and forecasting tasks.
  arXiv  Detail & Related papers  (2022-12-27T21:49:04Z)
• Advertising Media and Target Audience Optimization via High-dimensional Bandits [2.5137859989323537]
  We present a data-driven algorithm that advertisers can use to automate their digital ad-campaigns at online publishers. The algorithm enables the advertiser to search across available target audiences and ad-media to find the best possible combination for its campaign via online experimentation.
  arXiv  Detail & Related papers  (2022-09-17T21:00:53Z)
• Targeted Advertising on Social Networks Using Online Variational Tensor Regression [21.40403535421477]
  We propose what we believe is the first contextual bandit framework for online targeted advertising.<n>The proposed framework is designed to accommodate any number of feature vectors in the form of multi-mode tensor.<n>We empirically confirm that the proposedUCB algorithm achieves a significant improvement in influence tasks over the benchmarks.
  arXiv  Detail & Related papers  (2022-08-22T22:10:45Z)
• Time Series Clustering for Grouping Products Based on Price and Sales Patterns [0.3518016233072556]
  We propose a novel distance metric that takes into account how product prices and sales move together. We evaluate the performances of different clustering algorithms using our custom evaluation metric and Calinski Harabasz and Davies Bouldin indices.
  arXiv  Detail & Related papers  (2022-04-18T14:24:42Z)
• 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)
• Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons [85.5955376526419]
  In rank aggregation problems, users exhibit various accuracy levels when comparing pairs of items. We propose an elimination-based active sampling strategy, which estimates the ranking of items via noisy pairwise comparisons. We prove that our algorithm can return the true ranking of items with high probability.
  arXiv  Detail & Related papers  (2021-10-08T13:51:55Z)
• Optimal Clustering from Noisy Binary Feedback [75.17453757892152]
  We study the problem of clustering a set of items from binary user feedback. We devise an algorithm with a minimal cluster recovery error rate. For adaptive selection, we develop an algorithm inspired by the derivation of the information-theoretical error lower bounds.
  arXiv  Detail & Related papers  (2019-10-14T09:18: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.