A Unified Online-Offline Framework for Co-Branding Campaign Recommendations
Xiangxiang Dai, Xiaowei Sun, Jinhang Zuo, Xutong Liu, John C. S. Lui
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on11
- Improved Optimistic Algorithms for Logistic BanditsLouis Faury, Marc Abeille, Clément Calauzènes, Olivier FercoqICML 2020 · 127 citations
- Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive RecommendationChongming Gao, Kexin Huang, Jiawei Chen, Yuan Zhang et al.SIGIR 2023 · 65 citations
- Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent ArmsXutong Liu, Jinhang Zuo, Siwei Wang, Carlee Joe-Wong et al.NeurIPS 2022 · 31 citations
- Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online LearningXutong Liu, Jinhang Zuo, Xiaowei Chen, Wei Chen et al.ICML 2021 · 17 citations
- Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular BanditsZongqi Wan, Jialin Zhang, Wei Chen, Xiaoming Sun et al.ICML 2023 · 11 citations
Related papers
- Interpolating Item and User Fairness in Multi-Sided RecommendationsQinyi Chen, Jason Cheuk Nam Liang, Negin Golrezaei, Djallel BouneffoufNeurIPS 2024 · 8 citations
- Optimising Budget Management via Primal-Dual Approximation with Constrained Polynomial Weights UpdateDmitrii Moor, Per Berglund, Hannes Karlbom, Zhenwen Dai et al.KDD 2025
- Learning Peer Influence Probabilities with Linear Contextual BanditsAhmed Sayeed Faruk, Mohammad Shahverdikondori, Elena ZhelevaKDD 2026 · 2 citations
- Meta Clustering of Neural BanditsYikun Ban, Yunzhe Qi, Tianxin Wei, Lihui Liu et al.KDD 2024 · 6 citations
- Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial ContextsZhuohua Li, Maoli Liu, Xiangxiang Dai, John C. S. LuiICLR 2025
