mlsanityData to 14 Oct 2026

Lego Sketch: A Scalable Memory-augmented Neural Network for Sketching Data Streams

arXiv 2505.19561 ↗First posted 26 May 2025cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Sketches, probabilistic structures for estimating item frequencies in infinite data streams with limited space, are widely used across various domains. Recent studies have shifted the focus from handcrafted sketches to neural sketches, leveraging memory-augmented neural networks (MANNs) to enhance the streaming compression capabilities and achieve better space-accuracy trade-offs.However, existing neural sketches struggle to scale across different data domains and space budgets due to inflexible MANN configurations. In this paper, we introduce a scalable MANN architecture that brings to life the it Lego sketch, a novel sketch with superior scalability and accuracy. Much like assembling creations with modular Lego bricks, the Lego sketch dynamically coordinates multiple memory bricks to adapt to various space budgets and diverse data domains. Our theoretical analysis guarantees its high scalability and provides the first error bound for neural sketch. Furthermore, extensive experimental evaluations demonstrate that the Lego sketch exhibits superior space-accuracy trade-offs, outperforming existing handcrafted and neural sketches. Our code is available at https://github.com/FFY0/LegoSketchICML.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 15 of its 56 references that are in the map. First posted on arXiv 26 May 2025.

Builds on

15 of 56 references.

References · 15

  1. 2016Matching Networks for One Shot Learningcited by 2,255
  2. 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
  3. 2020Meta-Learning in Neural Networks: A Surveycited by 950
  4. 2014Neural Turing Machinescited by 644
  5. 2014Memory Networkscited by 363
  6. 2019Communication-efficient distributed SGD with Sketchingcited by 81
  7. 2017Hash Embeddings for Efficient Word Representationscited by 55
  8. 2016Associative Long Short-Term Memorycited by 37
  9. 2019Compressing Gradient Optimizers via Count-Sketchescited by 17
  10. 2023Experimental Analysis of Large-scale Learnable Vector Storage Compressioncited by 12
  11. 2019Meta-Learning Neural Bloom Filterscited by 10
  12. 2023Improved Frequency Estimation Algorithms with and without Predictionscited by 10
3 more
  1. 2013Scaling Graph-based Semi Supervised Learning to Large Number of Labels Using Count-Min Sketchcited by 6
  2. 2018Count-Min: Optimal Estimation and Tight Error Bounds using Empirical Error Distributionscited by 5
  3. 2024Learning-Based Heavy Hitters and Flow Frequency Estimation in Streamscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.