Learning-Augmented Moment Estimation on Time-Decay Models
Not on the map. Why?
Abstract (arXiv)
Motivated by the prevalence and success of machine learning, a line of recent work has studied learning-augmented algorithms in the streaming model. These results have shown that for natural and practical oracles implemented with machine learning models, we can obtain streaming algorithms with improved space efficiency that are otherwise provably impossible. On the other hand, our understanding is much more limited when items are weighted unequally, for example, in the sliding-window model, where older data must be expunged from the dataset, e.g., by privacy regulation laws. In this paper, we utilize an oracle for the heavy-hitters of datasets to give learning-augmented algorithms for a number of fundamental problems, such as norm/moment estimation, frequency estimation, cascaded norms, and rectangular moment estimation, in the time-decay setting. We complement our theoretical results with a number of empirical evaluations that demonstrate the practical efficiency of our algorithms on real and synthetic datasets.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 30 of its 69 references that are in the map. First posted on arXiv 3 Mar 2026.
Builds on
30 of 69 references.
References · 30
- 2021TrafficStream: A Streaming Traffic Flow Forecasting Framework Based on Graph Neural Networks and Continual Learningcited by 42
- 2017Training Gaussian Mixture Models at Scale via Coresetscited by 38
- 2022Learning Augmented Binary Search Treescited by 31
- 2021Learning-Augmented k-means Clusteringcited by 26
- 2022Triangle and Four Cycle Counting with Predictions in Graph Streamscited by 20
- 2018Near Optimal Linear Algebra in the Online and Sliding Window Modelscited by 19
- 2020Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimatorscited by 16
- 2022Online Lewis Weight Samplingcited by 15
- 2022Learning-Augmented Algorithms for Online Linear and Semidefinite Programmingcited by 11
- 2024Learning-augmented Maximum Independent Setcited by 11
- 2024Learning-Augmented Streaming Algorithms for Approximating MAX-CUTcited by 8
- 2020Sliding Window Algorithms for k-Clustering Problemscited by 7
18 more
- 2025Learning-Augmented Hierarchical Clusteringcited by 6
- 2019Improved Algorithms for Time Decay Streamscited by 5
- 2021Truly Perfect Samplers for Data Streams and Sliding Windowscited by 5
- 2021Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketchescited by 5
- 2023Near-Optimal k-Clustering in the Sliding Window Modelcited by 4
- 2024Learning-Augmented Search Data Structurescited by 4
- 2025Fair Clustering in the Sliding Window Modelcited by 3
- 2026Online Learning with Limited Information in the Sliding Window Modelcited by 3
- 2018Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windowscited by 2
- 2021Symmetric Norm Estimation and Regression on Sliding Windowscited by 2
- 2023Differentially Private L2-Heavy Hitters in the Sliding Window Modelcited by 2
- 2024A New Information Complexity Measure for Multi-pass Streaming with Applicationscited by 2
- 2024Learning-Augmented Frequency Estimation in Sliding Windowscited by 2
- 2025Learning-Augmented Frequent Directionscited by 2
- 2018Revisiting Frequency Moment Estimation in Random Order Streamscited by 1
- 2018Distributed mining of time--faded heavy hitterscited by 1
- 2021Separations for Estimating Large Frequency Moments on Data Streamscited by 1
- 2021Frequency Estimation with One-Sided Errorcited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.