The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Boris Ryabko

TL;DR
The paper introduces the Imaginary Sliding Window, a novel data structure that mimics the sliding window's benefits in adaptive algorithms while significantly reducing memory requirements by removing a random element instead of the last.
Contribution
It proposes the Imaginary Sliding Window scheme, which preserves the adaptive and estimation advantages of traditional sliding windows with lower memory usage.
Findings
Reduces memory size compared to traditional sliding windows.
Maintains accurate source statistics estimation.
Enables adaptive coding with less storage requirement.
Abstract
The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics generate some word in some alphabet . For every moment , one stores the word ("window") where ,, is called "window length". In the theory of universal coding, the code of the depends on source ststistics estimated by the window, in the problem of predicting, each letter is predicted using information of the window, etc. After that the letter is included in the window on the right, while is removed from the window. It is the sliding window scheme. This scheme has two merits: it allows one i) to estimate the source statistics quite precisely and ii) to adapt the code in case of a change…
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
TopicsAlgorithms and Data Compression · Cellular Automata and Applications · Computability, Logic, AI Algorithms
