Disjoint or Overlapping? Inference Windowing for Reconstruction-Based Time Series Anomaly Detection
- URL: http://arxiv.org/abs/2606.09874v1
- Date: Tue, 02 Jun 2026 19:42:30 GMT
- Title: Disjoint or Overlapping? Inference Windowing for Reconstruction-Based Time Series Anomaly Detection
- Abstract summary: We study the role of the inference stride, which controls whether subsequences are processed as disjoint windows or with overlap.<n>We propose a unified training, tuning, and multi-seed evaluation protocol on the curated TSB-AD benchmark.<n>We show that overlapping windows yield consistent improvements, with average relative gain up to +28%, and can alter method rankings.
- Score: 1.5439079597766574
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Reconstruction-based methods are widely used for time series anomaly detection, where models are trained to reconstruct subsequences, and anomalies are identified through reconstruction errors. However, reported results are often hard to compare due to heterogeneous evaluation practices and underspecified inference procedures. In this paper, we revisit reconstruction-based anomaly detection in the univariate offline setting and study the role of the inference stride, which controls whether subsequences are processed as disjoint windows or with overlap. We propose a unified training, tuning, and multi-seed evaluation protocol on the curated TSB-AD benchmark, and study how overlapping inference affects anomaly detection performance for a range of reconstruction models, including PCA-based baselines, DLinear, an AutoEncoder, TimesNet, and Transformer variants. The results show that across all models, overlapping windows yield consistent improvements, with average relative gain up to +28%, and can alter method rankings. We further analyze variability across datasets, random seeds, and hyperparameter configurations. Finally, we complement the benchmark study with an evaluation on the full UCR archive using localization criteria aligned with sliding-window reconstruction. Overall, our results highlight that reconstruction-based anomaly detection performance depends not only on model architecture and training, but also on inference choices, motivating a clear and reproducible protocol. Our results show that reconstructionbased baselines achieve strong performance on both TSB-AD and UCR benchmarks, supporting them as competitive and practical approaches for univariate time series anomaly detection.
Related papers
- A comprehensive and trustworthy benchmark of AI methods for change detection in Earth observation [6.608286365425497]
Change detection in Earth observation is critical for monitoring land surface transformations.<n>We present a standardized, open-source benchmark for evaluating state-of-the-art (SOTA) deep learning methods for change detection.
arXiv Detail & Related papers (2026-08-28T12:04:39Z) - OOD-RL-Bench: A Benchmark Framework for Out-of-Distribution Detection in Reinforcement Learning [4.173831365316023]
We present OOD-RL-Bench, a framework designed to evaluate OOD detectors against categories of anomalies injected into trajectories.<n> Detectors and anomaly injectors are integrated through shared interfaces and configuration.<n>We assess the performance of each detector across a suite of anomaly types using matched-time AUROC, matched-time AUPRC, matched-time false-positive rate, detection delay, and segmented-onset metrics.
arXiv Detail & Related papers (2026-07-14T08:57:04Z) - Adaptive Recurrent Message Passing for Test Time Computing on Graphs [80.56829418752513]
We show that recurrent graph models can overcome the intrinsic mismatch between graph data and architectural designs.<n>We propose AdaR, an Adaptive Recurrent graph model, empowering flexible test-time computing on various downstream tasks without changing model parameters.
arXiv Detail & Related papers (2026-06-21T12:14:11Z) - An Improved Time Series Anomaly Detection by Applying Structural Similarity [17.056935729423667]
We propose StrAD, a novel structure-enhanced anomaly detection approach.<n>We show that StrAD improves the performance of state-of-the-art reconstruction-based models across five real-world anomaly detection datasets.
arXiv Detail & Related papers (2025-09-24T14:45:00Z) - Chain-of-Retrieval Augmented Generation [91.02950964802454]
This paper introduces an approach for training o1-like RAG models that retrieve and reason over relevant information step by step before generating the final answer.<n>Our proposed method, CoRAG, allows the model to dynamically reformulate the query based on the evolving state.
arXiv Detail & Related papers (2025-01-24T09:12:52Z) - Amortized Posterior Sampling with Diffusion Prior Distillation [55.03585818289934]
Amortized Posterior Sampling is a novel variational inference approach for efficient posterior sampling in inverse problems.<n>Our method trains a conditional flow model to minimize the divergence between the variational distribution and the posterior distribution implicitly defined by the diffusion model.<n>Unlike existing methods, our approach is unsupervised, requires no paired training data, and is applicable to both Euclidean and non-Euclidean domains.
arXiv Detail & Related papers (2024-07-25T09:53:12Z) - RESTAD: REconstruction and Similarity based Transformer for time series Anomaly Detection [3.0377067713090633]
Anomaly detection in time series data is crucial across various domains.
We introduce RESTAD, an adaptation of the Transformer model by incorporating a layer of Radial Basis Function (RBF) neurons within its architecture.
arXiv Detail & Related papers (2024-05-13T07:10:35Z) - REBAR: Retrieval-Based Reconstruction for Time-series Contrastive Learning [64.08293076551601]
We propose a novel method of using a learned measure for identifying positive pairs.
Our Retrieval-Based Reconstruction measure measures the similarity between two sequences.
We show that the REBAR error is a predictor of mutual class membership.
arXiv Detail & Related papers (2023-11-01T13:44:45Z) - Spot The Odd One Out: Regularized Complete Cycle Consistent Anomaly Detector GAN [4.5123329001179275]
This study presents an adversarial method for anomaly detection in real-world applications, leveraging the power of generative adversarial neural networks (GANs)
Previous methods suffer from the high variance between class-wise accuracy which leads to not being applicable for all types of anomalies.
The proposed method named RCALAD tries to solve this problem by introducing a novel discriminator to the structure, which results in a more efficient training process.
arXiv Detail & Related papers (2023-04-16T13:05:39Z) - GEC: A Unified Framework for Interactive Decision Making in MDP, POMDP,
and Beyond [101.5329678997916]
We study sample efficient reinforcement learning (RL) under the general framework of interactive decision making.
We propose a novel complexity measure, generalized eluder coefficient (GEC), which characterizes the fundamental tradeoff between exploration and exploitation.
We show that RL problems with low GEC form a remarkably rich class, which subsumes low Bellman eluder dimension problems, bilinear class, low witness rank problems, PO-bilinear class, and generalized regular PSR.
arXiv Detail & Related papers (2022-11-03T16:42:40Z) - Unsupervised Anomaly Detection with Adversarial Mirrored AutoEncoders [51.691585766702744]
We propose a variant of Adversarial Autoencoder which uses a mirrored Wasserstein loss in the discriminator to enforce better semantic-level reconstruction.
We put forward an alternative measure of anomaly score to replace the reconstruction-based metric.
Our method outperforms the current state-of-the-art methods for anomaly detection on several OOD detection benchmarks.
arXiv Detail & Related papers (2020-03-24T08:26:58Z)
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.