English
Related papers

Related papers: A Size-Free CLT for Poisson Multinomials and its A…

200 papers

An $(n,k)$-Poisson Multinomial Distribution (PMD) is the distribution of the sum of $n$ independent random vectors supported on the set ${\cal B}_k=\{e_1,\ldots,e_k\}$ of standard basis vectors in $\mathbb{R}^k$. We prove a structural…

Data Structures and Algorithms · Computer Science 2015-11-24 Constantinos Daskalakis , Gautam Kamath , Christos Tzamos

An $(n, k)$-Poisson Multinomial Distribution (PMD) is a random variable of the form $X = \sum_{i=1}^n X_i$, where the $X_i$'s are independent random vectors supported on the set of standard basis vectors in $\mathbb{R}^k.$ In this paper, we…

Data Structures and Algorithms · Computer Science 2016-06-23 Ilias Diakonikolas , Daniel M. Kane , Alistair Stewart

The Poisson multinomial distribution (PMD) describes the distribution of the sum of $n$ independent but non-identically distributed random vectors, in which each random vector is of length $m$ with 0/1 valued elements and only one of its…

Computation · Statistics 2022-01-13 Zhengzhi Lin , Yueyao Wang , Yili Hong

We give an algorithm for properly learning Poisson binomial distributions. A Poisson binomial distribution (PBD) of order $n$ is the discrete probability distribution of the sum of $n$ mutually independent Bernoulli random variables. Given…

Data Structures and Algorithms · Computer Science 2015-11-13 Ilias Diakonikolas , Daniel M. Kane , Alistair Stewart

We establish inequalities for assessing the distance between the distribution of a (possibly multidimensional) functional of a Poisson random measure and that of a Gaussian element. Our bounds only involve add-one cost operators at the…

Probability · Mathematics 2020-10-27 Raphaël Lachièze-Rey , Giovanni Peccati , Xiaochuan Yang

We show that there is a polynomial-time approximation scheme for computing Nash equilibria in anonymous games with any fixed number of strategies (a very broad and important class of games), extending the two-strategy result of Daskalakis…

Computer Science and Game Theory · Computer Science 2016-11-15 Constantinos Daskalakis , Christos H. Papadimitriou

A striking result of [Acharya et al. 2017] showed that to estimate symmetric properties of discrete distributions, plugging in the distribution that maximizes the likelihood of observed multiset of frequencies, also known as the profile…

Statistics Theory · Mathematics 2020-11-03 Yanjun Han , Kirankumar Shiragur

For all $n, \epsilon >0$, we show that the set of Poisson Binomial distributions on $n$ variables admits a proper $\epsilon$-cover in total variation distance of size $n^2+n \cdot (1/\epsilon)^{O(\log^2 (1/\epsilon))}$, which can also be…

Computation · Statistics 2014-10-03 Constantinos Daskalakis , Christos Papadimitriou

We prove a multivariate central limit theorem with explicit error bound on a non-smooth function distance for sums of bounded decomposable $d$-dimensional random vectors. The decomposition structure is similar to that of Barbour, Karo\'nski…

Probability · Mathematics 2015-05-19 Xiao Fang

Multivariate count data are commonly encountered through high-throughput sequencing technologies in bioinformatics, text mining, or in sports analytics. Although the Poisson distribution seems a natural fit to these count data, its…

Computation · Statistics 2020-04-16 Sanjeena Subedi , Ryan Browne

This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…

Numerical Analysis · Mathematics 2018-10-30 Sharif Rahman

Inspired by R. Speicher's multidimensional free central limit theorem and semicircle families, we prove an infinite dimensional compound Poisson limit theorem in free probability, and define infinite dimensional compound free Poisson…

Operator Algebras · Mathematics 2017-12-19 Guimei An , Mingchu Gao

We investigate the complexity of computing approximate Nash equilibria in anonymous games. Our main algorithmic result is the following: For any $n$-player anonymous game with a bounded number of strategies and any constant $\delta>0$, an…

Computer Science and Game Theory · Computer Science 2016-08-29 Yu Cheng , Ilias Diakonikolas , Alistair Stewart

We introduce the problem of simultaneously learning all powers of a Poisson Binomial Distribution (PBD). A PBD of order $n$ is the distribution of a sum of $n$ mutually independent Bernoulli random variables $X_i$, where $\mathbb{E}[X_i] =…

Data Structures and Algorithms · Computer Science 2017-07-19 Dimitris Fotakis , Vasilis Kontonis , Piotr Krysta , Paul Spirakis

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…

Data Structures and Algorithms · Computer Science 2015-02-18 Constantinos Daskalakis , Ilias Diakonikolas , Rocco A. Servedio

Let $\mathbf{Q}=(Q_1,\ldots,Q_n)$ be a random vector drawn from the uniform distribution on the set of all $n!$ permutations of $\{1,2,\ldots,n\}$. Let $\mathbf{Z}=(Z_1,\ldots,Z_n)$, where $Z_j$ is the mean zero variance one random variable…

Statistics Theory · Mathematics 2015-11-18 Zhigang Bao , Liang-Ching Lin , Guangming Pan , Wang Zhou

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…

Computational Complexity · Computer Science 2024-12-20 Mario Ullrich , Jan Vybíral

We consider the problem of clustering mixtures of mean-separated Gaussians in high dimensions. We are given samples from a mixture of $k$ identity covariance Gaussians, so that the minimum pairwise distance between any two pairs of means is…

Data Structures and Algorithms · Computer Science 2021-12-02 Jerry Li , Allen Liu

A Poisson Binomial distribution over $n$ variables is the distribution of the sum of $n$ independent Bernoullis. We provide a sample near-optimal algorithm for testing whether a distribution $P$ supported on $\{0,...,n\}$ to which we have…

Data Structures and Algorithms · Computer Science 2014-10-15 Jayadev Acharya , Constantinos Daskalakis

Let $k,d $ be positive integers. We determine a sequence of constants that are asymptotic to the probability that the cluster at the origin in a $d$-dimensional Poisson Boolean model with balls of fixed radius is of order $k$, as the…

Probability · Mathematics 2025-04-10 Mathew D. Penrose , Xiaochuan Yang
‹ Prev 1 2 3 10 Next ›