提出SHARP-QoS模型,联合预测多个QoS参数,解决数据稀疏与误差传播问题。
SHARP-QoS: Sparsely-gated Hierarchical Adaptive Routing for joint Prediction of QoS
- 用双机制提取服务与上下文的分层特征,结合双曲空间建模复杂依赖
- 自适应共享特征并动态选择融合结构与共用表示,提升表达能力
- 采用基于EMA的损失平衡策略,稳定联合优化,适合实际系统部署
可靠的服务计算依赖多个服务质量(QoS)参数来评估服务最优性。然而真实世界的QoS数据极度稀疏、噪声大,并受服务交互、地理和网络层级因素影响,导致准确预测困难。现有方法通常分别预测每个QoS参数,需多个相似模型,增加计算开销且泛化性差。尽管近期研究尝试联合预测,但因不同参数数值范围差异导致损失缩放问题,引发负迁移,且表征学习不足,精度下降。本文提出统一联合预测框架SHARP-QoS,包含三项创新:首先,通过庞加莱球中的双曲卷积,从服务与上下文结构中提取层次特征;其次,设计自适应特征共享机制,支持信息丰富的QoS与上下文信号间动态特征交换,并采用门控融合模块实现结构与共享表示的动态选择;第三,引入基于指数移动平均(EMA)的损失平衡策略,实现稳定联合优化,缓解负迁移。在包含2、3、4个QoS参数的三个数据集上评估显示,SHARP-QoS优于单任务与多任务基线。大量实验表明,该模型有效应对稀疏性、抗异常值、冷启动等挑战,同时保持适中计算开销,展现出可靠的联合QoS预测能力。
原文摘要 · Abstract (English)
Dependable service-oriented computing relies on multiple Quality of Service (QoS) parameters that are essential to assess service optimality. However, real-world QoS data are extremely sparse, noisy, and shaped by hierarchical dependencies arising from QoS interactions, and geographical and network-level factors, making accurate QoS prediction challenging. Existing methods often predict each QoS parameter separately, requiring multiple similar models, which increases computational cost and leads to poor generalization. Although recent joint QoS prediction studies have explored shared architectures, they suffer from negative transfer due to loss-scaling caused by inconsistent numerical ranges across QoS parameters and further struggle with inadequate representation learning, resulting in degraded accuracy. This paper presents an unified strategy for joint QoS prediction, called SHARP-QoS, that addresses these issues using three components. First, we introduce a dual mechanism to extract the hierarchical features from both QoS and contextual structures via hyperbolic convolution formulated in the Poincaré ball. Second, we propose an adaptive feature-sharing mechanism that allows feature exchange across informative QoS and contextual signals. A gated feature fusion module is employed to support dynamic feature selection among structural and shared representations. Third, we design an EMA-based loss balancing strategy that allows stable joint optimization, thereby mitigating the negative transfer. Evaluations on three datasets with two, three, and four QoS parameters demonstrate that SHARP-QoS outperforms both single- and multi-task baselines. Extensive study shows that our model effectively addresses major challenges, including sparsity, robustness to outliers, and cold-start, while maintaining moderate computational overhead, underscoring its capability for reliable joint QoS prediction.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。