相关论文: Learning Powers of Poisson Binomial Distributions

We study the density estimation problem defined as follows: given $k$ distributions $p_1, \ldots, p_k$ over a discrete domain $[n]$, as well as a collection of samples chosen from a ``query'' distribution $q$ over $[n]$, output $p_i$ that…

The polynomial birth-death distribution (abbr. as PBD) on $\ci=\{0,1,2, >...\}$ or $\ci=\{0,1,2, ..., m\}$ for some finite $m$ introduced in Brown & Xia (2001) is the equilibrium distribution of the birth-death process with birth rates…

The $k$th-nearest neighbor rule is arguably the simplest and most intuitively appealing nonparametric classification procedure. However, application of this method is inhibited by lack of knowledge about its properties, in particular, about…

We consider the problem of learning an unknown product distribution $X$ over $\{0,1\}^n$ using samples $f(X)$ where $f$ is a \emph{known} transformation function. Each choice of a transformation function $f$ specifies a learning problem in…

The sum of $n$ {non-independent} Bernoulli random variables could be modeled in several different ways. One of these is the Multiplicative Binomial Distribution (MBD), introduced by Altham (1978) and revised by Lovison (1998). In this work,…

In this paper, we introduce a new class of bivariate distributions by compounding the bivariate generalized exponential and power-series distributions. This new class contains some new sub-models such as the bivariate generalized…

Let $ V_{n} = X_{1,n} + X_{2,n} + \cdots + X_{n,n}$ where $X_{i,n}$ are Bernoulli random variables which take the value $1$ with probability $b(i;n)$. Let $\lambda_{n} = \sum\limits_{i=1}^{n} b(i;n) $, $\lambda = \lim\limits_{n \to \infty}…

Probability distributions produced by the cross-entropy loss for ordinal classification problems can possess undesired properties. We propose a straightforward technique to constrain discrete ordinal probability distributions to be unimodal…

The Poisson distribution of order $k$ is a special case of a compound Poisson distribution. Its mean and variance are known, but results for its median and mode are difficult to obtain, although a few cases have been solved and upper/lower…

We introduce the Poisson Binomial mechanism (PBM), a discrete differential privacy mechanism for distributed mean estimation (DME) with applications to federated learning and analytics. We provide a tight analysis of its privacy guarantees,…

Counting experiments often rely on Monte Carlo simulations for predictions of Poisson expectations. The accompanying uncertainty from the finite Monte Carlo sample size can be incorporated into parameter estimation by modifying the Poisson…

An important functional of Poisson random measure is the negative binomial process (NBP). We use NBP to introduce a generalized Poisson-Kingman distribution and its corresponding random discrete probability measure. This random discrete…

We consider a variant of the stochastic gradient descent (SGD) with a random learning rate and reveal its convergence properties. SGD is a widely used stochastic optimization algorithm in machine learning, especially deep learning. Numerous…

We give an algorithm for learning a mixture of {\em unstructured} distributions. This problem arises in various unsupervised learning scenarios, for example in learning {\em topic models} from a corpus of documents spanning several topics.…

For three decades binary decision diagrams, a data structure efficiently representing Boolean functions, have been widely used in many distinct contexts like model verification, machine learning, cryptography and also resolution of…

Let $X_1,\dots,X_n$ be independent nonnegative random variables (r.v.'s), with $S_n:=X_1+\dots+X_n$ and finite values of $s_i:=E X_i^2$ and $m_i:=E X_i>0$. Exact upper bounds on $E f(S_n)$ for all functions $f$ in a certain class…

We propose a simultaneous learning and pruning algorithm capable of identifying and eliminating irrelevant structures in a neural network during the early stages of training. Thus, the computational cost of subsequent training iterations,…

The paper tackles the power of randomization in the context of locality by analyzing the ability to`boost' the success probability of deciding a distributed language. The main outcome of this analysis is that the distributed computing…

For entropy driven balanced processes we obtain final states with Poisson, Bernoulli, negative binomial and P\'olya distributions. We apply this both for complex networks and particle production. For random networks we follow the evolution…

The negative binomial distribution has been widely used as a more flexible model than the Poisson distribution for count data. However, when the true data-generating process is Poisson, it is often challenging to distinguish it from a…