CacheDiff: Fast Random Sampling
Data Structures and Algorithms
2015-12-03 v1
Authors:
Dai Nguyen Bui
Abstract
We present a sampling method called, CacheDiff, that has both time and space complexity of O(k) to randomly select k items from a pool of N items, in which N is known.
Cite
@article{arxiv.1512.00501,
title = {CacheDiff: Fast Random Sampling},
author = {Dai Nguyen Bui},
journal= {arXiv preprint arXiv:1512.00501},
year = {2015}
}
Related papers
View all related →
Machine Learning · Computer Science
On Fast Sampling of Diffusion Probabilistic Models
Zhifeng Kong, Wei Ping
2021-06-25
Data Structures and Algorithms · Computer Science
Sampling to estimate arbitrary subset sums
Nick Duffield, Carsten Lund, Mikkel Thorup
2007-05-23
Machine Learning · Computer Science
Efficient Sampling for k-Determinantal Point Processes
Chengtao Li, Stefanie Jegelka, Suvrit Sra
2016-05-31
Information Theory · Computer Science
$K$ Users Caching Two Files: An Improved Achievable Rate
Saeid Sahraei, Michael Gastpar
2015-12-22
Data Structures and Algorithms · Computer Science
Consistent Subset Sampling
Konstantin Kutzkov, Rasmus Pagh
2014-04-21
Machine Learning · Computer Science
Finite Sample Complexity Analysis of Binary Segmentation
Toby Dylan Hocking
2024-10-14
Machine Learning · Computer Science
A sampling-based approach for efficient clustering in large datasets
Georgios Exarchakis, Omar Oubari, Gregor Lenz
2022-03-30
Methodology · Statistics
Diversity Subsampling: Custom Subsamples from Large Data Sets
Boyang Shang, Daniel W. Apley, Sanjay Mehrotra
2023-11-27
Data Structures and Algorithms · Computer Science
Feasible Sampling of Non-strict Turnstile Data Streams
Neta Barkay, Ely Porat, Bar Shalem
2012-09-26
Data Structures and Algorithms · Computer Science
Systematic Alias Sampling: an efficient and low-variance way to sample from a discrete distribution
Ilari Vallivaara, Katja Poikselkä, Pauli Rikula, Juha Röning
2025-09-30
Statistics Theory · Mathematics
Random Sampling of Contingency Tables via Probabilistic Divide-and-Conquer
Stephen DeSalvo, James Y. Zhao
2016-03-01
Data Structures and Algorithms · Computer Science
Fast Pseudo-Random Fingerprints
Yoram Bachrach, Ely Porat
2010-09-30
Data Structures and Algorithms · Computer Science
Fair and Representative Subset Selection from Data Streams
Yanhao Wang, Francesco Fabbri, Michael Mathioudakis
2021-02-15
Data Structures and Algorithms · Computer Science
Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems
Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas
2017-06-27
Machine Learning · Computer Science
The Sample Complexity of Best-$k$ Items Selection from Pairwise Comparisons
Wenbo Ren, Jia Liu, Ness B. Shroff
2021-08-02
Data Structures and Algorithms · Computer Science
An asymptotically optimal, online algorithm for weighted random sampling with replacement
Michał Startek
2016-11-03
Data Structures and Algorithms · Computer Science
The Adaptive Sampling Revisited
Matthew Drescher, Guy Louchard, Yvik Swan
2019-05-17
Artificial Intelligence · Computer Science
LapSum -- One Method to Differentiate Them All: Ranking, Sorting and Top-k Selection
Łukasz Struski, Michał B. Bednarczyk, Igor T. Podolak, Jacek Tabor
2025-09-04
Data Structures and Algorithms · Computer Science
Dependency-Aware Online Caching
Julien Dallot, Amirmehdi Jafari Fesharaki, Maciej Pacut, Stefan Schmid
2024-01-31
Robotics · Computer Science
Enhancing Sampling-based Planning with a Library of Paths
Michal Minařík, Vojtěch Vonásek, Robert Pěnička
2026-01-09
Cryptography and Security · Computer Science
Faster Differentially Private Top-$k$ Selection: A Joint Exponential Mechanism with Pruning
Hao WU, Hanwen Zhang
2026-01-09
Data Structures and Algorithms · Computer Science
A New Rejection Sampling Approach to $k$-$\mathtt{means}$++ With Improved Trade-Offs
Poojan Shah, Shashwat Agrawal, Ragesh Jaiswal
2025-02-05
Machine Learning · Computer Science
OneBatchPAM: A Fast and Frugal K-Medoids Algorithm
Antoine de Mathelin, Nicolas Enrique Cecchi, François Deheeger, Mathilde Mougeot +1
2025-02-03
Quantum Physics · Physics
Quantum Speedup for Sampling Random Spanning Trees
Simon Apers, Minbo Gao, Zhengfeng Ji, Chenghua Liu
2025-04-25
Data Structures and Algorithms · Computer Science
Efficient Random Sampling -- Parallel, Vectorized, Cache-Efficient, and Online
Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade +1
2019-11-18