mlsanityData to 14 Oct 2026

A Unified Online-Offline Framework for Co-Branding Campaign Recommendations

arXiv 2505.22254 ↗First posted 28 May 2025cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Co-branding has become a vital strategy for businesses aiming to expand market reach within recommendation systems. However, identifying effective cross-industry partnerships remains challenging due to resource imbalances, uncertain brand willingness, and ever-changing market conditions. In this paper, we provide the first systematic study of this problem and propose a unified online-offline framework to enable co-branding recommendations. Our approach begins by constructing a bipartite graph linking ``initiating'' and ``target'' brands to quantify co-branding probabilities and assess market benefits. During the online learning phase, we dynamically update the graph in response to market feedback, while striking a balance between exploring new collaborations for long-term gains and exploiting established partnerships for immediate benefits. To address the high initial co-branding costs, our framework mitigates redundant exploration, thereby enhancing short-term performance while ensuring sustainable strategic growth. In the offline optimization phase, our framework consolidates the interests of multiple sub-brands under the same parent brand to maximize overall returns, avoid excessive investment in single sub-brands, and reduce unnecessary costs associated with over-prioritizing a single sub-brand. We present a theoretical analysis of our approach, establishing a highly nontrivial sublinear regret bound for online learning in the complex co-branding problem, and enhancing the approximation guarantee for the NP-hard offline budget allocation optimization. Experiments on both synthetic and real-world co-branding datasets demonstrate the practical effectiveness of our framework, with at least 12% improvement.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 36 references that are in the map. First posted on arXiv 28 May 2025.

Builds on

13 of 36 references.

References · 13

  1. 2020Improved Optimistic Algorithms for Logistic Banditscited by 118
  2. 2014Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Armscited by 79
  3. 2018Thompson Sampling for Combinatorial Semi-Banditscited by 78
  4. 2017Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applicationscited by 45
  5. 2024Cost-Effective Online Multi-LLM Selection with Versatile Reward Modelscited by 39
  6. 2023Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendationcited by 38
  7. 2022Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Armscited by 15
  8. 2020Dual-Mandate Patrols: Multi-Armed Bandits for Green Securitycited by 14
  9. 2023Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Banditscited by 13
  10. 2021Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learningcited by 6
  11. 2023Budgeted Multi-Armed Bandits with Asymmetric Confidence Intervalscited by 6
  12. 2024Conversational Dueling Bandits in Generalized Linear Modelscited by 5
1 more
  1. 2025Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contextscited by 3

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.