arXiv:2602.12041cs.IR2026-02

提出多级压缩交叉网络,高效建模高阶特征交互,兼顾性能与资源消耗。

Compress, Cross and Scale: Multi-Level Compression Cross Networks for Efficient Scaling in Recommender Systems

  • 通过分层压缩与动态组合实现特征交叉的结构化组织。
  • 相比基线模型,参数和计算量减少26倍,AUC最高提升0.52。
  • 适合对延迟和资源敏感的工业推荐系统,尤其适合横向扩展场景。

高效建模高阶特征交互是点击率与转化率预测的核心挑战。当前工业推荐系统普遍基于深度学习模型,其中交互主干决定预测性能与系统效率。然而,现有交互模块难以同时实现强交互能力、高计算效率与良好可扩展性,在严格生产约束下模型扩容收益有限。本文提出MLCC,一种通过分层压缩与动态组合组织特征交叉的结构化交互架构,能高效捕捉高阶特征依赖,同时保持较低计算复杂度。进一步提出MC-MLCC,通过将特征交互分解到并行子空间实现多通道扩展,支持高效水平扩展,提升表示能力且显著降低参数增长。在三个公开数据集及一个大规模工业数据集上的实验表明,所提模型在相当性能下,参数与浮点运算量最多减少26倍,相较强力基线(DLRM风格)最高提升0.52 AUC。全面的扩展性分析显示,在嵌入维度、头数和通道数上均具稳定可预测的扩展行为,通道扩展效率远超传统嵌入膨胀方式。真实广告平台的在线A/B测试验证了该方法的实际有效性,已在哔哩哔哩广告系统中广泛部署,满足严苛的延迟与资源约束。

原文摘要 · Abstract (English)

Modeling high-order feature interactions efficiently is a central challenge in click-through rate and conversion rate prediction. Modern industrial recommender systems are predominantly built upon deep learning recommendation models, where the interaction backbone plays a critical role in determining both predictive performance and system efficiency. However, existing interaction modules often struggle to simultaneously achieve strong interaction capacity, high computational efficiency, and good scalability, resulting in limited ROI when models are scaled under strict production constraints. In this work, we propose MLCC, a structured feature interaction architecture that organizes feature crosses through hierarchical compression and dynamic composition, which can efficiently capture high-order feature dependencies while maintaining favorable computational complexity. We further introduce MC-MLCC, a Multi-Channel extension that decomposes feature interactions into parallel subspaces, enabling efficient horizontal scaling with improved representation capacity and significantly reduced parameter growth. Extensive experiments on three public benchmarks and a large-scale industrial dataset show that our proposed models consistently outperform strong DLRM-style baselines by up to 0.52 AUC, while reducing model parameters and FLOPs by up to 26$\times$ under comparable performance. Comprehensive scaling analyses demonstrate stable and predictable scaling behavior across embedding dimension, head number, and channel count, with channel-based scaling achieving substantially better efficiency than conventional embedding inflation. Finally, online A/B testing on a real-world advertising platform validates the practical effectiveness of our approach, which has been widely adopted in Bilibili advertising system under strict latency and resource constraints.

推荐系统特征交互模型压缩高效扩展

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。