CLEANet: Robust and Efficient Anomaly Detection in Contaminated Multivariate Time Series

• URL: http://arxiv.org/abs/2510.22619v1
• Date: Sun, 26 Oct 2025 10:34:19 GMT
• Title: CLEANet: Robust and Efficient Anomaly Detection in Contaminated Multivariate Time Series
• Abstract summary: CLEANet is a robust and efficient anomaly detection framework in contaminated time series.<n>Cleanet introduces a Contamination-Resilient Training Framework (CRTF)<n>Cleanet mitigates higher F1 and 81.28% lower runtime compared with ten state-of-the-art baselines.
• Score: 17.992163690121565
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multivariate time series (MTS) anomaly detection is essential for maintaining the reliability of industrial systems, yet real-world deployment is hindered by two critical challenges: training data contamination (noises and hidden anomalies) and inefficient model inference. Existing unsupervised methods assume clean training data, but contamination distorts learned patterns and degrades detection accuracy. Meanwhile, complex deep models often overfit to contamination and suffer from high latency, limiting practical use. To address these challenges, we propose CLEANet, a robust and efficient anomaly detection framework in contaminated multivariate time series. CLEANet introduces a Contamination-Resilient Training Framework (CRTF) that mitigates the impact of corrupted samples through an adaptive reconstruction weighting strategy combined with clustering-guided contrastive learning, thereby enhancing robustness. To further avoid overfitting on contaminated data and improve computational efficiency, we design a lightweight conjugate MLP that disentangles temporal and cross-feature dependencies. Across five public datasets, CLEANet achieves up to 73.04% higher F1 and 81.28% lower runtime compared with ten state-of-the-art baselines. Furthermore, integrating CRTF into three advanced models yields an average 5.35% F1 gain, confirming its strong generalizability.

Related papers

• Data Scarcity and Model Sparsity: Mixtures-of-Experts Overfit More to Repeated Data [119.14301046837822]
  We show that Mixture-of-Experts (MoEs) degrade more rapidly under data repetition.<n>MoEs can outperform dense models even when data is repeated more than 64 times.<n>We analyze internal mechanisms correlated with MoE overfitting in high repetition regimes.
  arXiv  Detail & Related papers  (2026-09-10T17:57:33Z)
• Detecting the Undetectable: Enhancing Unsupervised time series Anomaly Detection via Active Learning [9.53248032827498]
  In large-scale industrial applications, labeling time series data is often prohibitively expensive and time-consuming.<n>We propose a novel framework that leverages active learning to iteratively enhance the performance of unsupervised models.<n>Our framework's core contributions are (1) a masked time-series reconstruction feedback strategy that forces the model to learn robust temporal dependencies, and (2) a minimax learning strategy that promotes robustness by differentially treating normal and abnormal samples.
  arXiv  Detail & Related papers  (2026-07-01T10:08:49Z)
• TimeLAVA: Learning-Agnostic Data Valuation for Time Series [48.76711740818533]
  TimeLAVA is a learning-agnostic framework that values temporal segments by their marginal contribution to minimize distributional discrepancy between evaluated and reference data.<n>We provide theoretical guarantees linking valuation to model-agnostic generalization and prove bounded sensitivity to contamination.
  arXiv  Detail & Related papers  (2026-06-17T06:16:16Z)
• TS-Fault: Benchmarking Time Series Forecasters Against Structural Faults [22.88447833683736]
  Time series forecasting (TSF) underpins consequential decisions in energy, transportation, finance, and healthcare.<n>TSF models are almost universally ranked by a single number on clean held-out data, under the implicit assumption that it predicts deployed reliability.<n>We present TS-Fault, a benchmark that evaluates forecasting models under explicit, parameterized fault scenarios with controllable semantic difficulty.
  arXiv  Detail & Related papers  (2026-06-16T23:15:20Z)
• TRACER: A Semantic-Aware Framework for Fine-Grained Contamination Detection in Code LLMs [5.739404573725206]
  We present TRACER, a semantic-aware framework for fine-grained code contamination detection.<n> TRACER models contamination using three levels of semantic overlap - Functionally Identical, Nearly Identical, and Shared Logic.<n>We also introduce the first benchmark for fine-grained code contamination detection, spanning three widely used benchmarks and three representative post-training datasets.
  arXiv  Detail & Related papers  (2026-05-22T17:30:20Z)
• A Deformable Attention-Based Detection Transformer with Cross-Scale Feature Fusion for Industrial Coil Spring Inspection [0.6159133786557902]
  This paper proposes MSD-DETR (Multi-Scale Deformable Detection Transformer), a novel detection framework.<n>Experiments on a real-world locomotive coil spring dataset demonstrate that MSD-DETR achieves 92.4% mAP@0.5 at 98 FPS.
  arXiv  Detail & Related papers  (2026-03-13T03:35:15Z)
• Semi-supervised and unsupervised learning for health indicator extraction from guided waves in aerospace composite structures [0.6922116595976161]
  Health indicators (HIs) are central to diagnosing and prognosing the condition of aerospace composite structures.<n>This study presents a data-driven framework that learns HIs via two learning approaches integrated with multi-domain signal processing.
  arXiv  Detail & Related papers  (2025-10-28T16:44:11Z)
