提出统一框架,解决品牌联名推荐中的合作匹配与资源分配难题。
A Unified Online-Offline Framework for Co-Branding Campaign Recommendations
- 构建双向品牌图谱,动态调整联名策略以平衡探索与收益。
- 在线阶段实现至少12%性能提升,离线阶段优化多子品牌投资分配。
- 适合需要跨行业合作推荐的电商平台和品牌方参考。
品牌联名已成为推荐系统中拓展市场的重要策略,但跨行业合作匹配面临资源不均、品牌意愿不确定及市场变化快等挑战。本文首次系统研究该问题,提出统一的在线-离线联合框架。方法首先构建连接‘发起品牌’与‘目标品牌’的二分图,量化联名概率并评估市场收益。在线学习阶段,根据市场反馈动态更新图结构,平衡探索新合作与利用已有合作的长期与短期收益;通过减少冗余探索,缓解初始高成本问题,提升短期表现并保障可持续增长。离线优化阶段,整合同一母品牌下多个子品牌的利益,最大化整体回报,避免对单一子品牌过度投入,降低不必要的成本。理论分析表明,该方法在复杂联名场景中实现了非平凡的次线性遗憾边界,并提升了NP-hard预算分配优化的近似保证。在合成与真实世界数据集上的实验验证了框架的有效性,性能至少提升12%。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。