English
Related papers

Related papers: Simple perfect samplers using monotone birth-and-d…

200 papers

Diffusion generative models have emerged as a new challenger to popular deep neural generative models such as GANs, but have the drawback that they often require a huge number of neural function evaluations (NFEs) during synthesis unless…

Machine Learning · Statistics 2022-10-12 Hideyuki Tachibana , Mocho Go , Muneyoshi Inahara , Yotaro Katayama , Yotaro Watanabe

Continuous-time birth-death-shift (BDS) processes are frequently used in stochastic modeling, with many applications in ecology and epidemiology. In particular, such processes can model evolutionary dynamics of transposable elements -…

Methodology · Statistics 2014-12-02 Jason Xu , Peter Guttorp , Midori Kato-Maeda , Vladimir N. Minin

Randomized algorithms depend on accurate sampling from probability distributions, as their correctness and performance hinge on the quality of the generated samples. However, even for common distributions like Binomial, exact sampling is…

Computation · Statistics 2025-06-17 Uddalok Sarkar , Sourav Chakraborty , Kuldeep S. Meel

A one-to-one correspondence is established between the bridge path space of birth-death processes and the exclusive union of the product spaces of simplexes and integer grids. Formulae are derived for the exact counting of the integer grid…

Computation · Statistics 2022-08-09 Lin Sun , Gang Wei

Given a vector $x \in \mathbb{R}^n$ induced by a turnstile stream $S$, a non-negative function $G: \mathbb{R} \to \mathbb{R}$, a perfect $G$-sampler outputs an index $i$ with probability $\frac{G(x_i)}{\sum_{j\in[n]}…

Data Structures and Algorithms · Computer Science 2025-04-11 David P. Woodruff , Shenghao Xie , Samson Zhou

The training phases of Deep neural network~(DNN) consumes enormous processing time and energy. Compression techniques utilizing the sparsity of DNNs can effectively accelerate the inference phase of DNNs. However, it can be hardly used in…

Machine Learning · Computer Science 2018-12-17 Zhuoran Song , Ru Wang , Dongyu Ru , Hongru Huang , Zhenghao Peng , Jing Ke , Xiaoyao Liang , Li Jiang

This article introduces new algorithms for the uniform random generation of labelled planar graphs. Its principles rely on Boltzmann samplers, as recently developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the Boltzmann…

Combinatorics · Mathematics 2008-12-18 Eric Fusy

A discrete-time two-dimensional quasi-birth-and-death process (2d-QBD process), $\{{\boldsymbol{Y}}_n\}=\{(X_{1,n},X_{2,n},J_n)\}$, is a two-dimensional skip-free random walk $\{(X_{1,n},X_{2,n})\}$ on $\mathbb{Z}_+^2$ with a supplemental…

Probability · Mathematics 2018-07-23 Toshihisa Ozawa , Masahiro Kobayashi

We show how to generate random derangements efficiently by two different techniques: random restricted transpositions and sequential importance sampling. The algorithm employing restricted transpositions can also be used to generate random…

Computation · Statistics 2020-08-17 J. R. G. Mendonça

In this paper we aim to construct infinite dimensional versions of well established Piecewise Deterministic Monte Carlo methods, such as the Bouncy Particle Sampler, the Zig-Zag Sampler and the Boomerang Sampler. In order to do so we…

Probability · Mathematics 2022-05-24 Paul Dobson , Joris Bierkens

The Median of Medians (also known as BFPRT) algorithm, although a landmark theoretical achievement, is seldom used in practice because it and its variants are slower than simple approaches based on sampling. The main contribution of this…

Data Structures and Algorithms · Computer Science 2016-08-05 Andrei Alexandrescu

The problem of estimating the growth rate of a birth and death processes based on the coalescence times of a sample of $n$ individuals has been considered by several authors (\cite{stadler2009incomplete, williams2022life,…

Methodology · Statistics 2026-02-26 Carola Sophia Heinzel , Jason Schweinsberg

Enriching Brownian motion with regenerations from a fixed regeneration distribution $\mu$ at a particular regeneration rate $\kappa$ results in a Markov process that has a target distribution $\pi$ as its invariant distribution. For the…

Computation · Statistics 2024-02-22 Hector McKimm , Andi Q Wang , Murray Pollock , Christian P Robert , Gareth O Roberts

This paper gives new, efficient algorithms for approximate uniform sampling of contingency tables and integer partitions. The algorithms use the Burnside process, a general algorithm for sampling a uniform orbit of a finite group acting on…

Computation · Statistics 2025-09-03 Persi Diaconis , Michael Howes

Image super-resolution is a fundamentally ill-posed problem because multiple valid high-resolution images exist for one low-resolution image. Super-resolution methods based on diffusion probabilistic models can deal with the ill-posed…

Computer Vision and Pattern Recognition · Computer Science 2024-04-17 Yutao Yuan , Chun Yuan

Linear birth-and-death processes (LBDPs) are foundational stochastic models in population dynamics, evolutionary biology, and hematopoiesis. Estimating parameters from discretely observed data is computationally demanding due to irregular…

Computation · Statistics 2025-08-26 Xiaochen Long , Marek Kimmel

Determinantal point processes (DPPs) are random point processes well-suited for modeling repulsion. In machine learning, the focus of DPP-based models has been on diverse subset selection from a discrete and finite base set. This discrete…

Machine Learning · Statistics 2013-11-14 Raja Hafiz Affandi , Emily B. Fox , Ben Taskar

Live-cell microscopy allows to go beyond measuring average features of cellular populations to observe, quantify and explain biological heterogeneity. Deep Learning-based instance segmentation and cell tracking form the gold standard…

Quantitative Methods · Quantitative Biology 2024-08-09 Richard D. Paul , Johannes Seiffarth , Hanno Scharr , Katharina Nöh

The problem of learning a computational model from examples has been receiving growing attention. For the particularly challenging problem of learning models of distributed systems, existing results are restricted to models with a fixed…

Formal Languages and Automata Theory · Computer Science 2023-12-13 Dana Fisman , Noa Izsak , Swen Jacobs

Diffusion models generate high-quality synthetic data. They operate by defining a continuous-time forward process which gradually adds Gaussian noise to data until fully corrupted. The corresponding reverse process progressively "denoises"…

‹ Prev 1 4 5 6 7 8 10 Next ›