A Unified Online-Offline Framework for Co-Branding Campaign Recommendations
Xiangxiang Dai, Xiaowei Sun, Jinhang Zuo, Xutong Liu, John C. S. Lui
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper11
- Improved Optimistic Algorithms for Logistic BanditsLouis Faury, Marc Abeille, Clément Calauzènes, Olivier FercoqICML 2020 · 被引用 127 次
- Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive RecommendationChongming Gao, Kexin Huang, Jiawei Chen, Yuan Zhang 等SIGIR 2023 · 被引用 65 次
- Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent ArmsXutong Liu, Jinhang Zuo, Siwei Wang, Carlee Joe-Wong 等NeurIPS 2022 · 被引用 31 次
- Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online LearningXutong Liu, Jinhang Zuo, Xiaowei Chen, Wei Chen 等ICML 2021 · 被引用 17 次
- Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular BanditsZongqi Wan, Jialin Zhang, Wei Chen, Xiaoming Sun 等ICML 2023 · 被引用 11 次
相关 Paper
- Interpolating Item and User Fairness in Multi-Sided RecommendationsQinyi Chen, Jason Cheuk Nam Liang, Negin Golrezaei, Djallel BouneffoufNeurIPS 2024 · 被引用 8 次
- Optimising Budget Management via Primal-Dual Approximation with Constrained Polynomial Weights UpdateDmitrii Moor, Per Berglund, Hannes Karlbom, Zhenwen Dai 等KDD 2025
- Learning Peer Influence Probabilities with Linear Contextual BanditsAhmed Sayeed Faruk, Mohammad Shahverdikondori, Elena ZhelevaKDD 2026 · 被引用 2 次
- Meta Clustering of Neural BanditsYikun Ban, Yunzhe Qi, Tianxin Wei, Lihui Liu 等KDD 2024 · 被引用 6 次
- Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial ContextsZhuohua Li, Maoli Liu, Xiangxiang Dai, John C. S. LuiICLR 2025
