Journal ArticleDOI
An Efficient Method for Generating Discrete Random Variables with General Distributions
Reads0
Chats0
TLDR
The fast generation of discrete random variables with arbitrary frequency distributions is discussed, related to rejection techniques but differs from them in that all samples comprising the input data contribute to the samples in the target distribution.Abstract:
The fast generation of discrete random variables with arbitrary frequency distributions is discussed. The proposed method is related to rejection techniques but differs from them in that all samples comprising the input data contribute to the samples in the target distribution. The software implementation of the method requires at most two memory references and a comparison. The method features good accuracy and modest storage requirements. I t is particularly useful in small computers with limited memory capacity.read more
Citations
More filters
Proceedings ArticleDOI
Random Walks on Huge Graphs at Cache Efficiency
TL;DR: FlashMob as mentioned in this paper improves both cache and memory bandwidth utilization by making memory accesses more sequential and regular by careful partitioning, rearranging, and batching of operations, and it achieves an order of magnitude performance improvement over the fastest existing system.
Journal ArticleDOI
Accurate, efficient and scalable training of Graph Neural Networks
TL;DR: The proposed training outperforms the state-of-the-art in scalability, efficiency and accuracy simultaneously simultaneously and enables fast training of deeper GNNs, as demonstrated by orders of magnitude speedup compared to the Tensorflow implementation.
Accelerating weighted random sampling without replacement
TL;DR: Four alternative implementations for the case of weighted sampling without replacement are presented, with an analysis of their run time and correctness.
Dissertation
From few-body atomic physics to many-body statistical physics : the unitary Bose gas and the three-body hard-core model
TL;DR: In this paper, an algorithme de Monte Carlo quantique capable de realiser les differentes phases thermodynamiques du systeme : gaz normal a haute-temperature, condensat de Bose-Einstein, and liquide d'Efimov.
Posted Content
Scaling up Dynamic Topic Models
TL;DR: In this article, the Gibbs sampling with stochastic gradient Langevin dynamics (GSDL) algorithm is used to learn the dynamics of 1,000 topics from 2.6 million documents in less than half an hour and their empirical results show that their algorithm is not only orders of magnitude faster than the baselines but also achieves lower perplexity.
References
More filters
Journal ArticleDOI
An approximate method for generating asymmetric random variables
TL;DR: A method for generating values of continuous symmetric random variables that is relatively fast, requires essentially no computer memory, and is easy to use is developed.
Journal ArticleDOI
New fast method for generating discrete random numbers with arbitrary frequency distributions
TL;DR: A new method for generating discrete random numbers with arbitrary amplitude/frequency distributions is presented, which consists essentially of amplitude manipulation of uniformly distributed, statistically independent sequential numbers.
Journal ArticleDOI
Fast generation of uniformly distributed pseudorandom numbers with floating-point representation
TL;DR: A new method is presented for generating uniformly distributed pesudorandom numbers with a floating-point representation that features fast single-clock-pulse operation.
Journal ArticleDOI
Pseudonoise with Arbitrary Amplitude Distribution--Part I: Theory
John S. Sobolewski,W. H. Payne +1 more
TL;DR: A new sampling method, conditional bit sampling, which is suited for hardwired sampling devices because of its generality, simplicity, and accuracy, and agreement between actual and theoretical performance was excellent.