通过模型与系统协同优化,显著降低推荐系统延迟。
Deep Learning Model Acceleration and Optimization Strategies for Real-Time Recommendation Systems
- 设计轻量网络并结合剪枝量化压缩模型。
- 推理延迟降至基线30%以下,吞吐量翻倍。
- 适合大规模在线推荐系统部署者参考。
随着互联网服务的快速发展,推荐系统在个性化内容分发中扮演核心角色。面对海量用户请求和复杂模型架构,实时推荐系统的关键挑战是如何在不牺牲推荐质量的前提下降低推理延迟并提升系统吞吐量。本文通过融合建模级与系统级加速优化策略,解决深度学习模型在实时场景下的高计算成本与资源瓶颈问题。在模型层面,采用轻量网络设计、结构化剪枝和权重量化,大幅减少参数量与计算需求;在系统层面,整合异构计算平台与高性能推理库,并基于实时负载特征设计弹性推理调度与负载均衡机制。实验表明,在保持原始推荐精度的前提下,所提方法将延迟降低至基线的30%以下,系统吞吐量提升超过一倍,为大规模在线推荐服务部署提供了切实可行的解决方案。
原文摘要 · Abstract (English)
With the rapid growth of Internet services, recommendation systems play a central role in delivering personalized content. Faced with massive user requests and complex model architectures, the key challenge for real-time recommendation systems is how to reduce inference latency and increase system throughput without sacrificing recommendation quality. This paper addresses the high computational cost and resource bottlenecks of deep learning models in real-time settings by proposing a combined set of modeling- and system-level acceleration and optimization strategies. At the model level, we dramatically reduce parameter counts and compute requirements through lightweight network design, structured pruning, and weight quantization. At the system level, we integrate multiple heterogeneous compute platforms and high-performance inference libraries, and we design elastic inference scheduling and load-balancing mechanisms based on real-time load characteristics. Experiments show that, while maintaining the original recommendation accuracy, our methods cut latency to less than 30% of the baseline and more than double system throughput, offering a practical solution for deploying large-scale online recommendation services.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。