• Localized Kernel Projection Outlyingness: A Two-Stage Approach for Multi-Modal Outlier Detection [0.0]
  Two-Stage LKPLO is a novel multi-stage outlier detection framework.<n>It overcomes the coexisting limitations of conventional projection-based methods.<n>It achieves state-of-the-art performance on challenging datasets.
  arXiv  Detail & Related papers  (2025-10-28T03:53:46Z)
• Scalable, Explainable and Provably Robust Anomaly Detection with One-Step Flow Matching [14.503330877000758]
  Time-Conditioned Contraction Matching is a novel method for semi-supervised anomaly detection in tabular data.<n>It is inspired by flow matching, a recent generative modeling framework that learns velocity fields between probability distributions.<n>Extensive experiments on the ADBench benchmark show that TCCM strikes a favorable balance between detection accuracy and inference cost.
  arXiv  Detail & Related papers  (2025-10-21T06:26:38Z)
• Revisiting Multivariate Time Series Forecasting with Missing Values [65.30332997607141]
  Missing values are common in real-world time series.<n>Current approaches have developed an imputation-then-prediction framework that uses imputation modules to fill in missing values, followed by forecasting on the imputed data.<n>This framework overlooks a critical issue: there is no ground truth for the missing values, making the imputation process susceptible to errors that can degrade prediction accuracy.<n>We introduce Consistency-Regularized Information Bottleneck (CRIB), a novel framework built on the Information Bottleneck principle.
  arXiv  Detail & Related papers  (2025-09-27T20:57:48Z)
• Backdoor Cleaning without External Guidance in MLLM Fine-tuning [76.82121084745785]
  Believe Your Eyes (BYE) is a data filtering framework that leverages attention entropy patterns as self-supervised signals to identify and filter backdoor samples.<n>It achieves near-zero attack success rates while maintaining clean-task performance.
  arXiv  Detail & Related papers  (2025-05-22T17:11:58Z)
• AdvKT: An Adversarial Multi-Step Training Framework for Knowledge Tracing [64.79967583649407]
  Knowledge Tracing (KT) monitors students' knowledge states and simulates their responses to question sequences.<n>Existing KT models typically follow a single-step training paradigm, which leads to significant error accumulation.<n>We propose a novel Adversarial Multi-Step Training Framework for Knowledge Tracing (AdvKT) which focuses on the multi-step KT task.
  arXiv  Detail & Related papers  (2025-04-07T03:31:57Z)
• Adversarial Purification by Consistency-aware Latent Space Optimization on Data Manifolds [48.37843602248313]
  Deep neural networks (DNNs) are vulnerable to adversarial samples crafted by adding imperceptible perturbations to clean data, potentially leading to incorrect and dangerous predictions.<n>We propose Consistency Model-based Adversarial Purification (CMAP), which optimize vectors within the latent space of a pre-trained consistency model to generate samples for restoring clean data.<n>CMAP significantly enhances robustness against strong adversarial attacks while preserving high natural accuracy.
  arXiv  Detail & Related papers  (2024-12-11T14:14:02Z)
• Both Text and Images Leaked! A Systematic Analysis of Data Contamination in Multimodal LLM [53.05486269607166]
  multimodal large language models (MLLMs) have significantly enhanced performance across benchmarks.<n>Existing detection methods for unimodal large language models (LLMs) are inadequate for MLLMs due to multimodal data complexity and multi-phase training.<n>We analyze multimodal data contamination using our analytical framework, MM-Detect, which defines two contamination categories-unimodal and cross-modal.
  arXiv  Detail & Related papers  (2024-11-06T10:44:15Z)
• Angel or Devil: Discriminating Hard Samples and Anomaly Contaminations for Unsupervised Time Series Anomaly Detection [4.767887707515356]
  Training in unsupervised time series anomaly detection is constantly plagued by the discrimination between harmful anomaly contaminations' and beneficial hard normal samples'
  arXiv  Detail & Related papers  (2024-10-26T13:59:23Z)
• HCL-MTSAD: Hierarchical Contrastive Consistency Learning for Accurate Detection of Industrial Multivariate Time Series Anomalies [4.806959791183183]
  We propose a novel self-supervised hierarchical contrastive consistency learning method for detecting anomalies in industrial MTS. By developing a multi-layer contrastive loss, HCL-MTSAD can extensively mine data consistency and timestamp-temporal association. Experiments conducted on six diverse MTS retrieved from real cyber-physical systems and server machines, indicate that HCL-MTSAD's anomaly detection capability outperforms the state-of-the-art benchmark models by an average of 1.8% in terms of F1 score.
  arXiv  Detail & Related papers  (2024-04-12T03:39:33Z)
• Deep Ensembles Meets Quantile Regression: Uncertainty-aware Imputation for Time Series [45.76310830281876]
  We propose Quantile Sub-Ensembles, a novel method to estimate uncertainty with ensemble of quantile-regression-based task networks. Our method not only produces accurate imputations that is robust to high missing rates, but also is computationally efficient due to the fast training of its non-generative model.
  arXiv  Detail & Related papers  (2023-12-03T05:52:30Z)
• Towards Robust Recommender Systems via Triple Cooperative Defense [63.64651805384898]
  Recommender systems are often susceptible to well-crafted fake profiles, leading to biased recommendations. We propose a general framework, Triple Cooperative Defense, which cooperates to improve model robustness through the co-training of three models. Results show that the robustness improvement of TCD significantly outperforms baselines.
  arXiv  Detail & Related papers  (2022-10-25T04:45:43Z)

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.