Cover Image

Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shahout, Rana, Mitzenmacher, Michael
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning-Augmented Frequency Estimation in Sliding Windows
by: Shahout, Rana, et al.
Published: (2024)

Queueing, Predictions, and LLMs: Challenges and Open Problems
by: Mitzenmacher, Michael, et al.
Published: (2025)

Lumberjack: Better Differentially Private Random Forests through Heavy Hitter Detection in Trees
by: Lebeda, Christian Janos, et al.
Published: (2026)

Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models
by: Huang, Zengfeng, et al.
Published: (2025)

Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
by: Feng, Shiyuan, et al.
Published: (2025)

Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
by: Woodruff, David P., et al.
Published: (2024)

LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions
by: Kannan, Ravindran, et al.
Published: (2024)

Learning-Augmented Streaming Algorithms for Correlation Clustering
by: Dong, Yinhao, et al.
Published: (2025)

The Power of Iterative Filtering for Supervised Learning with (Heavy) Contamination
by: Klivans, Adam R., et al.
Published: (2025)

ResidualSketch: Enhancing Layer Efficiency and Error Reduction in Hierarchical Heavy Hitter Detection with ResNet Innovations
by: Liu, Xilai, et al.
Published: (2025)

Spectral Guarantees for Adversarial Streaming PCA
by: Price, Eric, et al.
Published: (2024)

Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up
by: Kuszmaul, William, et al.
Published: (2025)

Learning-Augmented Moment Estimation on Time-Decay Models
by: Nagawanshi, Soham, et al.
Published: (2026)

Fast and Accurate Triangle Counting in Graph Streams Using Predictions
by: Boldrin, Cristian, et al.
Published: (2024)

Fast White-Box Adversarial Streaming Without a Random Oracle
by: Feng, Ying, et al.
Published: (2024)

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
by: He, Yuchen, et al.
Published: (2024)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
by: Karpov, Nikolai, et al.
Published: (2025)

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
by: Axiotis, Kyriakos, et al.
Published: (2024)

Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
by: Ye, Zichun, et al.
Published: (2025)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
by: Assadi, Sepehr, et al.
Published: (2023)

Minimum-Cost Network Flow with Dual Predictions
by: Chen, Zhiyang, et al.
Published: (2026)

On Purely Private Covariance Estimation
by: d'Orsi, Tommaso, et al.
Published: (2025)

Improved Accuracy for Private Continual Cardinality Estimation in Fully Dynamic Streams via Matrix Factorization
by: Andersson, Joel Daniel, et al.
Published: (2026)

Optimal and Near-Optimal Adaptive Vector Quantization
by: Ben-Basat, Ran, et al.
Published: (2024)

Exact Learning of Weighted Graphs Using Composite Queries
by: Goodrich, Michael T., et al.
Published: (2025)

Streaming Attention Approximation via Discrepancy Theory
by: Kochetkova, Ekaterina, et al.
Published: (2025)

Statistical-Computational Trade-offs for Density Estimation
by: Aamand, Anders, et al.
Published: (2024)

High-Accuracy List-Decodable Mean Estimation
by: Chen, Ziyun, et al.
Published: (2025)

Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
by: Jin, Yujia, et al.
Published: (2024)

Dynamic Similarity Graph Construction with Kernel Density Estimation
by: Laenen, Steinar, et al.
Published: (2025)

Differentially Private and Scalable Estimation of the Network Principal Component
by: Khayatian, Alireza, et al.
Published: (2025)

Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
by: Li, Yi, et al.
Published: (2024)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
by: Danait, Ved, et al.
Published: (2025)

Graph Neural Network-Informed Predictive Flows for Faster Ford-Fulkerson and PAC-Learnability
by: Wiesler, Eleanor, et al.
Published: (2026)

Quantizing With Randomized Hadamard Transforms: Efficient Heuristic Now Proven
by: Ben-Basat, Ran, et al.
Published: (2026)

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
by: Chen, Hongjie, et al.
Published: (2024)

Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares
by: Chen, Hongjie, et al.
Published: (2024)

Optimal Variance and Covariance Estimation under Differential Privacy in the Add-Remove Model and Beyond
by: Takakura, Shokichi, et al.
Published: (2025)

Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
by: Chen, Hongjie, et al.
Published: (2025)

Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch
by: Lebeda, Christian Janos, et al.
Published: (2023)