English
Related papers

Related papers: Sampling exactly from the normal distribution

200 papers

We develop a computationally efficient and robust algorithm for generating pseudo-random samples from a broad class of smooth probability distributions in one and two dimensions. The algorithm is based on inverse transform sampling with a…

Numerical Analysis · Mathematics 2013-07-05 Sheehan Olver , Alex Townsend

Particle filtering is used to compute good nonlinear estimates of complex systems. It samples trajectories from a chosen distribution and computes the estimate as a weighted average. Easy-to-sample distributions often lead to degenerate…

Machine Learning · Computer Science 2021-10-07 Fernando Gama , Nicolas Zilberstein , Richard G. Baraniuk , Santiago Segarra

A new approach of obtaining stratified random samples from statistically dependent random variables is described. The proposed method can be used to obtain samples from the input space of a computer forward model in estimating expectations…

Methodology · Statistics 2019-11-25 Anirban Mondal , Abhijit Mandal

We construct an adaptive independent Metropolis-Hastings sampler that uses a mixture of normals as a proposal distribution. To take full advantage of the potential of adaptive sampling our algorithm updates the mixture of normals…

Computation · Statistics 2008-01-15 P. Giordani , R. Kohn

We provide the first generic exact simulation algorithm for multivariate diffusions. Current exact sampling algorithms for diffusions require the existence of a transformation which can be used to reduce the sampling problem to the case of…

Probability · Mathematics 2026-01-14 Jose Blanchet , Fan Zhang

This work studies the problem of separate random number generation from correlated general sources with side information at the tester under the criterion of statistical distance. Tight one-shot lower and upper performance bounds are…

Information Theory · Computer Science 2016-05-02 Shengtian Yang

Statistical system models provide the basis for the examination of various sorts of distributions. Classification distributions are a very common and versatile form of statistics in e.g. real economic, social, and IT systems. The…

Computation · Statistics 2019-12-20 Uwe Petersohn , Thomas Dedek , Sandra Zimmer , Hans Biskupski

We propose a simple subsampling scheme for fast randomized approximate computation of optimal transport distances. This scheme operates on a random subset of the full data and can use any exact algorithm as a black-box back-end, including…

Computation · Statistics 2020-12-17 Max Sommerfeld , Jörn Schrieber , Yoav Zemel , Axel Munk

The manuscript introduces a method to select a random sample from a stream by deciding on each sampling unit immediately after observing it. The process could be applied to unequal as well as equal probability sampling. The implementation…

Data Structures and Algorithms · Computer Science 2021-11-19 Bardia Panahbehagh , Raphaël Jauslin , Yves Tillé

This is the documentation for generating random samples from the quantum state space in accordance with a specified distribution, associated with this webpage: http://tinyurl.com/QSampling . Ready-made samples (each with at least a million…

Normalizing flows are a popular class of models for approximating probability distributions. However, their invertible nature limits their ability to model target distributions whose support have a complex topological structure, such as…

Machine Learning · Statistics 2022-02-25 Vincent Stimper , Bernhard Schölkopf , José Miguel Hernández-Lobato

Natural gradient methods have been used to optimise the parameters of probability distributions in a variety of settings, often resulting in fast-converging procedures. Unfortunately, for many distributions of interest, computing the…

Machine Learning · Statistics 2024-05-28 Jonathan So , Richard E. Turner

We present a new approach to sample from generic binary distributions, based on an exact Hamiltonian Monte Carlo algorithm applied to a piecewise continuous augmentation of the binary distribution of interest. An extension of this idea to…

Computation · Statistics 2015-10-13 Ari Pakman , Liam Paninski

Cardinality estimation algorithms receive a stream of elements whose order might be arbitrary, with possible repetitions, and return the number of distinct elements. Such algorithms usually seek to minimize the required storage and…

Data Structures and Algorithms · Computer Science 2015-08-26 Reuven Cohen , Liran Katzir , Aviv Yehezkel

Given a linear dynamical system, we consider the problem of constructing an approximate system using only a subset of the sensors out of the total set such that the observability Gramian of the new system is approximately equal to that of…

Systems and Control · Computer Science 2018-11-08 Shaunak D. Bopardikar

We provide a robust and general algorithm for computing distribution functions associated to induced orthogonal polynomial measures. We leverage several tools for orthogonal polynomials to provide a spectrally-accurate method for a broad…

Numerical Analysis · Mathematics 2017-04-28 Akil Narayan

Suppose one desires to randomly sample a pair of objects such as socks, hoping to get a matching pair. Even in the simplest situation for sampling, which is sampling with replacement, the innocent phrase "the distribution of the color of a…

Probability · Mathematics 2013-06-04 Richard Arratia , Stephen DeSalvo

Sampling from very large spatial populations is challenging. The solutions suggested in recent literature on this subject often require that the randomly selected units are well distributed across the study region by using complex…

Methodology · Statistics 2017-10-26 Roberto Benedetti , Federica Piersimoni

When reporting the results of clinical studies, some researchers may choose the five-number summary (including the sample median, the first and third quartiles, and the minimum and maximum values) rather than the sample mean and standard…

Methodology · Statistics 2020-06-18 Jiandong Shi , Dehui Luo , Hong Weng , Xian-Tao Zeng , Lu Lin , Haitao Chu , Tiejun Tong

In this work, we study how to efficiently obtain perfect samples from a discrete distribution $\mathcal{D}$ given access only to pairwise comparisons of elements of its support. Specifically, we assume access to samples $(x, S)$, where $S$…

Machine Learning · Computer Science 2023-02-28 Dimitris Fotakis , Alkis Kalavasis , Christos Tzamos
‹ Prev 1 3 4 5 6 7 10 Next ›