Metraipolis › archive › dc_9ccd55607cf3
Fast Construction of Learned Count-Min Sketch via Ternary Search — arXiv:2608.08615
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.08615
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:16:43.074Z
- SHA-256 of the archived text
4b791f973b043760907c4682950e7cff3643b7e0bfcd691498c2870ba0b49845- Stable URL of this page
https://metraipolis.com/documento/dc_9ccd55607cf3
How to cite
Fast Construction of Learned Count-Min Sketch via Ternary Search — arXiv:2608.08615 — arXiv (en), https://arxiv.org/abs/2608.08615 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9ccd55607cf3 (Metraipolis archive dc_9ccd55607cf3, sha256 4b791f973b043760907c4682950e7cff3643b7e0bfcd691498c2870ba0b49845)
BibTeX
@misc{dc9ccd55607cf3,
title = {Fast Construction of Learned Count-Min Sketch via Ternary Search — arXiv:2608.08615},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.08615},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9ccd55607cf3; sha256 4b791f973b043760907c4682950e7cff3643b7e0bfcd691498c2870ba0b49845},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08615. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Learned Count-Min Sketch (LCMS) is a learned data structure that estimates element frequencies in a multiset and has been experimentally shown to outperform classical data structures in the capacity-accuracy trade-off. However, its performance depends heavily on parameter selection. Because systematic optimization has not been adequately discussed, previous approaches relied on inefficient brute-force methods. In this study, we propose a method to rapidly optimize the parameters of the original LCMS. We experimentally confirmed that when the machine learning model performs well enough, using a single hash function is sufficient to optimize the weighted error metric. Based on this, we introduce a ternary search approach to efficiently find the optimal proportion of Unique Buckets. Our method achieves the same performance as brute-force approaches while speeding up parameter optimization by $216$-$729$ times when the machine learning model's performance is sufficient. Furthermore, even when the model's performance is suboptimal, our approach still determines appropriate parameters $221$-$740$ times faster than the brute-force approach. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in cs.DS). Categorie arXiv: Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2608.08615 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T09:13:57.841Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).