arXiv subjects

Wenzhuo Qian

Publications and source records attributed to Wenzhuo Qian.

7 recordsLinked to original sources

arXiv2026

Learning Intrinsic Water-Quality Dynamics with Rainfall for Data-Driven Forecasting

Rainfall is an important environmental driver of water-quality variations through processes such as runoff, pollutant transport, dilution, and resuspension. Traditional mechanistic models can explicitly describe these processes but often require substantial process specification and site-specific calibration, limiting their flexibility under changing hydrological conditions. In this work, we explore a data-driven alternative by proposing RaiNet to jointly model multiscale water-quality dynamics and station-specific rainfall effects across relative lags and temporal scales. RaiNet employs LocTrend to capture irregular water-quality dynamics, constructs station-oriented rainfall events from gridded precipitation, and introduces XGateFusion for conditional lag-aware fusion across scales. We further release three real-world multimodal datasets comprising over 150,000 temporally aligned water quality observations and gridded precipitation raster images. Experiments show that RaiNet outperforms general time-series, water quality, diffusion-based, and spatiotemporal models by over 20%, while component-wise analyses confirm the distinct contribution of each module.

cs.LG↗

arXiv2026

ARMOR: A Robust Self-Supervised Framework for Root Cause Analysis in Microservices under Missing Modality

Automated incident management is critical for microservice reliability. While recent unified frameworks leverage multimodal data for joint optimization, they unrealistically assume perfect data completeness. In practice, network fluctuations and agent failures frequently cause missing modalities. Existing approaches relying on static placeholders introduce imputation noise that masks anomalies and degrades performance. To address this, we propose ARMOR, a robust self-supervised framework designed for missing modality scenarios. ARMOR features: (i) a modality-specific asymmetric encoder that isolates distribution disparities among metrics, logs, and traces; and (ii) a missing-aware gated fusion mechanism utilizing learnable placeholders and dynamic bias compensation to prevent cross-modal interference from incomplete inputs. By employing self-supervised auto-regression with mask-guided reconstruction, ARMOR jointly optimizes anomaly detection (AD), failure triage (FT), and root cause localization (RCL). AD and RCL require no fault labels, while FT relies solely on failure-type annotations for the downstream classifier. Extensive experiments demonstrate that ARMOR achieves state-of-the-art performance under complete data conditions and maintains robust diagnostic accuracy even with severe modality loss.

cs.LG↗

arXiv2026

Agentic Services Computing

Services computing has evolved from Web services and microservices to cloud-native and serverless paradigms. These approaches established mature principles for describing, composing, deploying, operating, and governing reusable software functions. LLM-based agents now introduce a fundamentally different service form. Service value in this paradigm emerges not only from invoking predefined functions but also from delegating goals to autonomous entities. These entities understand context, use tools, collaborate with peers, and act across open environments. This shift raises a core question for services computing. How can goal-driven, stateful, tool-mediated, and accountable autonomous behavior be engineered and managed as a service? Recent studies on LLM agents and multi-agent systems provide important foundations. A clear service-centered research roadmap for this emerging paradigm nevertheless remains absent. This work introduces Agentic Services Computing (ASC) to address this gap. ASC extends services computing from managing reusable functional endpoints to engineering and governing autonomous service entities. It defines agentic services as service-oriented autonomous agents. Related research is organized through a lifecycle view that connects service objects, system structures, enabling infrastructure, evaluation metrics, application evidence, and open challenges. This service-centered perspective establishes a foundation for future service ecosystems. Autonomous agents can thus be systematically described, composed, delivered, monitored, audited, and evolved as first-class services.

cs.SE↗

arXiv2026

When Does Hierarchy Help? Benchmarking Agent Coordination in Event-Driven Industrial Scheduling

Recent advances in agent and multi-agent systems have shown strong performance on tool use, reasoning, and collaborative tasks. However, existing benchmarks mostly evaluate task completion in weakly coupled environments, and provide limited support for studying coordination in shared, dynamically evolving systems with hierarchy and coupled constraints. This leaves an important question underexplored: when do different coordination paradigms succeed or fail? We introduce Distributed Event-driven Scheduling Benchmark (DESBench), a benchmark for evaluating agent coordination in hierarchical event-driven scheduling. Built on a shared discrete-event driven environment in industrial scheduling, our benchmark captures multi-timescale decision making, partial observability, and dynamically coupled constraints. We define tasks and metrics that evaluate effectiveness, constraint alignment, coordination efficiency, and robustness, and focus on four representative coordination paradigms: centralized, hierarchical, heterarchical, and holonic. These paradigms correspond to distinct mechanisms of information flow, decision authority, and conflict resolution. Our controlled evaluations reveal clear coordination trade-offs: centralized coordination is robust and communication-efficient but scales poorly with difficulty; hierarchical coordination improves efficiency through decomposition but suffers from cross-level misalignment; heterarchical coordination is flexible but communication-heavy; and holonic coordination satisfies constraints well but loses global robustness. These findings demonstrate that coordination design fundamentally shapes agent system behavior in complex environments, revealing structural trade-offs that cannot be captured by outcome metrics alone and underscoring the imperative for more adaptive, principled, and dynamic coordination mechanisms in future MAS research.

