mlsanityData to 7 Oct 2026

OnlineSTL: Scaling Time Series Decomposition by 100x

arXiv 2107.09110 ↗First posted 19 Jul 2021cs.LG cs.DBcited by 5

Not on the map. Why?

Abstract (arXiv)

Decomposing a complex time series into trend, seasonality, and remainder components is an important primitive that facilitates time series anomaly detection, change point detection, and forecasting. Although numerous batch algorithms are known for time series decomposition, none operate well in an online scalable setting where high throughput and real-time response are paramount. In this paper, we propose OnlineSTL, a novel online algorithm for time series decomposition which is highly scalable and is deployed for real-time metrics monitoring on high-resolution, high-ingest rate data. Experiments on different synthetic and real world time series datasets demonstrate that OnlineSTL achieves orders of magnitude speedups (100x) while maintaining quality of decomposition.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 3 of its 53 references that are in the map. First posted on arXiv 19 Jul 2021.

Builds on

3 of 53 references.

References · 3

  1. 2018RobustSTL: A Robust Seasonal-Trend Decomposition Algorithm for Long Time Seriescited by 54
  2. 2020STR: Seasonal-Trend Decomposition Using Regressioncited by 9
  3. 2017ASAP: Prioritizing Attention via Time Series Smoothingcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 1; 2026: 1.

5 papers.