Designing Adaptive Algorithms Based on Reinforcement Learning for Dynamic Optimization of Sliding Window Size in Multi-Dimensional Data Streams
Abolfazl Zarghani, Sadegh Abedi

TL;DR
This paper introduces RL-Window, a reinforcement learning-based method that adaptively adjusts sliding window sizes in multi-dimensional data streams, improving accuracy and efficiency in real-time analytics.
Contribution
It presents a novel RL approach using a Dueling DQN to optimize window sizes dynamically, outperforming existing methods in various benchmark datasets.
Findings
RL-Window achieves higher classification accuracy.
It demonstrates improved robustness to concept drift.
The method is more computationally efficient.
Abstract
Multi-dimensional data streams, prevalent in applications like IoT, financial markets, and real-time analytics, pose significant challenges due to their high velocity, unbounded nature, and complex inter-dimensional dependencies. Sliding window techniques are critical for processing such streams, but fixed-size windows struggle to adapt to dynamic changes like concept drift or bursty patterns. This paper proposes a novel reinforcement learning (RL)-based approach to dynamically optimize sliding window sizes for multi-dimensional data streams. By formulating window size selection as an RL problem, we enable an agent to learn an adaptive policy based on stream characteristics, such as variance, correlations, and temporal trends. Our method, RL-Window, leverages a Dueling Deep Q-Network (DQN) with prioritized experience replay to handle non-stationarity and high-dimensionality. Evaluations…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Stream Mining Techniques · Time Series Analysis and Forecasting · Stock Market Forecasting Methods
