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

• URL: http://arxiv.org/abs/2512.17262v1
• Date: Fri, 19 Dec 2025 06:25:05 GMT
• Title: SHARP-QoS: Sparsely-gated Hierarchical Adaptive Routing for joint Prediction of QoS
• Authors: Suraj Kumar, Arvind Kumar, Soumi Chattopadhyay,
• Abstract summary: Service-oriented computing relies on multiple Quality of Service (QoS) parameters that are essential to assess service optimality.<n>Existing methods often predict each parameter separately, requiring multiple similar models, which increases computational cost and leads to poor generalization.<n>This paper presents an unified strategy for joint prediction, called SHARP-QoS, that addresses these issues using three components.
• Score: 2.2567016485314797
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Relatron: Automating Relational Machine Learning over Relational Databases [50.94254514286021]
  We present a study that unifies RDL and DFS in a shared design space and conducts architecture-centric searches across diverse RDB tasks.<n>Our analysis yields three key findings: (1) RDL does not consistently outperform DFS, with performance being highly task-dependent; (2) no single architecture dominates across tasks, underscoring the need for task-aware model selection; and accuracy is an unreliable guide for choice architecture.
  arXiv  Detail & Related papers  (2026-02-26T02:45:22Z)
• QoS-Aware Hierarchical Reinforcement Learning for Joint Link Selection and Trajectory Optimization in SAGIN-Supported UAV Mobility Management [52.15690855486153]
  A space-air-ground integrated network (SAGIN) has emerged as an essential architecture for enabling ubiquitous UAV connectivity.<n>This paper formulates UAV mobility management in SAGIN as a constrained multiobjective joint optimization problem.
  arXiv  Detail & Related papers  (2025-12-17T06:22:46Z)
• Analog Quantum Feature Selection with Neutral-Atom Quantum Processors [31.458406135473805]
  We present a quantum-native approach to quantum feature selection (QFS) based on analog quantum simulation with neutral atom arrays.<n>The protocol is evaluated through simulations on three benchmark binary classification datasets: Adult Income, Bank Marketing, and Telco Churn.<n>For compact subsets of 2-5 features, analog QFS improves mean AUC scores by 1.5-2.3% while reducing the number of features by 75-84%.
  arXiv  Detail & Related papers  (2025-10-23T17:57:34Z)
• Test-time Verification via Optimal Transport: Coverage, ROC, & Sub-optimality [53.03186946689658]
  Test-time scaling with verification has shown promise in improving the performance of large language models.<n>The effect of verification manifests through interactions of three quantities: (i) the generator's coverage, (ii) the verifier's region of convergence (ROC), and (iii) the sampling algorithm's sub-optimality.<n>We frame verifiable test-time scaling as a transport problem. This characterizes the interaction of coverage, ROC, and sub-optimality.
  arXiv  Detail & Related papers  (2025-10-21T18:05:42Z)
• Continual Action Quality Assessment via Adaptive Manifold-Aligned Graph Regularization [53.82400605816587]
  Action Quality Assessment (AQA) quantifies human actions in videos, supporting applications in sports scoring, rehabilitation, and skill evaluation.<n>A major challenge lies in the non-stationary nature of quality distributions in real-world scenarios.<n>We introduce Continual AQA (CAQA), which equips with Continual Learning capabilities to handle evolving distributions.
  arXiv  Detail & Related papers  (2025-10-08T10:09:47Z)
• Compressed Feature Quality Assessment: Dataset and Baselines [89.62929964441962]
  We propose the first benchmark dataset for evaluating semantic fidelity of compressed features.<n>We systematically assess three widely used metrics -- MSE, cosine similarity, and Centered Kernel Alignment (CKA) -- in terms of their ability to capture semantic degradation.<n>This work advances the field by establishing a foundational benchmark and providing a critical resource for the community to explore CFQA.
  arXiv  Detail & Related papers  (2025-06-09T04:16:39Z)
• Anomaly Resilient Temporal QoS Prediction using Hypergraph Convoluted Transformer Network [0.47248250311484113]
  Quality-of-Service (QoS) prediction is a critical task in the service lifecycle. Traditional methods often encounter data sparsity and cold-start issues. We introduce a real-time, trust-aware framework for temporal prediction.
  arXiv  Detail & Related papers  (2024-10-23T11:01:39Z)
• SPARQ: Efficient Entanglement Distribution and Routing in Space-Air-Ground Quantum Networks [50.91365514137301]
  Space-air-ground quantum (SPARQ) network is developed as a means for providing a seamless on-demand entanglement distribution. Deep reinforcement learning framework is proposed and trained using deep Q-network (DQN) on multiple graphs of SPARQ. Third-party entanglement distribution policy is proposed to establish entanglement between communication parties.
  arXiv  Detail & Related papers  (2024-09-19T16:31:37Z)
• ARRQP: Anomaly Resilient Real-time QoS Prediction Framework with Graph Convolution [0.16317061277456998]
  We introduce a real-time prediction framework (called ARRQP) with a specific emphasis on improving resilience to anomalies in the data. ARRQP integrates both contextual information and collaborative insights, enabling a comprehensive understanding of user-service interactions. Results on the benchmark WS-DREAM dataset demonstrate the framework's effectiveness in achieving accurate and timely predictions.
  arXiv  Detail & Related papers  (2023-09-22T04:37:51Z)
• $\clubsuit$ CLOVER $\clubsuit$: Probabilistic Forecasting with Coherent Learning Objective Reparameterization [42.215158938066054]
  We augment an MQForecaster neural network architecture with a modified multivariate Gaussian factor model that achieves coherence by construction.<n>We call our method the Coherent Learning Objective Reparametrization Neural Network (CLOVER)<n>In comparison to state-of-the-art coherent forecasting methods, CLOVER achieves significant improvements in scaled CRPS forecast accuracy, with average gains of 15%.
  arXiv  Detail & Related papers  (2023-07-19T07:31:37Z)
• A Unified One-Step Solution for Aspect Sentiment Quad Prediction [3.428123050377681]
  Aspect sentiment quad prediction (ASQP) is a challenging yet significant subtask in aspect-based sentiment analysis. We release two new datasets for ASQP, which contain the following characteristics: larger size, more words per sample, and higher density. We propose a unified one-step solution for ASQP, namely One-ASQP, to detect the aspect categories and to identify the aspect-opinion-sentiment triplets simultaneously.
  arXiv  Detail & Related papers  (2023-06-07T05:00:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.