Related papers: Multiparameter Bernoulli Factories
Many information sources are not just sequences of distinguishable symbols but rather have invariances governed by alternative counting paradigms such as permutations, combinations, and partitions. We consider an entire classification of…
We are interested to the multifractal analysis of inhomogeneous Bernoulli products which are also known as coin tossing measures. We give conditions ensuring the validity of the multifractal formalism for such measures. On another hand, we…
We are interested to the multifractal analysis of inhomogeneous Bernoulli products which are also known as coin tossing measures. We give conditions ensuring the validity of the multifractal formalism for such measures. On another hand, we…
Generation and manipulation of randomness is a relevant task for several applications of information technology. It has been shown that quantum mechanics offers some advantages for this type of task. A promising model for randomness…
In this note, we develop a bounded-error quantum algorithm that makes $\tilde O(n^{1/4}\varepsilon^{-1/2})$ queries to a Boolean function $f$, accepts a monotone function, and rejects a function that is $\varepsilon$-far from being…
For any discrete probability distributions with bounded entropy, we can generate exactly a random variate using only a finite expected number of perfect coin flips. A perfect coin flip is the outcome of an unbiased Bernoulli random…
In particle physics, as in many areas of science, parameter inference relies on simulations to bridge the gap between theory and experiment. Recent developments in simulation-based inference have boosted the sensitivity of analyses;…
In this paper, we address the random sampling problem for the class of Mellin band-limited functions BT which is concentrated on a bounded cube. It is established that any function in BT can be approximated by an element in a…
A nonparametric variant of the Kiefer--Weiss problem is proposed and investigated. In analogy to the classical Kiefer--Weiss problem, the objective is to minimize the maximum expected sample size of a sequential test. However, instead of…
Many systems exhibit a digit bias. For example, the first digit base 10 of the Fibonacci numbers, or of $2^n$, equals 1 not 10% or 11% of the time, as one would expect if all digits were equally likely, but about 30% of the time. This…
Bernstein processes are Brownian diffusions that appear in Euclidean Quantum Mechanics. Knowledge of the symmetries of the Hamilton-Jacobi-Bellman equation associated with these processes allows one to obtain relations between stochastic…
The problem of measuring an unbounded system attribute near a singularity has been discussed. Lenses have been introduced as formal objects to study increasingly precise measurements around the singularity and a specific family of lenses…
We consider a basic problem in unsupervised learning: learning an unknown \emph{Poisson Binomial Distribution}. A Poisson Binomial Distribution (PBD) over $\{0,1,\dots,n\}$ is the distribution of a sum of $n$ independent Bernoulli random…
Using multiple Bernoulli series, we give a formula in the spirit of Euler MacLaurin formula. We also give a wall crossing formula and a decomposition formula. The study of these series is motivated by formulae of E.Witten for volumes of…
Bayesian nonparametric (BNP) models provide elegant methods for discovering underlying latent features within a data set, but inference in such models can be slow. We exploit the fact that completely random measures, which commonly used…
We present new sampling methods in finite population that allow to control the joint inclusion probabilities of units and especially the spreading of sampled units in the population. They are based on the use of renewal chains and…
We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…
Using some extensions of a theorem of Heppes on finitely supported discrete probability measures, we address the problems of classification and testing based on projections. In particular, when the support of the distributions is known in…
While it is well known that a Turing machine equipped with the ability to flip a fair coin cannot compute more that a standard Turing machine, we show that this is not true for a biased coin. Indeed, any oracle set $X$ may be coded as a…
This paper addresses the mapping problem. Using a conjugate prior form, we derive the exact theoretical batch multi-object posterior density of the map given a set of measurements. The landmarks in the map are modeled as extended objects,…