cs.MA↗

arXiv2026

Reliable Microservice Tail Latency Prediction via Decoupled Dual-Stream Learning and Gradient Modulation

Microservice architectures enable scalable cloud-native applications; however, the distributed nature of these systems complicates the maintenance of strict Service Level Objectives. Accurately predicting window-level P95 tail latency remains difficult due to the complex interactions between software workload propagation and infrastructure resource limits. Existing predictive models struggle to capture these dynamics because the lack of explicit separation between traffic metrics and resource metrics causes misaligned feature representations. Building on this suboptimal data treatment, the unified architectures of prior approaches fail to isolate cascading service dependencies from localized processing capacity. Due to this entanglement, joint training suffers from an optimization imbalance wherein resource features converge faster and dominate gradient updates, thereby preventing the learning of underlying software topologies. To address these challenges, we propose USRFNet, a dual-stream framework that separates the modeling of demand and capacity. The proposed framework utilizes a Graph Neural Network to model the spatial interactions of traffic workloads across software-level service dependencies, and a gating MLP to independently extract infrastructure-level resource dynamics. The model then integrates these representations through hierarchical tensor fusion. To resolve the training imbalance, we introduce a Reliability-Aware Gradient Modulation strategy that dynamically rescales gradients based on the generalization ratio of each data stream. Experiments on three large-scale real-world benchmarks demonstrate that USRFNet outperforms state-of-the-art methods in prediction accuracy. Specifically, compared to the best-performing baselines, the proposed framework achieves relative MAPE reductions ranging from 15.62% to 26.11% across the evaluated datasets.

cs.LG↗

arXiv2025

PeerSync: Accelerating Containerized Service Delivery at the Network Edge

Efficient container image distribution is crucial for enabling machine learning inference at the network edge, where resource limitations and dynamic network conditions create significant challenges. In this paper, we present PeerSync, a decentralized P2P-based system designed to optimize image distribution in edge environments. PeerSync employs a popularity- and network-aware download engine that dynamically adapts to content popularity and real-time network conditions. PeerSync further integrates automated tracker election for rapid peer discovery and dynamic cache management for efficient storage utilization. We implement PeerSync with 8000+ lines of Rust code and test its performance extensively on both large-scale Docker-based emulations and physical edge devices. Experimental results show that PeerSync delivers a remarkable speed increase of 2.72$\times$, 1.79$\times$, and 1.28$\times$ compared to the Baseline solution, Dragonfly, and Kraken, respectively, while significantly reducing cross-network traffic by 90.72% under congested and varying network conditions.

cs.NI↗

arXiv2024

Decentralized Proactive Model Offloading and Resource Allocation for Split and Federated Learning

In the resource-constrained IoT-edge computing environment, Split Federated (SplitFed) learning is implemented to enhance training efficiency. This method involves each terminal device dividing its full DNN model at a designated layer into a device-side model and a server-side model, then offloading the latter to the edge server. However, existing research overlooks four critical issues as follows: (1) the heterogeneity of end devices' resource capacities and the sizes of their local data samples impact training efficiency; (2) the influence of the edge server's computation and network resource allocation on training efficiency; (3) the data leakage risk associated with the offloaded server-side sub-model; (4) the privacy drawbacks of current centralized algorithms. Consequently, proactively identifying the optimal cut layer and server resource requirements for each end device to minimize training latency while adhering to data leakage risk rate constraint remains a challenging issue. To address these problems, this paper first formulates the latency and data leakage risk of training DNN models using Split Federated learning. Next, we frame the Split Federated learning problem as a mixed-integer nonlinear programming challenge. To tackle this, we propose a decentralized Proactive Model Offloading and Resource Allocation (DP-MORA) scheme, empowering each end device to determine its cut layer and resource requirements based on its local multidimensional training configuration, without knowledge of other devices' configurations. Extensive experiments on two real-world datasets demonstrate that the DP-MORA scheme effectively reduces DNN model training latency, enhances training efficiency, and complies with data leakage risk constraints compared to several baseline algorithms across various experimental settings.

cs.DC↗