跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-08 16:36 · 全站最近入库:2026-11-08 06:02各信源进度 →

统计口径与数据新鲜度

统计 2026-11-07 16:42 — 2026-11-08 16:42(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-08 16:36最近发现新增版本:2026-11-08 06:02库内论文最新更新时间:2026-11-06 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

17,100 已收录论文14,661 AI 相关4,057 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-08 16:33(北京时间)
版本更新 · v2arXiv:2512.17262

SHARP-QoS: Sparsely-gated Hierarchical Adaptive Routing for Joint Prediction of QoS

Suraj Kumar, Arvind Kumar, Soumi Chattopadhyay

原文摘要

Dependable service-oriented computing relies on multiple Quality-of-Service (QoS) parameters to assess service performance. However, real-world QoS data are often sparse, noisy, and shaped by hierarchical dependencies arising from QoS interactions, geographical constraints, and network-level factors, making accurate prediction challenging. Existing deep learning-based methods often predict each QoS parameter separately, requiring multiple similar models, which increases computational overhead and limits their suitability for applications requiring joint decisions across multiple QoS parameters. Although recent joint QoS prediction studies employ shared architectures, differences in numerical ranges across QoS parameters can lead to task imbalance and negative transfer, while inadequate representation learning and suboptimal joint optimization can degrade prediction accuracy. We present SHARP-QoS, a joint QoS prediction framework with three components. First, hyperbolic graph and hypergraph convolutions in the Poincaré ball extract hierarchical features from QoS invocation and contextual graphs. Second, sparsely gated sub-network routing selectively shares contextual and cross-QoS features, and a gated fusion module combines them with the structural features. Third, an EMA-based loss-balancing strategy smooths short-term fluctuations in task losses to provide less fluctuating task weights. Experiments on three multi-QoS datasets covering two, three, and four QoS parameters show that SHARP-QoS achieves lower prediction errors than existing joint QoS prediction methods. Because its contextual branch relies only on public region and AS attributes, it supports prediction for new users and services. Ablation, hyperparameter, outlier, and scalability analyses further assess its performance, highlighting the trade-off between prediction accuracy and computational cost.

cs.LG