English
Related papers

Related papers: Exact Probability Bounds under Moment-matching Res…

200 papers

An explicit bound is given for the Kolmogorov distance between a mixture of normal distributions and a normal distribution with properly chosen parameter values. A random variable X has a mixture of normal distributions if its conditional…

Probability · Mathematics 2020-08-07 Krzysztof Bartoszek , Torkel Erhardsson

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

Computational Complexity · Computer Science 2021-03-16 Christopher Williamson

Granville and Soundararajan showed that the $k$th moment in the Erd\H{o}s--Kac theorem is equal to the $k$th moment of the standard Gaussian distribution in the range $k=o((\log \log x)^{1/3})$, up to a negligible error term. We show that…

Number Theory · Mathematics 2025-01-03 Ofir Gorodetsky

This paper introduces an upper bound on the absolute difference between: (a) the cumulative distribution function (CDF) of the sum of a finite number of independent and identically distributed random variables with finite absolute third…

Information Theory · Computer Science 2020-07-22 Dadja Anade , Jean-Marie Gorce , Philippe Mary , Samir Perlaza

A probability distribution over {-1, 1}^n is (eps, k)-wise uniform if, roughly, it is eps-close to the uniform distribution when restricted to any k coordinates. We consider the problem of how far an (eps, k)-wise uniform distribution can…

Data Structures and Algorithms · Computer Science 2018-06-12 Ryan O'Donnell , Yu Zhao

The majority of existing probabilistic model checking case studies are based on well understood theoretical models and distributions. However, real-life probabilistic systems usually involve distribution parameters whose values are obtained…

Software Engineering · Computer Science 2013-08-29 Guoxin Su , David S. Rosenblum

Necessary and sufficient conditions for a measure to be an extreme point of the set of measures (on an abstract measurable space) with prescribed generalized moments are given, as well as an application to extremal problems over such moment…

Optimization and Control · Mathematics 2017-01-17 Iosif Pinelis

We study the relative entropy between the empirical estimate of a discrete distribution and the true underlying distribution. If the minimum value of the probability mass function exceeds an $\alpha > 0$ (i.e. when the true underlying…

Statistics Theory · Mathematics 2021-09-21 Alankrita Bhatt , Ankit Pensia

The likelihood function of a finite mixture model is a non-convex function with multiple local maxima and commonly used iterative algorithms such as EM will converge to different solutions depending on initial conditions. In this paper we…

Machine Learning · Computer Science 2016-08-19 Elad Mezuman , Yair Weiss

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

Probability · Mathematics 2010-04-13 Vladimir Nikulin

This paper addresses the statistical problem of estimating the infinite-norm deviation from the empirical mean to the distribution mean for high-dimensional distributions on $\{0,1\}^d$, potentially with $d=\infty$. Unlike traditional…

Statistics Theory · Mathematics 2024-02-21 Moïse Blanchard , Václav Voráček

Tight bounds for several symmetric divergence measures are introduced, given in terms of the total variation distance. Each of these bounds is attained by a pair of 2 or 3-element probability distributions. An application of these bounds…

Information Theory · Computer Science 2016-11-15 Igal Sason

We consider the problem of guessing the realization of a random variable but under more general Tsallis' non-extensive entropic framework rather than the classical Maxwell-Boltzman-Gibbs-Shannon framework. We consider both the conditional…

Information Theory · Computer Science 2019-05-21 Abhik Ghosh

We seek an entropy estimator for discrete distributions with fully empirical accuracy bounds. As stated, this goal is infeasible without some prior assumptions on the distribution. We discover that a certain information moment assumption…

Information Theory · Computer Science 2022-12-27 Doron Cohen , Aryeh Kontorovich , Aaron Koolyk , Geoffrey Wolfer

Suppose $k$ centers are fit to $m$ points by heuristically minimizing the $k$-means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with $p\geq 4$ bounded moments; in…

Machine Learning · Computer Science 2013-11-11 Matus Telgarsky , Sanjoy Dasgupta

We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability…

Discrete Mathematics · Computer Science 2012-02-06 Harold Connamacher , Michael Molloy

We present some new and explicit error bounds for the approximation of distributions. The approximation error is quantified by the maximal density ratio of the distribution $Q$ to be approximated and its proxy $P$. This non-symmetric…

Statistics Theory · Mathematics 2022-09-02 Lutz Duembgen , Richard Samworth , Jon Wellner

This paper introduces constrained mixtures for continuous distributions, characterized by a mixture of distributions where each distribution has a shape similar to the base distribution and disjoint domains. This new concept is used to…

Machine Learning · Statistics 2015-03-29 Conrado S. Miranda , Fernando J. Von Zuben

We establish bounds on the probability that two different agents, who share an initial opinion expressed as a probability distribution on an abstract probability space, given two different sources of information, may come to radically…

Probability · Mathematics 2019-03-20 Krzysztof Burdzy , Jim Pitman

In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two…

Information Theory · Computer Science 2020-10-22 Amedeo Roberto Esposito , Michael Gastpar , Ibrahim Issa