Skip to content

Author

Shahid Mumtaz

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Sep 2026

Stable Implicit Conditioning With Residual Statistics for Multivariate Time-Series Anomaly Detection in Industrial IoT Monitoring

Timely anomaly detection in Industrial Internet of Things (IIoT) monitoring requires robust modeling of noisy multivariate sensor streams. Although decomposition-derived residuals provide a potentially useful auxiliary view for multivariate time-series anomaly detection (MTSAD), they are not clean anomaly surrogates in unsupervised settings, as they also contain normal fluctuations, sensor noise, and decomposition artifacts. Therefore, the key challenge is not simply whether residual evidence is useful, but how it can be integrated stably without disturbing the backbone’s native anomaly discrimination process. To address this issue, we propose stable implicit conditioning (SIC), a lightweight and general framework for decomposition-aware unsupervised MTSAD. Instead of reusing residual evidence through explicit downstream intervention, SIC converts compact residual statistics into a bounded sample-dependent channelwise calibration signal for mild representation-level adaptation. When instantiated on the anomaly Transformer (AT), the resulting AT-SIC improves upon the reproduced backbone on four out of five public benchmarks. Additional analyses on decomposition choices, structured disturbances, boundary cases, and cross-backbone transfer show that SIC provides a more reliable evidence utilization path than several intuitive explicit reuse strategies, while introducing only negligible efficiency overhead. These results suggest that decomposition-derived residual evidence is better exploited implicitly than explicitly in this setting.

Guangxia Xu, Zhuo Ye, Xing Huang et al. · 0 citations
2026

DREAM: A Dynamic Ripple-Effect-Aware Meta-Scheduling Scheme for Cloud-Edge-End Collaborative AI Computing

Cloud-edge-end collaborative Artificial Intelligence (AI) computing requires schedulers that allocate heterogeneous resources for Directed Acyclic Graph (DAG)-structured workflows across network tiers. Cross-tier data transfers create ripple effects where a single placement decision propagates delays to downstream tasks, degrading end-to-end completion rates. This paper presents DREAM, a Dynamic Ripple-Effect-Aware Meta-scheduling scheme in which Critical Path Lookahead Scheduling (CPLS) performs bounded-depth trajectory planning with soft reservations for critical tasks, while Opportunity-Cost-Aware Placement (OCAP) evaluates non-critical tasks through a four-component cost covering immediate efficiency, ripple effect, load stability, and opportunity cost. Extensive simulations demonstrate that under the heavy load of 600 tasks, DREAM sustains a task completion rate of ~66%, exceeding classical heuristics by over 10 percentage points. At the extreme load of 1000 tasks, the system utility score improves by 47% over HEFT. Robustness experiments verify competitive performance across multiple DAG topologies and estimation-noise levels.

Chenlu Wang, Yuhuai Peng, Lei Liu et al. · 0 citations